Linear octree
 | This article needs additional citations for verification. (May 2024) |
A linear octree is an octree that is represented by a linear array instead of a tree data structure.[1]
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). That is, all the nodes of the octree can be generated from the list of its leaf nodes. Space filling curves are often used to represent linear octrees.
References
[edit]- ^ Phua, Kang Hoh; Loe, Kia Fock (1991-09-10). Singapore Supercomputing Conference '90: Supercomputing For Strategic Advantage. World Scientific. p. 164. ISBN 978-981-4555-99-9.
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |