Computing the maximum overlap of two convex polygons under translations
From MaRDI portal
Publication:1271283
DOI10.1007/PL00005845zbMath0910.68226MaRDI QIDQ1271283
Monique Teillaud, Olivier Devillers, Marc J. van Kreveld, Mark T. de Berg, Otfried Schwarzkopf
Publication date: 11 November 1998
Published in: Theory of Computing Systems (Search for Journal in Brave)
Related Items
Maximizing the overlap of two planar convex sets under rigid motions ⋮ Overlap of convex polytopes under rigid motion ⋮ Aligning two convex figures to minimize area or perimeter ⋮ Shape matching under rigid motion ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing ⋮ Approximating the maximum overlap of polygons under translation ⋮ Maximum overlap and minimum convex hull of two convex polyhedra under translations ⋮ Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets ⋮ Cache-oblivious selection in sorted \(X+Y\) matrices ⋮ Placing Text Boxes on Graphs ⋮ Translational packing of arbitrary polytopes ⋮ MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION ⋮ Probabilistic matching of planar regions
