Approximate nearest neighbor search under translation invariant Hausdorff distance
DOI10.1142/S0218195911003706zbMATH Open1231.65040OpenAlexW2052937715MaRDI QIDQ3089097FDOQ3089097
Authors: Christian Knauer, Marc Scherfenberg 
Publication date: 23 August 2011
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195911003706
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
Hausdorff distancecomputational geometrydata structurenearest neighbor searchshape matchingglobal minimizationpoint patternsquery point set
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
Cited In (5)
- 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
- Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance
- Embedding and similarity search for point sets under translation
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)
