(data structure)
Definition: A binary tree that organizes multidimensional points by splitting off regular subintervals.
Generalization (I am a kind of ...)
binary tree, point access method.
Note: After [GG98].
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Wed Mar 16 14:59:39 2005.
HTML page formatted Wed Oct 26 09:47:13 2005.
Cite this as:
Paul E. Black, "BD-tree", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/bdtree.html
