Talk:Linear octree

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Computer science (Rated Stub-class)
WikiProject icon This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Stub-Class article Stub  This article has been rated as Stub-Class on the project's quality scale.
 ???  This article has not yet received a rating on the project's importance scale.

""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. (talk) 14:35, 7 April 2011 (UTC)

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