Login / Signup

The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space.

O. J. MurphyStanley M. Selkow
Published in: Inf. Process. Lett. (1986)
Keyphrases
  • discrete space
  • nearest neighbor
  • continuous space
  • discrete version
  • data points
  • database systems
  • knn
  • feature extraction
  • distance function
  • euclidean space
  • curvature flow