Back Octree Catalan Octree German Árbol octal Spanish درخت هشت‌تایی Persian Octree French Albero ottale Italian 八分木 Japanese 팔진트리 Korean Octree Dutch Drzewo ósemkowe Polish

Octree

Octree
TypeTree
Invented1980
Invented byDonald Meagher
Time complexity in big O notation
Operation Average Worst case
Search O(logN+K) O(logN+K)
Insert O(logN) O(logN)
Delete O(logN) O(logN)
Peek O(logN) O(logN)
Space complexity
Space O(N) O(N)
Left: Recursive subdivision of a cube into octants. Right: The corresponding 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.

Rich TVX News Network Site

Rich TVX News Network Info

© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search