NIST

octree

(data structure)

Definition: A tree to index three dimensions. Each node has either eight children or no children.

See also quadtree, binary tree, BSP-tree.

Note: If one views a binary tree as partitioning one dimension, a quadtree analogously partitions two dimensions, and an octree partitions three.

Author: PEB

More information

algorithms, another diagram and algorithm, and one more diagram from Martin John Baker. Another diagram from Nilo Stolte.


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 3 January 2006.
HTML page formatted Fri Feb 23 10:06:08 2018.

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