Packing Convex Polygons into Rectangular Boxes
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.
KeywordsProblem Complexity Computer Graphic Arbitrary Number Efficient Algorithm Algorithm Analysis
Unable to display preview. Download preview PDF.
- 1.H. Alt and F. Hurtado. Packing convex polygons into rectangular boxes. Technical Report, Institute for Computer Science, Freie Universität Berlin, 2001.Google Scholar
- 2.F. Avnaim and J.-D. Boissonnat. Simultaneous containment of several polygons. In Proc. 3rd Annu. ACM Sympos. Comput. Geom., pages 242–250, 1987.Google Scholar
- 5.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.Google Scholar
- 9.G. T. Toussaint. Solving geometric problems with the rotating calipers. In Proc. IEEE MELECON’ 83, pages A10.02/1–4, 1983.Google Scholar