Maximizing the overlap of two planar convex sets under rigid motions

DOI10.1016/j.comgeo.2006.01.005zbMath1115.65016OpenAlexW2210270306WikidataQ112083537 ScholiaQ112083537MaRDI QIDQ871058

Antoine Vigneron, Chong-Dae Park, Chan-Su Shin, Hee-Kap Ahn, Otfried Schwarzkopf

Publication date: 15 March 2007

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

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

zbMATH Keywords

approximation algorithmrigid motionconvex shapegeometric pattern matchingsub-linear algorithm

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Matching sets of line segments, Overlap of convex polytopes under rigid motion, Aligning two convex figures to minimize area or perimeter, Shape matching under rigid motion, Largest triangles in a polygon, Scandinavian thins on top of cake: new and improved algorithms for stacking and packing, Approximating the maximum overlap of polygons under translation, Maximum overlap and minimum convex hull of two convex polyhedra under translations, Translational packing of arbitrary polytopes, Geometric optimization and sums of algebraic functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correction to metric entropy of some classes of sets with differentiable boundaries
• Optimal placement of convex polygons to maximize point containment
• Computing the maximum overlap of two convex polygons under translations
• Matching convex shapes with respect to the symmetric difference
• Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
• Algorithm Theory - SWAT 2004