Maximizing the overlap of two planar convex sets under rigid motions

DOI10.1145/1064092.1064146zbMath1387.68227OpenAlexW2095994698MaRDI QIDQ5370632

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

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) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10) Approximation algorithms (68W25)

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