Maximum overlap of convex polytopes under translation

DOI10.1016/j.comgeo.2011.11.003zbMath1264.52009OpenAlexW2143155008MaRDI QIDQ1941219

Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher

Publication date: 12 March 2013

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

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

zbMATH Keywords

similarityconvex polyhedronshape matchingtime complexity analysisrunning timemaximum overlap

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Three-dimensional polytopes (52B10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Related Items (3)

Overlap of convex polytopes under rigid motion ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing ⋮ Approximating the maximum overlap of polygons under translation

This page was built for publication: Maximum overlap of convex polytopes under translation