Approximate nearest neighbor search under translation invariant Hausdorff distance
From MaRDI portal
Publication:3089097
Recommendations
- Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance
- Embedding and similarity search for point sets under translation
- Hausdorff distance under translation for points and balls
- Hausdorff distance under translation for points and balls
- scientific article; zbMATH DE number 1559576
Cites work
Cited in
(5)- Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance
- Embedding and similarity search for point sets under translation
- Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances
- A new algorithm for computing the minimum Hausdorff distance between two point sets on a line under translation
- Searching point patterns, matching imprecise point patterns, and inducing polygons
This page was built for publication: Approximate nearest neighbor search under translation invariant Hausdorff distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089097)