Improved approximation bounds for planar point pattern matching

DOI10.1007/S00453-007-9059-9MaRDI QIDQ2480906zbMATH OpenOpenAlexFDO

Authors Minkyoung Cho, David M. Mount

Publication date 3 April 2008

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-007-9059-9

zbMATH Keywords

Hausdorff distanceApproximation algorithmsPoint pattern matching

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Algorithms and Data Structures
• Geometric pattern matching for point sets in the plane under similarity transformations
• Approximate input sensitive algorithms for point pattern matching
• Approximate one-to-one point pattern matching
• Combinatorial Pattern Matching

Cites work

• scientific article; zbMATH DE number 1305437 (Why is no real title available?)
• scientific article; zbMATH DE number 1424291 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• scientific article; zbMATH DE number 1445323 (Why is no real title available?)
• Approximate decision algorithms for point set congruence
• Congruence, similarity, and symmetries of geometric objects
• Finding squares and rectangles in sets of points
• Geometric pattern matching under Euclidean motion
• Matching Shapes with a Reference Point
• Point set pattern matching in \(d\)-dimensions
• The upper envelope of Voronoi surfaces and its applications

Cited in

(11)

• Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation
• Algorithms and Data Structures
• Efficient point pattern matching algorithm for planar point sets under transform of translation, rotation and scale
• Graph-Based Representations in Pattern Recognition
• Geometric pattern matching for point sets in the plane under similarity transformations
• Approximating the problem, not the solution: an alternative view of point set matching
• Approximate input sensitive algorithms for point pattern matching
• Matching sets of line segments
• scientific article; zbMATH DE number 3965443 (Why is no real title available?)
• A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
• Improved Grid Map Layout by Point Set Matching

This page was built for publication: Improved approximation bounds for planar point pattern matching

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