A tutorial on kd-trees (1991)

Andrew Moore

Tags

Astrostatistics, Kd-trees and Ball-trees, Memory-based Learning

Abstract

Extract from Andrew Moore's PhD Thesis. Gives a concise description of nearest neighbor search using kd-trees. See also Andrew's animations of KD-tree search algorithms.

Full text

Download (application/pdf, 222.9 kB)

Approximate BibTeX Entry

@report{moore-tutorial,
    Howpublished = {Extract from PhD Thesis},
    Year = {1991},
    Booktitle = {University of Cambridge Computer Laboratory Technical Report No. 209},
    Note = {Available from http://www.cs.cmu.edu/$sim$awm/papers.html},
    Author = {Andrew Moore},
    Title = {A tutorial on kd-trees}
}