Improved approximation bounds for planar point pattern matching
From MaRDI portal
Publication:2480906
DOI10.1007/S00453-007-9059-9zbMATH Open1141.68059OpenAlexW2621528651MaRDI QIDQ2480906FDOQ2480906
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
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
- Title not available (Why is that?)
- Geometric pattern matching under Euclidean motion
- Title not available (Why is that?)
- Point set pattern matching in \(d\)-dimensions
- Approximate decision algorithms for point set congruence
- Matching Shapes with a Reference Point
- Finding squares and rectangles in sets of points
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Efficient point pattern matching algorithm for planar point sets under transform of translation, rotation and scale
- Approximate input sensitive algorithms for point pattern matching
- Title not available (Why is that?)
- Matching sets of line segments
- A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
- Improved Grid Map Layout by Point Set Matching
Recommendations
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)
