Abstract
We consider the problem of packing several convex polygons into minimu, size rectangles. For this purpose the purpose the polygons may be moved either by translation only, or by combinations of translations and rotations. We investigates both cases, that the polygons may overlap when being packed or that they must be disjoint. The size of a rectangle to be minimized can either be its area or its perimeter. In the case of overlapping packing very efficient algorithms whose runtime is close to linear or O (n log n) can be found even for an arbitrary number of polygons. Disjoint optimal packing is known to be NP-hard for arbitrary numbers of polygons. Here, efficient algorithms are given for disjoint packing of two polygons with a runtime close to linear for translations and O (n 3) for general isometries.
Partially supported by the German Research Association (DFG), projects A1 253/4-2 and A1 253/4-3.
Partially supported by CUR Gen. Cat. 1999SGR00356 and Proyecto DGES-MEC PB98-0933.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
H. Alt and F. Hurtado. Packing convex polygons into rectangular boxes. Technical Report, Institute for Computer Science, Freie Universität Berlin, 2001.
F. Avnaim and J.-D. Boissonnat. Simultaneous containment of several polygons. In Proc. 3rd Annu. ACM Sympos. Comput. Geom., pages 242–250, 1987.
K. Daniels and V. J. Milenkovic. Multiple translational containment, Part I: An approximate algorithm. Algorithmica, 19(1-2):148–182, September 1997.
H. Freemand and R. Shapira. Determining the minimum-area encasing rectangle for an arbitrary closed curve. Commun. ACM, 18:409–413, 1975.
V. Milenkovic. Translational polygon containment and minimal enclosure using linear programming based restriction. In Proc. 28th Annu. ACM Sympos. Theory Comput., pages 109–118, 1996.
J. O’Rourke. Finding minimal enclosing boxes. Internat. J. Comput. Inform. Sci., 14:183–199, June 1985.
J. O’Rourke, A. Aggarwal, S. Maddila, and M. Baldwin. An optimal algorithm for finding minimal enclosing triangles. J. Algorithm, 7:258–269, 1986.
M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York, 1995.
G. T. Toussaint. Solving geometric problems with the rotating calipers. In Proc. IEEE MELECON’ 83, pages A10.02/1–4, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alt, H., Hurtado, F. (2001). Packing Convex Polygons into Rectangular Boxes. In: Akiyama, J., Kano, M., Urabe, M. (eds) Discrete and Computational Geometry. JCDCG 2000. Lecture Notes in Computer Science, vol 2098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47738-1_5
Download citation
DOI: https://doi.org/10.1007/3-540-47738-1_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42306-5
Online ISBN: 978-3-540-47738-9
eBook Packages: Springer Book Archive