Approximate one-to-one point pattern matching

DOI10.1016/J.JDA.2012.03.002zbMATH Open1247.68304OpenAlexW2079958545MaRDI QIDQ450574FDOQ450574

Authors: Marc Benkert, Joachim Gudmundsson, Damian Merrick, Thomas Wolle 

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

Recommendations

• Geometric pattern matching for point sets in the plane under similarity transformations
• Approximate congruence in nearly linear time
• Approximate input sensitive algorithms for point pattern matching
• Publication:4952638
• Geometry helps in bottleneck matching and related problems

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)

Cites Work

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

Cited In (17)

• Bottleneck partial-matching Voronoi diagrams and applications
• Elastic geometric shape matching for point sets under translations
• Algorithms and Data Structures
• An algorithm for matching point sets using the \(l_1\) norm
• Graph-Based Representations in Pattern Recognition
• Approximating the problem, not the solution: an alternative view of point set matching
• Geometric pattern matching for point sets in the plane under similarity transformations
• Approximate input sensitive algorithms for point pattern matching
• Noisy colored point set matching
• Finding Largest Common Point Sets
• Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms
• Curvature based shape detection
• Improved approximation bounds for planar point pattern matching
• FPTAS for minimizing the earth mover's distance under rigid transformations and related problems
• Inexact Bayesian point pattern matching for linear transformations
• Title not available (Why is that?)
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450574)