Jump to navigation Jump to search
The article Octrees on Wikipedia projects:
tree data structure in which each internal node has exactly eight children;most often used to partition a three-dimensional space by recursively subdividing it into eight octants; the three-dimensional analog of quadtrees
|Subclass of||tree data structure|
An octree is a tree data structure in which each internal node has exactly eight children.
This category has only the following subcategory.
- ► Octant (geometry) (3 C, 12 F)