Algorithm Theory - SWAT 2004

DOI10.1007/B98413zbMATH Open1095.68720OpenAlexW2615963353MaRDI QIDQ5315366FDOQ5315366

Authors: S. Cabello, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp, Mark de Berg 

Publication date: 7 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98413

Recommendations

• 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
• Approximating the maximum overlap of polygons under translation
• Approximating the maximum overlap of polygons under translation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cited In (5)

• Maximizing the overlap of two planar convex sets under rigid motions
• Maximizing the overlap of two planar convex sets under rigid motions
• Shape matching under rigid motion
• Approximating the maximum overlap of polygons under translation
• Maximizing the area of overlap of two unions of disks under rigid motion

This page was built for publication: Algorithm Theory - SWAT 2004

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