Bundling Two Simple Polygons to Minimize Their Convex Hull

DOI10.1007/978-3-319-53925-6_6zbMath1485.68266OpenAlexW2588639785MaRDI QIDQ2980899

Hee-Kap Ahn, Jong Min Choi, Dong Woo Park

Publication date: 5 May 2017

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53925-6_6

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Rotational polygon containment and minimum enclosure using only robust 2D constructions
• Multiple translational containment. I: An approximate algorithm
• The minimum convex container of two convex polytopes under translations
• Disk packing for the estimation of the size of a wire bundle
• Aligning two convex figures to minimize area or perimeter
• Maximum overlap and minimum convex hull of two convex polyhedra under translations
• MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
• Unnamed Item
• Unnamed Item

This page was built for publication: Bundling Two Simple Polygons to Minimize Their Convex Hull