octree
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
--Agreed Upon Solutions

The discussion does not exist would you like to add the first comment?

anonymous