Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances

DOI10.1137/1.9781611975482.23MaRDI QIDQ5236204zbMATH OpenOpenAlexFDO

Authors Ahmed Abdelkader, Sunil Arya, David M. Mount, Guilherme D. Da Fonseca

Publication date 15 October 2019

Published in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975482.23

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Approximate nearest neighbor queries revisited
• Approximate nearest neighbor search in high dimensions
• scientific article; zbMATH DE number 6783438
• Approximate nearest neighbor search for low-dimensional queries
• New directions in approximate nearest-neighbor searching
• scientific article; zbMATH DE number 437552
• Approximating nearest neighbor distances
• Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
• scientific article; zbMATH DE number 1775451
• Approximate nearest neighbor search under translation invariant Hausdorff distance

Cited in

(12)

• Summarization and search over geometric spaces
• Approximate Bregman near neighbors in sublinear time: beyond the triangle inequality
• Approximate Bregman near neighbors in sublinear time: beyond the triangle inequality
• Resolving SINR Queries in a Dynamic Setting
• Approximating nearest neighbor distances
• Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance
• Metric spaces with expensive distances
• Minkowski-type distances in approximate query searches
• Delaunay triangulations in the Hilbert metric
• Optimal area-sensitive bounds for polytope approximation
• Fast Kd-trees for the Kullback-Leibler divergence and other decomposable Bregman divergences
• Farthest-point Voronoi diagrams in the Hilbert metric

This page was built for publication: Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236204)