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:33, 13 October 2007 (←Created page with 'An octree is said to be '''complete''' if every internal node is either a '''leaf node''' or has exactly 8 children. It is sufficient to store the complete list...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

An octree is said to be complete if every internal node is either a leaf node or has exactly 8 children. It is sufficient to store the complete list of leaf nodes of a complete octree. All the internal nodes of the octree can be generated from the list of 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=164304482"