APPROXIMATE NEAREST NEIGHBOR SEARCH UNDER TRANSLATION INVARIANT HAUSDORFF DISTANCE

DOI10.1142/S0218195911003706zbMath1231.65040OpenAlexW2052937715MaRDI QIDQ3089097

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

zbMATH Keywords

computational geometryglobal minimizationHausdorff distancenearest neighbor searchdata structureshape matchingpoint patternsquery point set

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• On approximate nearest neighbors under \(l_\infty\) norm
• On the parameterized complexity of \(d\)-dimensional point set pattern matching
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Efficient image retrieval through vantage objects

This page was built for publication: APPROXIMATE NEAREST NEIGHBOR SEARCH UNDER TRANSLATION INVARIANT HAUSDORFF DISTANCE