Jump to content

Linear octrees

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Rahul220 (talk | contribs) at 16:43, 13 October 2007. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

An octree is said to be complete if every internal node has exactly 8 child nodes. It is sufficient to store the complete list of leaf nodes of a complete octree. Such a representation is refered to a Linear octree, since a linear array is sufficient for this representation instead of the tree data structure. All the internal nodes of the octree can be generated from the list of its leaf nodes. Space filling curves are often used to represent linear octrees.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Linear_octrees&oldid=164306511"