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.
| Octree | ||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Type | Tree | |||||||||||
| Invented | 1980 | |||||||||||
| Invented by | Donald Meagher | |||||||||||
| ||||||||||||
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.