Octree
Data structure in computer science
Octree
An octree is a tree data structure in which each internal node has exactly eight children. Octrees are most often used to partition a three-dimensional space by recursively subdividing it into eight octants. Octrees are the three-dimensional analog of quadtrees. The word is derived from oct (Greek root meaning "eight") + tree. Octrees are often used in 3D graphics and 3D game engines.
Read on Wikipedia · Image WhiteTimberwolf, PNG version: Nü, CC BY-SA 3.0
Open boosters, collect cards and trade them. Free to play.
Play for free