Maximizing the overlap of two planar convex sets under rigid motions

DOI10.1145/1064092.1064146MaRDI QIDQ5370632zbMATH OpenOpenAlexFDO

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

Publication date 20 October 2017

Published in Proceedings of the twenty-first annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1064092.1064146

zbMATH Keywords

approximation algorithmpattern matchingconvex shapesublinear algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Computational aspects related to convexity (52B55) Convex sets in (2) dimensions (including convex curves) (52A10)

Recommendations

• Maximizing the overlap of two planar convex sets under rigid motions
• Maximizing the area of overlap of two unions of disks under rigid motion
• Algorithm Theory - SWAT 2004
• Overlap of convex polytopes under rigid motion
• Overlap of convex polytopes under rigid motion

Cited in

(7)

• Maximizing the area of overlap of two unions of disks under rigid motion
• Maximizing the overlap of two planar convex sets under rigid motions
• Computing the maximum overlap of two convex polygons under translations
• Maximum overlap and minimum convex hull of two convex polyhedra under translations
• Overlap of convex polytopes under rigid motion
• Algorithm Theory - SWAT 2004
• Overlap of convex polytopes under rigid motion

This page was built for publication: Maximizing the overlap of two planar convex sets under rigid motions

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