Jump to content

Talk:Linear octree

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

""an octree that is complete (that is, every internal node has exactly 8 child nodes) and where the maximum permissible depth is fixed a priori""

Octrees that don't meet those requirements can also be stored in a linear array instead of a tree structure - the links to child nodes are encoded as offsets into the array. 60.240.243.216 (talk) 14:35, 7 April 2011 (UTC)[reply]

Why is this a seperate page? I suggest creating a section in Octree. 94.159.166.66 (talk) 21:18, 23 January 2012 (UTC)[reply]