The efficiency of using k-d trees for finding nearest neighbors in discrete space
In this paper, we examine the efficiency of the k-d tree for retrieving from a file of fixed-length binary key records the best match to a given input word. We provide guidelines for determining if the search of the tree will provide any savings when compared with an exhaustive search.
scientific article; zbMATH DE number 4020489