Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Linear octree
open-in-new
<p>A linear octree is an <a href="/facts/Octree/hNT74wvT">octree</a> that is represented by a linear <a href="/facts/Array_data_structure/BKGvF8AM">array</a> instead of a <a href="/facts/Tree_data_structure/RcXz9noF">tree data structure</a>. </p><p>To simplify implementation, a linear octree is usually complete (that is, every <a href="/facts/Internal_node/RcXz9noF">internal node</a> has exactly 8 child nodes) and where the maximum permissible depth is fixed a priori (making it sufficient to store the complete list of <a href="/facts/Leaf_node/RcXz9noF">leaf nodes</a>). That is, all the nodes of the octree can be generated from the list of its leaf nodes. <a href="/facts/Space_filling_curves/b70uGLXh">Space filling curves</a> are often used to represent linear octrees. </p>