<s>
A	O
radial	B-Data_Structure
tree	I-Data_Structure
,	O
or	O
radial	O
map	O
,	O
is	O
a	O
method	O
of	O
displaying	O
a	O
tree	B-Data_Structure
structure	I-Data_Structure
(	O
e.g.	O
,	O
a	O
tree	B-Application
data	I-Application
structure	I-Application
)	O
in	O
a	O
way	O
that	O
expands	O
outwards	O
,	O
radially	O
.	O
</s>
<s>
For	O
subsequent	O
levels	O
,	O
the	O
children	O
are	O
positioned	O
within	O
sectors	O
of	O
the	O
remaining	O
space	O
,	O
so	O
that	O
child	B-Data_Structure
nodes	I-Data_Structure
of	O
one	O
parent	O
do	O
not	O
overlap	O
with	O
others	O
.	O
</s>
<s>
There	O
are	O
many	O
extensions	O
to	O
this	O
algorithm	O
to	O
create	O
more	O
visually	O
balanced	O
layouts	O
,	O
to	O
allow	O
a	O
user	O
to	O
navigate	O
from	O
node	O
to	O
node	O
(	O
changing	O
the	O
center	O
)	O
,	O
or	O
accommodate	O
node	O
labels	O
and	O
mix	O
force-directed	B-Algorithm
layouts	I-Algorithm
with	O
radial	O
layouts	O
.	O
</s>
<s>
The	O
layout	O
has	O
some	O
similarities	O
to	O
a	O
hyperbolic	O
tree	O
,	O
though	O
a	O
key	O
difference	O
is	O
that	O
hyperbolic	O
trees	O
are	O
based	O
on	O
hyperbolic	O
geometry	O
,	O
whereas	O
in	O
a	O
radial	B-Data_Structure
tree	I-Data_Structure
the	O
distance	O
between	O
orbits	O
is	O
relatively	O
linear	O
.	O
</s>
<s>
A	O
radial	B-Data_Structure
tree	I-Data_Structure
will	O
spread	O
the	O
larger	O
number	O
of	O
nodes	O
over	O
a	O
larger	O
area	O
as	O
the	O
levels	O
increase	O
.	O
</s>
<s>
MindManager	B-Protocol
and	O
MindMapper	B-Protocol
are	O
mindmapping	O
systems	O
,	O
which	O
can	O
make	O
radial-like	O
layouts	O
,	O
though	O
are	O
not	O
radial	O
beyond	O
the	O
2nd	O
level	O
.	O
</s>
<s>
SpicyNodes	B-Protocol
was	O
an	O
approach	O
to	O
visualizing	O
hierarchies	O
,	O
which	O
allows	O
moving	O
from	O
node	O
to	O
node	O
.	O
</s>
