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

Spatial Linear Quadtree with Constant Time Node Traversal (C++) including man pages, examples, etc., insert (C), search (C).

More information

Quadtree ...

Go to the Dictionary of Algorithms and Data Structures home page.

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

Entry modified Tue Jan 4 10:03:32 2005.
HTML page formatted Wed Oct 26 09:48:01 2005.

Cite this as:
Paul E. Black, "quadtree", from Dictionary of Algorithms and Data Structures, Paul E. Black, ed., NIST.
http://www.nist.gov/dads/HTML/quadtree.html

to NIST home page