Adaptive k-d tree

From Wikipedia, the free encyclopedia
Jump to: navigation, search

An adaptive k-d tree is a tree for multidimensional points where successive levels may be split along different dimensions.

References[edit]


Paul E. Black, Adaptive k-d tree at the NIST Dictionary of Algorithms and Data Structures.