 |
|
| ||||||||||||||||||||||||||
|
|
| ||||||||||||||||||||||||||
|
|
|
|
|
| ||||||||
An octree is a tree data structure mainly used for organising 3-dimensional data. In this case, each node of the tree represents a cuboid volume. Each node has 8 children, hence oct+tree = octree. The 8 child nodes can partition the same volume of space as the parent node.
|
||||
| View Live Article | This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License | |
||
