<s>
A	O
linear	B-Data_Structure
octree	I-Data_Structure
is	O
an	O
octree	B-Data_Structure
that	O
is	O
represented	O
by	O
a	O
linear	O
array	B-Data_Structure
instead	O
of	O
a	O
tree	B-Application
data	I-Application
structure	I-Application
.	O
</s>
<s>
To	O
simplify	O
implementation	O
,	O
a	O
linear	B-Data_Structure
octree	I-Data_Structure
is	O
usually	O
complete	O
(	O
that	O
is	O
,	O
every	O
internal	O
node	O
has	O
exactly	O
8	O
child	O
nodes	O
)	O
and	O
where	O
the	O
maximum	O
permissible	O
depth	O
is	O
fixed	O
a	O
priori	O
(	O
making	O
it	O
sufficient	O
to	O
store	O
the	O
complete	O
list	O
of	O
leaf	B-Data_Structure
nodes	I-Data_Structure
)	O
.	O
</s>
<s>
That	O
is	O
,	O
all	O
the	O
nodes	O
of	O
the	O
octree	B-Data_Structure
can	O
be	O
generated	O
from	O
the	O
list	O
of	O
its	O
leaf	B-Data_Structure
nodes	I-Data_Structure
.	O
</s>
<s>
Space	B-Algorithm
filling	I-Algorithm
curves	I-Algorithm
are	O
often	O
used	O
to	O
represent	O
linear	B-Data_Structure
octrees	I-Data_Structure
.	O
</s>
