KD Trees Very Fast Optimization Method

KD Trees in certain situations can be one of the fastest optimization methods. Sometime 3,000 times faster over other optimization methods.

KD Tree Explanation:
http://en.wikipedia.org/wiki/Kd-tree

Different KD-Tree Methods:
http://www.cs.cmu.edu/~awm/animations/kdtree/

KD Tree Code Implementations Including SQL fast look up methods for Internal Database for same clunked paged geometry:
http://www.codeproject.com/KB/architecture/KDTree.aspx

KD Tree Demo:
http://donar.umiacs.umd.edu/quadtree/points/kdtree.html

KD Tree Uses In White Papers Including AI Systems:
https://www.autonlab.org/autonweb/facetedBrowser/tags

KD Tree Example with Open Scene Graph:
http://www.openscenegraph.org/projects/osg/wiki/Support/UserGuides/Examples

KD Trees Open Scene Graph: They also use KD-Trees for the database system breaking down the geometry under the shape node in the scenegraph hierarchy.
http://www.openscenegraph.org/projects/osg/wiki/Support/ProgrammingGuides/KdTree

Open Scene Graph Database System:
http://www.openscenegraph.org/documentation/OpenSceneGraphReferenceDocs/a01557.html

Scenegraphs Past, Present, and Future:
http://www.realityprime.com/articles/scenegraphs-past-present-and-future