Space-time tradeoffs for approximate nearest neighbor searching
From MaRDI portal
Publication:3578185
DOI10.1145/1613676.1613677zbMath1204.68103OpenAlexW2007273639MaRDI QIDQ3578185
Sunil Arya, David M. Mount, Theocharis Malamatos
Publication date: 14 July 2010
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1613676.1613677
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Geometry Helps to Compare Persistence Diagrams ⋮ Nearest-neighbor searching under uncertainty. I ⋮ Approximate Polytope Membership Queries ⋮ Robust proximity search for balls using sublinear space ⋮ A weighted \(k\)-nearest neighbor density estimate for geometric inference ⋮ REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION ⋮ Coresets for the Nearest-Neighbor Rule ⋮ Conic nearest neighbor queries and approximate Voronoi diagrams ⋮ Toward approximate moving least squares approximation with irregularly spaced centers ⋮ Practical methods for shape fitting and kinetic data structures using coresets ⋮ A contact dynamics approach to the granular element method ⋮ Unnamed Item ⋮ Approximating Minimization Diagrams and Generalized Proximity Search ⋮ Small candidate set for translational pattern search ⋮ Unnamed Item
