Bundling three convex polygons to minimize area or perimeter

DOI10.1016/j.comgeo.2015.10.003zbMath1341.52004OpenAlexW2192360925WikidataQ103822038 ScholiaQ103822038MaRDI QIDQ902419

Sang Won Bae, Hee-Kap Ahn, Helmut Alt, Dong Woo Park

Publication date: 18 January 2016

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2015.10.003

zbMATH Keywords

optimizationconvex polygonpacking problemexact algorithmbundling of polygons

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (1)

Packing convex polygons in minimum-perimeter convex hulls

Cites Work

• Translational packing of arbitrary polytopes
• Multiple translational containment. I: An approximate algorithm
• Disk packing for the estimation of the size of a wire bundle
• Aligning two convex figures to minimize area or perimeter
• MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
• Algorithms and Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bundling three convex polygons to minimize area or perimeter