The efficiency of using k-d trees for finding nearest neighbors in discrete space

Information Processing Letters

Volumn 23, Issue 4, 1986, Pages 215-218

  Murphy, O J ^a,b   Selkow, S M ^c  

^a SYRACUSE UNIVERSITY   (United States)

^b UNIVERSITY OF VERMONT   (United States)

^c WORCESTER POLYTECHNIC INSTITUTE   (United States)

Author keywords

k d tree; multi key searching; nearest neighbor

Indexed keywords

MATHEMATICAL TECHNIQUES - TREES;

K-D TREES; MULTI-KEY SEARCHING; NEAREST NEIGHBORS;

DATA PROCESSING;

EID: 0023044997     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(86)90138-9     Document Type: Article

References (2)

1. Multidimensional binary search trees used for associative searching
2. An algorithm for finding best matches in logarithmic expected time