Adaptive k-d tree
Encyclopedia
An adaptive k-d tree is a tree
for multidimensional points where successive levels may be split along different dimensions.
Tree (data structure)
In computer science, a tree is a widely-used data structure that emulates a hierarchical tree structure with a set of linked nodes.Mathematically, it is an ordered directed tree, more specifically an arborescence: an acyclic connected graph where each node has zero or more children nodes and at...
for multidimensional points where successive levels may be split along different dimensions.