Maximizing the overlap of two planar convex sets under rigid motions
DOI10.1016/J.COMGEO.2006.01.005zbMATH Open1115.65016OpenAlexW2210270306WikidataQ112083537 ScholiaQ112083537MaRDI QIDQ871058FDOQ871058
Authors: Hee-Kap Ahn, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron, Otfried Cheong 
Publication date: 15 March 2007
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.01.005
Recommendations
- Maximizing the overlap of two planar convex sets under rigid motions
- Overlap of convex polytopes under rigid motion
- Probabilistic matching of planar regions
- Computing the maximum overlap of two convex polygons under translations
- Maximizing the area of overlap of two unions of disks under rigid motion
Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Optimal placement of convex polygons to maximize point containment
- Title not available (Why is that?)
- Computing the maximum overlap of two convex polygons under translations
- Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
- Title not available (Why is that?)
- Matching convex shapes with respect to the symmetric difference
- Algorithm Theory - SWAT 2004
- Correction to metric entropy of some classes of sets with differentiable boundaries
- Title not available (Why is that?)
Cited In (13)
- Maximizing the overlap of two planar convex sets under rigid motions
- Aligning two convex figures to minimize area or perimeter
- Computing the maximum overlap of two convex polygons under translations
- Largest triangles in a polygon
- Shape matching under rigid motion
- Maximum overlap and minimum convex hull of two convex polyhedra under translations
- Matching sets of line segments
- Translational packing of arbitrary polytopes
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
- Geometric optimization and sums of algebraic functions
- Approximating the maximum overlap of polygons under translation
- Maximizing the area of overlap of two unions of disks under rigid motion
- Overlap of convex polytopes under rigid motion
This page was built for publication: Maximizing the overlap of two planar convex sets under rigid motions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871058)
