Approximate one-to-one point pattern matching

DOI10.1016/j.jda.2012.03.002zbMath1247.68304OpenAlexW2079958545MaRDI QIDQ450574

Marc Benkert, Thomas Wolle, Joachim Gudmundsson, Damian Merrick

Publication date: 13 September 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2012.03.002

zbMATH Keywords

approximation algorithmsimilarity transformationspoint pattern matchingbottleneck distance

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (3)

FPTAS for minimizing the earth mover's distance under rigid transformations and related problems ⋮ Curvature based shape detection ⋮ Finding Largest Common Point Sets

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric pattern matching under Euclidean motion
• The upper envelope of Voronoi surfaces and its applications
• Approximate decision algorithms for point set congruence
• Congruence, similarity, and symmetries of geometric objects
• On the parameterized complexity of \(d\)-dimensional point set pattern matching
• Matching Shapes with a Reference Point
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Improvements on geometric pattern matching problems
• Geometry helps in bottleneck matching and related problems

This page was built for publication: Approximate one-to-one point pattern matching