(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 Black.
Entry modified 12 February 2019.
HTML page formatted Mon May 11 15:07:57 2026.
Cite this as:
Paul E. Black, "quadtree", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 12 February 2019. (accessed TODAY)
Available from: /HTML/quadtree.html