Algorithms in a Nutshell

Nearest Neighbor Queries | 291

Computational

Geometry

Variations

In the described implementation, the methodnearesttraverses from the root back

down to the computed parent; alternate implementations start from the parent

and traverse back to the root, in bottom-up fashion.*

Figure 9-23. Comparing kd-tree versus brute-force implementation

* Seehttp://www.codeproject.com/KB/architecture/KDTree.aspx.

Algorithms in a Nutshell
Algorithms in a Nutshell By Gary Pollice, George T. Heineman, Stanley Selkow ISBN:
9780596516246 Publisher: O'Reilly Media, Inc.

Prepared for Ming Yi, Safari ID: [email protected]
Licensed by Ming Yi
Print Publication Date: 2008/10/21 User number: 594243
© 2009 Safari Books Online, LLC. This PDF is made available for personal use only during the relevant subscription term, subject to the Safari Terms of Service. Any other use