Maximum overlap and minimum convex hull of two convex polyhedra under translations

DOI10.1016/j.comgeo.2007.08.001zbMath1137.52004OpenAlexW1979398234MaRDI QIDQ2483561

Chan-Su Shin, Hee-Kap Ahn, Peter Brass

Publication date: 28 April 2008

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

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

zbMATH Keywords

similarityconvex polyhedronshape matchingmaximum overlapminimum convex hull

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10)

Related Items (9)

The minimum convex container of two convex polytopes under translations ⋮ Bipartite diameter and other measures under translation ⋮ Overlap of convex polytopes under rigid motion ⋮ Aligning two convex figures to minimize area or perimeter ⋮ Bundling Two Simple Polygons to Minimize Their Convex Hull ⋮ On an extremal problem connected with simplices ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing ⋮ On the volume of the convex hull of two convex bodies ⋮ Unnamed Item

Cites Work

• Maximizing the overlap of two planar convex sets under rigid motions
• Cutting hyperplanes for divide-and-conquer
• Computing the maximum overlap of two convex polygons under translations
• An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
• A LOWER BOUND FOR LEBESGUE'S UNIVERSAL COVER PROBLEM
• Algorithms and Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximum overlap and minimum convex hull of two convex polyhedra under translations