The efficiency of using k-d trees for finding nearest neighbors in discrete space (Q1092665)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The efficiency of using k-d trees for finding nearest neighbors in discrete space |
scientific article; zbMATH DE number 4020489
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The efficiency of using k-d trees for finding nearest neighbors in discrete space |
scientific article; zbMATH DE number 4020489 |
Statements
The efficiency of using k-d trees for finding nearest neighbors in discrete space (English)
0 references
1986
0 references
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.
0 references
multi-key searching
0 references
nearest neighbor
0 references
k-d tree
0 references
