(data structure)
Definition: A tree where each node is split along all d dimensions, leading to 2d children.
See also octree, quadtree complexity theorem, linear quadtree, BSP-tree.
Note: It was originally designed for 2-dimensional data (pictures), so each node had four children, hence quadtree. After [GG98].
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 18 September 2006.
HTML page formatted Mon Sep 18 15:01:40 2006.
Cite this as:
Paul E. Black, "quadtree", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 18 September 2006. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/quadtree.html
