Abstract
We investigate the problem of finding a minimum-area container for the disjoint packing of a set of convex polygons by translations. In particular, we consider axis-parallel rectangles or arbitrary convex sets as containers. For both optimization problems which are NP-hard we develop efficient constant factor approximation algorithms.
Research was partially carried out at the International INRIA-McGill-Victoria Workshop on Problems in Computational Geometry, Barbados 2015. Research by Mark de Berg was also supported by the Netherlands’ Organisation for Scientific Research (NWO) under project no. 024.002.003.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahn, H.-K., Alt, H., Bae, S.W., Park, D.: Bundling Three Convex Polygons to Minimize Area or Perimeter. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 13–24. Springer, Heidelberg (2013)
Ahn, H.-K., Cheong, O.: Aligning two convex figures to minimize area or perimeter. Algorithmica 62(1-2), 464–479 (2012)
Alt, H., Hurtado, F.: Packing convex polygons into rectangular boxes. In: JCDCG, pp. 67–80 (2000)
Fowler, R.J., Paterson, M., Tanimoto, S.L.: Optimal packing and covering in the plane are np-complete. Inf. Process. Lett. 12(3), 133–137 (1981)
Harren, R., Jansen, K., Prädel, L., van Stee, R.: A (5/3 + ε)-approximation for strip packing. Comput. Geom. 47(2), 248–267 (2014)
Hershberger, J.: Finding the upper envelope of n line segments in o(n log n) time. Inf. Process. Lett. 33(4), 169–174 (1989)
Lee, H.-C., Woo, T.C.: Determining in linear time the minimum area convex hull of two polygons. IIE Transactions 20(4), 338–345 (1988)
Milenkovic, V.: Translational polygon containment and minimal enclosure using linear programming based restriction. In: STOC, pp. 109–118 (1996)
Milenkovic, V.: Multiple translational containment. part ii: Exact algorithms. Algorithmica 19(1/2), 183–218 (1997)
Milenkovic, V.: Rotational polygon containment and minimum enclosure. In: Symposium on Computational Geometry, pp. 1–8 (1998)
Scheithauer, G.: Zuschnitt- und Packungsoptimierung: Problemstellungen, Modellierungstechniken, Lösungsmethoden. Studienbücher Wirtschaftsmathematik. Vieweg+Teubner Verlag (2008)
Schiermeyer, I.: Reverse-fit: A 2-optimal algorithm for packing rectangles. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 290–299. Springer, Heidelberg (1994)
Steinberg, A.: A strip-packing algorithm with absolute performance bound 2. SIAM J. Comput. 26(2), 401–409 (1997)
Tang, K., Wang, C.C.L., Chen, D.Z.: Minimum area convex packing of two convex polygons. Int. J. Comput. Geometry Appl. 16(1), 41–74 (2006)
von Niederhäusern, L.: Packing polygons. Master’s thesis, EPFL Lausanne, FU Berlin (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alt, H., de Berg, M., Knauer, C. (2015). Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. In: Bansal, N., Finocchi, I. (eds) Algorithms - ESA 2015. Lecture Notes in Computer Science(), vol 9294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48350-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-48350-3_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48349-7
Online ISBN: 978-3-662-48350-3
eBook Packages: Computer ScienceComputer Science (R0)