Noisy colored point set matching
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 432804 (Why is no real title available?)
- scientific article; zbMATH DE number 3623000 (Why is no real title available?)
- scientific article; zbMATH DE number 1424291 (Why is no real title available?)
- scientific article; zbMATH DE number 3388498 (Why is no real title available?)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Approximate congruence in nearly linear time
- Approximate decision algorithms for point set congruence
- Congruence, similarity, and symmetries of geometric objects
- Geometric pattern matching under Euclidean motion
- Geometry helps in bottleneck matching and related problems
- Hausdorff distance under translation for points and balls
- Matching point features under small nonrigid motion
- Multidimensional divide-and-conquer
- Point matching under non-uniform distortions.
- Simple algorithms for partial point set pattern matching under rigid motion
- The skip quadtree
This page was built for publication: Noisy colored point set matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628337)