The minimum convex container of two convex polytopes under translations

DOI10.1016/J.COMGEO.2018.02.004MaRDI QIDQ1622345zbMATH OpenOpenAlexFDO

Authors Hee-Kap Ahn, Sang Won Bae, Susanna Dann, Chan-Su Shin, Judit Abardia, Otfried Cheong, Dong Woo Park

Publication date 19 November 2018

Published in Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

convex polytopeexact algorithmoptimization problempacking problem

Mathematics Subject Classification ID

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

Recommendations

• Bundling two simple polygons to minimize their convex hull
• Maximum overlap and minimum convex hull of two convex polyhedra under translations
• Translational packing of arbitrary polytopes
• Bundling three convex polygons to minimize area or perimeter
• Maximum overlap of convex polytopes under translation

Cites work

• Aligning two convex figures to minimize area or perimeter
• An optimal convex hull algorithm in any fixed dimension
• Bundling three convex polygons to minimize area or perimeter
• Computational geometry. Algorithms and applications.
• Disk packing for the estimation of the size of a wire bundle
• scientific article; zbMATH DE number 1256725 (Why is no real title available?)
• scientific article; zbMATH DE number 1113187 (Why is no real title available?)
• scientific article; zbMATH DE number 1786500 (Why is no real title available?)
• Maximum overlap and minimum convex hull of two convex polyhedra under translations
• Multiple translational containment. I: An approximate algorithm
• The Cayley trick, lifting subdivisions and the Bohne-Dress theorem on zonotopal tilings
• The upper bound theorem for polytopes: An easy proof of its asymptotic version

Cited in

(4)

• On the convex hull and homothetic convex hull functions of a convex body
• Maximum overlap and minimum convex hull of two convex polyhedra under translations
• Bundling three convex polygons to minimize area or perimeter
• Bundling two simple polygons to minimize their convex hull

This page was built for publication: The minimum convex container of two convex polytopes under translations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1622345)