Advertisement

Bundling Three Convex Polygons to Minimize Area or Perimeter

  • Hee-Kap Ahn
  • Helmut Alt
  • Sang Won Bae
  • Dongwoo Park
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8037)

Abstract

Given a set \({\mathcal P} =\{P_0,\ldots,P_{k-1}\}\) of k convex polygons having n vertices in total in the plane, we consider the problem of finding k translations τ 0,…,τ k − 1 of P 0,…,P k − 1 such that the translated copies τ i P i are pairwise disjoint and the area or the perimeter of the convex hull of \(\bigcup_{i=0}^{k-1}\tau_iP_i\) is minimized. When k = 2, the problem can be solved in linear time but no previous work is known for larger k except a hardness result: it is NP-hard if k is part of input. We show that for k = 3 the translation space of P 1 and P 2 can be decomposed into O(n 2) cells in each of which the combinatorial structure of the convex hull remains the same and the area or perimeter function can be fully described with O(1) complexity. Based on this decomposition, we present a first O(n 2)-time algorithm that returns an optimal pair of translations minimizing the area or the perimeter of the corresponding convex hull.

Keywords

Convex Hull Feasible Region Convex Polygon Event Curve Combinatorial Structure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahn, H.-K., Cheong, O.: Stacking and bundling two convex polygons. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 882–891. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    Ahn, H.K., Cheong, O.: Aligning two convex figures to minimize area or perimeter. Algorithmica 62, 464–479 (2012)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Alt, H., Hurtado, F.: Packing convex polygons into rectangular boxes. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 2000. LNCS, vol. 2098, pp. 67–80. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Daniels, K., Milenkovic, V.: Multiple translational containment, part i: An approximation algorithm. Algorithmica 19, 148–182 (1997)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco (1979)MATHGoogle Scholar
  6. 6.
    Lee, H., Woo, T.: Determining in linear time the minimum area convex hull of two polygons. IIE Trans. 20, 338–345 (1988)CrossRefGoogle Scholar
  7. 7.
    Milenkovic, V.: Translational polygon containment and minimum enclosure using linear programming based restriction. In: Proc. 28th Annual ACM Symposium on Theory of Computation (STOC 1996), pp. 109–118 (1996)Google Scholar
  8. 8.
    Sugihara, K., Sawai, M., Sano, H., Kim, D.S., Kim, D.: Disk packing for the estimation of the size of a wire bundle. Japan J. Industrial and Applied Math. 21, 259–278 (2004)MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Tang, K., Wang, C., Chen, D.: Minimum area convex packing of two convex polygons. Internat. J. Comput. Geom. Appl. 16, 41–74 (2006)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Hee-Kap Ahn
    • 1
  • Helmut Alt
    • 2
  • Sang Won Bae
    • 3
  • Dongwoo Park
    • 1
  1. 1.POSTECHSouth Korea
  2. 2.Freie Universität BerlinGermany
  3. 3.Kyonggi UniversitySouth Korea

Personalised recommendations