(data structure)
Definition: A tree for multidimensional points where successive levels may be split along different dimensions.
See also k-d tree.
Note: After [GG98].
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 11:46:24 2004.
HTML page formatted Wed Oct 26 09:47:08 2005.
Cite this as:
Paul E. Black, "adaptive k-d tree", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/adaptkdtree.html
