Shape matching under rigid motion

DOI10.1016/j.comgeo.2013.01.002zbMath1267.65024OpenAlexW2021810285MaRDI QIDQ1947970

Chi-Kit Lam, Siu-Wing Cheng

Publication date: 29 April 2013

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.01.002

zbMATH Keywords

overlapalgorithmerror boundrandom samplingarrangementshape matchingpolygonal shape

Mathematics Subject Classification ID

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

Related Items (4)

Overlap of convex polytopes under rigid motion ⋮ On the overlap area of a disk and a piecewise circular domain ⋮ A Dynamical Systems Approach for the Shape Matching of Polytopes Along Rigid-Body Motions ⋮ Approximating the maximum overlap of polygons under translation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relative \((p,\varepsilon )\)-approximations in geometry
• Maximizing the overlap of two planar convex sets under rigid motions
• Probabilistic matching of planar regions
• Computing the maximum overlap of two convex polygons under translations
• Finding a guard that sees most and a shop that sells most
• Maximum Overlap of Convex Polytopes under Translation
• Dynamic Trees and Dynamic Point Location
• On the number of cells defined by a family of polynomials on a variety
• Algorithm Theory - SWAT 2004
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Improved bounds on the sample complexity of learning

This page was built for publication: Shape matching under rigid motion