NIST

quadtree

(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

Implementation

insert (C), search (C).
Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 16 November 2009.
HTML page formatted Fri Feb 23 10:06:08 2018.

Cite this as:
Paul E. Black, "quadtree", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 16 November 2009. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/quadtree.html