The minimum convex container of two convex polytopes under translations

DOI10.1016/j.comgeo.2018.02.004zbMath1506.68169OpenAlexW2294682074MaRDI QIDQ1622345

Chan-Su Shin, Susanna Dann, Hee-Kap Ahn, Sang Won Bae, Judit Abardia-Evéquoz, Dong Woo Park, Otfried Schwarzkopf

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 polytopepacking problemoptimization problemexact algorithm

Mathematics Subject Classification ID

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

Related Items (2)

Bundling Two Simple Polygons to Minimize Their Convex Hull ⋮ On the convex hull and homothetic convex hull functions of a convex body

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal convex hull algorithm in any fixed dimension
• Multiple translational containment. I: An approximate algorithm
• The Cayley trick, lifting subdivisions and the Bohne-Dress theorem on zonotopal tilings
• Disk packing for the estimation of the size of a wire bundle
• The upper bound theorem for polytopes: An easy proof of its asymptotic version
• Aligning two convex figures to minimize area or perimeter
• Maximum overlap and minimum convex hull of two convex polyhedra under translations
• Bundling Three Convex Polygons to Minimize Area or Perimeter

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