Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
From MaRDI portal
Publication:3541079
DOI10.1007/978-3-540-87744-8_10zbMath1158.68524OpenAlexW1537140306MaRDI QIDQ3541079
Antoine Vigneron, Sunil Arya, David M. Mount, Jian Xia
Publication date: 25 November 2008
Published in: Algorithms - ESA 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_10
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearest neighbor queries in metric spaces
- The black-box complexity of nearest-neighbor search
- Searching dynamic point sets in spaces with bounded doubling dimension
- Space-efficient approximate Voronoi diagrams
- Finding nearest neighbors in growth-restricted metrics
- Plongements lipschitziens dans ${\bbfR}\sp n$
- The nearest neighbor problem in an abstract metric space
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications