A linear octree is an octree that is represented by a linear array instead of a tree data structure. To simplify implementation, a linear octree is usually complete (that is, every internal node has exactly 8 child nodes) and where the maximum permissible depth is fixed a priori (making it sufficient to store the complete list of leaf nodes).
A linear octree is an octree that is represented by a linear array instead of a tree data structure. To simplify implementation, a linear octree is usually complete (that is, every internal node has exactly 8 child nodes) and where the maximum permissible depth is fixed a priori (making it sufficient to store the complete list of leaf nodes).
Source: Wikipedia "Linear octree" · CC BY-SA 4.0
Share this article: X · Bluesky