Talk:Linear octree

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.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

""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

This page was redesigned at the edge.

A page that knows where it met you.

Talk:Linear octree