Automatically assigned DDC number:

Manually assigned DDC number: 00573

Title: An Intoductory Tutorial on Kd-Trees


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



Language: en

Rights: unrestricted


<?xml   version="1.0"   encoding="UTF-8"?>


      <rec   ID="SELF"   Type="SELF"   CiteSeer_Book="SELF"   CiteSeer_Volume="SELF"   Title="An   Intoductory   Tutorial   on   Kd-Trees">

            <identifier   Org="ISBN:3540770453"   Paper_ID="SELF"   Extracted="3540770453"   />