Abstract
Given two compact convex sets C 1 and C 2 in the plane, we consider the problem of finding a placement ϕC 1 of C 1 that minimizes the area of the convex hull of ϕC 1 ∪ C 2. We first consider the case where ϕC 1 and C 2 are allowed to intersect (as in “stacking” two flat objects in a convex box), and then add the restriction that their interior has to remain disjoint (as when “bundling” two convex objects together into a tight bundle). In both cases, we consider both the case where we are allowed to reorient C 1, and where the orientation is fixed. In the case without reorientations, we achieve exact near-linear time algorithms, in the case with reorientations we compute a (1 + ε)-approximation in time O(ε − 1/2 log n + ε − 3/2 log ε − 1/2), if two sets are convex polygons with n vertices in total.
This research was supported by LG Electronics.
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
Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating Extent Measures of Points. Journal of the ACM 51, 606–635 (2004)
Ahn, H.-K., Brass, P., Cheong, O., Na, H.-S., Shin, C.-S., Vigneron, A.: Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. To appear in Comput. Geom. Theory Appl.
Ahn, H.-K., Cheong, O., Park, C.-D., Shin, C.-S., Vigneron, A.: Maximizing the overlap of two planar convex sets under rigid motions. In: Proc. 21st Annu. Symp. Comput. geometry, pp. 356–363 (2005)
Alt, H., Blömer, J., Godau, M., Wagener, H.: Approximation of convex polygons. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 703–716. Springer, Heidelberg (1990)
Alt, H., Fuchs, U., Rote, G., Weber, G.: Matching convex shapes with respect to the symmetric difference. Algorithmica 21, 89–103 (1998)
de Berg, M., Cabello, S., Giannopoulos, P., Knauer, C., van Oostrum, R., Veltkamp, R.C.: Maximizing the area of overlap of two unions of disks under rigid motion. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 138–149. Springer, Heidelberg (2004)
de Berg, M., Cheong, O., Devillers, O., van Kreveld, M., Teillaud, M.: Computing the maximum overlap of two convex polygons under translations. Theo. Comp. Sci. 31, 613–628 (1998)
Dudley, R.M.: Metric entropy of some classes of sets with differentiable boundaries. J. Approximation Theory 10, 227–236 (1974); Erratum in J. Approx. Theory 26, 192–193 (1979)
Matoušek, J.: Lectures on Discrete Geometry. Springer, New York (2002)
Milenkovic, V.J.: Rotational polygon containment and minimum enclosure. In: Proc. 14th Annu. Symp. Comput. geometry, pp. 1–8 (1998)
Mount, D.M., Silverman, R., Wu, A.Y.: On the area of overlap of translated polygons. Computer Vision and Image Understanding: CVIU 64(1), 53–61 (1996)
Sugihara, K., Sawai, M., Sano, H., Kim, D.-S., Kim, D.: Disk Packing for the Estimation of the Size of a Wire Bundle. Japan Journal of Industrial and Applied Mathematics 21(3), 259–278 (2004)
Yaglom, I.M., Boltyanskii, V.G.: Convex figures. Holt, Rinehart and Winston, New York (1961)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahn, HK., Cheong, O. (2005). Stacking and Bundling Two Convex Polygons. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_88
Download citation
DOI: https://doi.org/10.1007/11602613_88
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30935-2
Online ISBN: 978-3-540-32426-3
eBook Packages: Computer ScienceComputer Science (R0)