MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION

DOI10.1142/S0218195909003118zbMath1194.65035OpenAlexW2168204810MaRDI QIDQ3405970

Sergio Cabello, Remco C. Veltkamp, Christian Knauer, René van Oostrum, Panos Giannopoulos, Mark T. de Berg

Publication date: 12 February 2010

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195909003118

zbMATH Keywords

algorithmscomputational geometryapproximation algorithmsgeometric optimizationshape matchingrigid motionsarea of overlapunions of disks

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (4)

Matching sets of line segments ⋮ Aligning two convex figures to minimize area or perimeter ⋮ \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing

Cites Work

• Geometric pattern matching under Euclidean motion
• On \(k\)-sets in arrangements of curves and surfaces
• The upper envelope of Voronoi surfaces and its applications
• Computing the maximum overlap of two convex polygons under translations
• Spheres, molecules, and hidden surface removal
• Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
• Matching convex shapes with respect to the symmetric difference
• Combinatorial and experimental methods for approximate point pattern matching
• Finding a guard that sees most and a shop that sells most
• Applications of Parametric Searching in Geometric Optimization

This page was built for publication: MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION