|
634
|
An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions
– Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu
- 1994
|
|
77
|
A Replacement for Voronoi Diagrams of Near Linear Size
– Sariel Har-peled
- 2001
|
|
797
|
Computational Geometry: Algorithms and Applications
– M de Berg, O Cheong, M van Kreveld, M Overmars
- 2008
|
|
25
|
The skip quadtree: a simple dynamic data structure for multidimensional data
– Michael T. Goodrich, Jonathan Z. Sun
- 2005
|
|
51
|
Approximate Nearest Neighbor Queries Revisited
– Timothy M. Chan
- 1998
|
|
135
|
Surpassing the information theoretic bound with fusion trees
– M L Fredman, D E Willard
- 1993
|
|
214
|
A Decomposition of Multi-Dimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields
– Paul B. Callahan, S. Rao Kosaraju
- 1992
|
|
182
|
Design and implementation of an efficient priority queue
– P van Emde Boas, R Kaas, E Zijlstra
- 1977
|
|
131
|
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
– Alexandr Andoni , Piotr Indyk
- 2008
|
|
58
|
Faster Core-Set Constructions and Data Stream Algorithms in Fixed Dimensions
– Timothy M. Chan
- 2003
|
|
14
|
Dynamic ordered sets with exponential search trees
– Arne Andersson, Mikkel Thorup
- 2002
|
|
20
|
Two- and Three-Dimensional Point Location in Rectangular Subdivisions
– Mark De Berg, Marc Van Kreveld, Jack Snoeyink
- 1995
|
|
12
|
Efficient Regular Data Structures and Algorithms for Dilation, Location and Proximity Problems
– Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet
|
|
10
|
Transdichotomous Results in Computational Geometry, II: Offline Search
– Timothy M. Chan, et al.
- 2010
|
|
533
|
Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality
– Piotr Indyk, Rajeev Motwani
- 1998
|
|
172
|
Provably Good Mesh Generation
– Marshall Bern, David Eppstein, John Gilbert
- 1990
|
|
357
|
Applications of Random Sampling in Computational Geometry, II
– Kenneth L. Clarkson, Peter W. Shor
- 1995
|
|
10
|
A minimalist’s implementation of an approximate nearest neighbor algorithm in fixed dimensions. Manuscript. www.cs.vwaterloo.ca/tmchan/ sss.ps
– T M Chan
|
|
73
|
Sorting in Linear Time?
– Arne Andersson, Torben Hagerup, Stefan Nilsson
- 1995
|
