Approximating the maximum overlap of polygons under translation

DOI10.1007/978-3-662-44777-2_45MaRDI QIDQ2921441zbMATH OpenOpenAlexFDO

Authors Subhro Roy, Sariel Har-Peled

Publication date 8 October 2014

Published in Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44777-2_45

Mathematics Subject Classification ID

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

Recommendations

• Approximating the maximum overlap of polygons under translation
• Computing the maximum overlap of two convex polygons under translations
• Shape matching under rigid motion
• Computing the maximum overlap of two convex polygons under translations
• Maximum overlap of convex polytopes under translation

Cited in

(11)

• Computing the maximum overlap of two convex polygons under translations
• Maximal superpositions of horizontally convex polyominoes
• Maximum overlap of convex polytopes under translation
• Translating a convex polygon to contain a maximum number of points.
• Maximum overlap and minimum convex hull of two convex polyhedra under translations
• Maximum overlap of convex polytopes under translation
• Maximizing the area of overlap of two unions of disks under rigid motion
• Placing Text Boxes on Graphs
• Approximating the maximum overlap of polygons under translation
• Algorithm Theory - SWAT 2004
• Computing the maximum overlap of two convex polygons under translations

This page was built for publication: Approximating the maximum overlap of polygons under translation

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