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.
Cite
CITATION STYLE
Alt, H., De Berg, M., & Knauer, C. (2015). Approximating minimum-area rectangular and convex containers for packing convex polygons. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9294, pp. 25–34). Springer Verlag. https://doi.org/10.1007/978-3-662-48350-3_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
