Computing the maximum overlap of two convex polygons under translations

DOI10.1007/BFB0009488zbMath1512.68411MaRDI QIDQ6487432

Monique Teillaud, Otfried Schwarzkopf, Marc J. van Kreveld, Olivier Devillers, Mark T. de Berg

Publication date: 25 January 2023

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• A convex polygon among polygonal obstacle: Placement and high-clearance motion
• The upper envelope of Voronoi surfaces and its applications
• Cutting hyperplanes for divide-and-conquer
• On the area of intersection between two closed 2-D objects.
• Generalized Selection and Ranking: Sorted Matrices
• An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the maximum overlap of two convex polygons under translations