Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions
From MaRDI portal
Publication:2507694
DOI10.1016/j.jcss.2006.01.007zbMath1100.68632MaRDI QIDQ2507694
Yogish Sabharwal, Sandeep Sen, Nishant Sharma
Publication date: 5 October 2006
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2006.01.007
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68P05: Data structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Space-efficient approximate Voronoi diagrams
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Nice point sets can have nasty Delaunay triangulations