Fetching the paper…
Reading the bibliography…
The k-d tree was one of the first spatial data structures proposed for nearest neighbor search.
Multidimensional binary search trees used for associative searching
Bentley, J. (1975) · 1975
Earlier work this paper cites.
Two algorithms for nearest-neighbor search in high dimensions
Kleinberg, J. (1997) · 1997
Earlier work this paper cites.
An optimal algorithm for approximate nearest neighbor searching
Arya, S., Mount, D., Netanyahu, N., Silverman, R., and Wu, A. (1998) · 1998
Earlier work this paper cites.
The analysis of a probabilistic approach to nearest neighbor searching
Maneewongvatana, S. and Mount, D. (2001) · 2001
Earlier work this paper cites.
Finding nearest neighbors in growth-restricted metrics
Karger, D. and Ruhl, M. (2002) · 2002
Cited alongside, same era.
Navigating nets: simple algorithms for proximity search
Krauthgamer, R. and Lee, J. (2004) · 2004
Cited alongside, same era.
An investigation of practical approximate nearest neighbor algorithms
Liu, T., Moore, A., Gray, A., and Yang, K. (2004) · 2004
Cited alongside, same era.
Cover trees for nearest neighbor
Beygelzimer, A., Kakade, S., and Langford, J. (2006) · 2006
Later among the works it cites.
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Andoni, A. and Indyk, P. (2008) · 2008
Later among the works it cites.
Random projection trees and low dimensional manifolds
Dasgupta, S. and Freund, Y. (2008) · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…