(data structure)
Definition: A binary space partitioning (BSP) tree is a binary tree for multidimensional points where successive levels are split by arbitrary hyperplanes.
See also point access method, quadtree, octree.
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:48:50 2004.
HTML page formatted Wed Oct 26 09:47:17 2005.
Cite this as:
Paul E. Black, "BSP-tree", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/bsptree.html
