%0 Generic %1 Moore91anintoductory %A Moore, Andrew W. %D 1991 %K baum kd kd-tree %T An Intoductory Tutorial on Kd-Trees %U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.6468 %X 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.

@misc{Moore91anintoductory, abstract = {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.}, added-at = {2012-11-19T13:42:28.000+0100}, author = {Moore, Andrew W.}, biburl = {https://www.bibsonomy.org/bibtex/2674f29b4eaa3b65634f14f532dea68fb/daill}, description = {CiteSeerX — An Intoductory Tutorial on Kd-Trees}, interhash = {95588ddf49431f1b9c7fe5c3741476f4}, intrahash = {674f29b4eaa3b65634f14f532dea68fb}, keywords = {baum kd kd-tree}, timestamp = {2012-11-19T13:42:28.000+0100}, title = {An Intoductory Tutorial on Kd-Trees}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.6468}, year = 1991 }