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].
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 16 November 2009.
HTML page formatted Tue Dec 6 16:16:32 2011.
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. 16 November 2009. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/quadtree.html