A simple algorithm for approximate partial point set pattern matching under rigid motion
From MaRDI portal
Publication:3404433
DOI10.1007/978-3-642-11440-3_10zbMATH Open1274.68620OpenAlexW1531841496MaRDI QIDQ3404433FDOQ3404433
Authors: Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
Publication date: 9 February 2010
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11440-3_10
Recommendations
- Simple algorithms for partial point set pattern matching under rigid motion
- scientific article; zbMATH DE number 2011843
- Combinatorial Pattern Matching
- Approximate input sensitive algorithms for point pattern matching
- Geometric pattern matching for point sets in the plane under similarity transformations
Cited In (7)
- Title not available (Why is that?)
- Matching sets of line segments
- Combinatorial Pattern Matching
- Small candidate set for translational pattern search
- Noisy colored point set matching
- Simple algorithms for partial point set pattern matching under rigid motion
- Embedding and similarity search for point sets under translation
This page was built for publication: A simple algorithm for approximate partial point set pattern matching under rigid motion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3404433)