Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance
DOI10.1007/978-3-540-92182-0_48zbMATH Open1183.68666OpenAlexW1852390268MaRDI QIDQ3596747FDOQ3596747
Authors: Christian Knauer, Marc Scherfenberg 
Publication date: 29 January 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_48
Recommendations
- Approximate nearest neighbor search under translation invariant Hausdorff distance
- Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances
- Approximate nearest neighbor search in high dimensions
- scientific article; zbMATH DE number 437552
- scientific article; zbMATH DE number 6783438
- Approximate nearest neighbor queries revisited
- Approximate nearest neighbor search for low-dimensional queries
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- New directions in approximate nearest-neighbor searching
- Approximate \(k\)-flat nearest neighbor search
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (4)
- Searching point patterns, matching imprecise point patterns, and inducing polygons
- Approximate nearest neighbor search under translation invariant Hausdorff distance
- Embedding and similarity search for point sets under translation
- Dynamic data structures for approximate Hausdorff distance in the word RAM
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 Q3596747)
