Automatically assigned DDC number:

Manually assigned DDC number: 00573

Title: An Intoductory Tutorial on Kd-Trees

Author:

Subject: Andrew W. Moore An Intoductory Tutorial on Kd-Trees

Description: This paper considers the expected number of hyperrectangles corresponding to leaf nodes which will provably need to be searched. Such hyperrectangles intersect the volume enclosed by a hypersphere centered on the query point whose surface passes through the nearest neighbour. For example, in Figure 6.5 the hypersphere (in this 6-9 Figure 6.5 Generally during a nearest neighbour search only a few leaf nodes need to be inspected.

Contributor: The Pennsylvania State University CiteSeer Archives

Publisher: unknown

Date: 1997-10-08

Format: ps

Identifier: http://citeseer.ist.psu.edu/140157.html

Source: http://www.cs.cmu.edu/afs/cs.cmu.edu/project/reinforcement/papers/kdtree.ps

Language: en

Rights: unrestricted