Document Open Access Logo

Approximating Smallest Containers for Packing Three-Dimensional Convex Objects

Authors Helmut Alt, Nadja Scharf

PDF

File

Thumbnail PDF
PDF
LIPIcs.ISAAC.2016.11.pdf
  • Filesize: 0.58 MB
  • 14 pages

Document Identifiers

Subject Classification

Keywords
  • computational geometry
  • packing
  • approximation algorithm

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We investigate the problem of computing a minimum-volume container for the non-overlapping packing of a given set of three-dimensional convex objects. Already the simplest versions of the problem are NP-hard so that we cannot expect to find exact polynomial time algorithms.

We give constant ratio approximation algorithms for packing axis-parallel (rectangular) cuboids under translation into an axis-parallel (rectangular) cuboid as container, for packing cuboids under rigid motions into an axis-parallel cuboid or into an arbitrary convex container, and for packing convex polyhedra under rigid motions into an axis-parallel cuboid or arbitrary convex container. This work gives the first approximability results for the computation of minimum volume containers for the objects described.

Cite As Get BibTex

Helmut Alt and Nadja Scharf. Approximating Smallest Containers for Packing Three-Dimensional Convex Objects. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 11:1-11:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016) https://doi.org/10.4230/LIPIcs.ISAAC.2016.11

Author Details

Helmut Alt
Nadja Scharf

References

  1. Helmut Alt, Mark de Berg, and Christian Knauer. Approximating minimum-area rectangular and convex containers for packing convex polygons. In Proc. 23th Annual European Symp. Algorithms (ESA), pages 25-34, 2015. Google Scholar
  2. Nikhil Bansal, José R. Correa, Claire Kenyon, and Maxim Sviridenko. Bin packing in multiple dimensions: inapproximability results and approximation schemes. Math. Oper. Res., 31(1):31-49, 2006. Google Scholar
  3. Nikhil Bansal and Arindam Khan. Improved approximation algorithm for two-dimensional bin packing. In Proc. 25th Annual ACM-SIAM Symp. Discrete Algorithms (SODA), pages 13-25, 2014. Google Scholar
  4. H. S. M. Coxeter. Introduction to geometry, page 12. John Wiley &Sons, Inc., New York-London-Sydney, second edition, 1969. Google Scholar
  5. Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, and Henning Thomas. Approximation algorithms for 3D orthogonal knapsack. J. Comput. Sci. Tech., 23(5):749-762, 2008. Google Scholar
  6. Klaus Jansen and Lars Prädel. A new asymptotic approximation algorithm for 3-dimensional strip packing. In Proc. 40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), pages 327-338, 2014. Google Scholar
  7. Claire Kenyon and Eric Rémila. A near-optimal solution to a two-dimensional cutting stock problem. Math. Oper. Res., 25(4):645-656, 2000. Google Scholar
  8. A. M. Macbeath. A compactness theorem for affine equivalence-classes of convex regions. Canadian J. Math., 3:54-61, 1951. Google Scholar
  9. F. K. Miyazawa and Y. Wakabayashi. Three-dimensional packings with rotations. Comput. Oper. Res., 36(10):2801-2815, 2009. Google Scholar
  10. Edgar A. Ramos. An optimal deterministic algorithm for computing the diameter of a three-dimensional point set. Discrete & Computational Geometry, 26(2):233-244, 2001. Google Scholar
  11. Léonard von Niederhäusern. Packing polygons: Research of approximation algorithms. Master’s thesis, Freie Universität Berlin and École Polytechnique Fédérale de Lausanne, 2014. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact