K-d Tree
In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key (e.g. range searches and nearest neighbor searches). k-d trees are a special case of binary space partitioning trees.
Read more about K-d Tree: Informal Description, High-dimensional Data, Complexity
Other related articles:
K-d Tree - Variations - Points Only in Leaves
... It is also possible to define a k-d tree with points stored solely in leaves ... This form of k-d tree allows a variety of split mechanics other than the standard median split ...
... It is also possible to define a k-d tree with points stored solely in leaves ... This form of k-d tree allows a variety of split mechanics other than the standard median split ...
Famous quotes containing the word tree:
“The tree of Knowledge is a Tree of Knowledge of good and evil.”
—Henry David Thoreau (1817–1862)
Main Site Subjects
Related Phrases
Related Words