<s>
In	O
mathematics	O
,	O
the	O
T-square	B-Application
is	O
a	O
two-dimensional	O
fractal	B-Application
.	O
</s>
<s>
Its	O
name	O
comes	O
from	O
the	O
drawing	O
instrument	O
known	O
as	O
a	O
T-square	B-Application
.	O
</s>
<s>
The	O
method	O
of	O
creation	O
is	O
rather	O
similar	O
to	O
the	O
ones	O
used	O
to	O
create	O
a	O
Koch	B-Algorithm
snowflake	I-Algorithm
or	O
a	O
Sierpinski	O
triangle	O
,	O
"	O
both	O
based	O
on	O
recursively	O
drawing	O
equilateral	O
triangles	O
and	O
the	O
Sierpinski	O
carpet.	O
"	O
</s>
<s>
The	O
T-square	B-Algorithm
fractal	I-Algorithm
has	O
a	O
fractal	B-Application
dimension	O
of	O
ln(4 )	O
/ln	O
( 2	O
)	O
=	O
2	O
.	O
</s>
<s>
The	O
fractal	B-Application
dimension	O
of	O
the	O
boundary	O
equals	O
.	O
</s>
<s>
The	O
T-square	B-Algorithm
fractal	I-Algorithm
can	O
also	O
be	O
generated	O
by	O
an	O
adaptation	O
of	O
the	O
chaos	B-Algorithm
game	I-Algorithm
,	O
in	O
which	O
a	O
point	O
jumps	O
repeatedly	O
half-way	O
towards	O
the	O
randomly	O
chosen	O
vertices	O
of	O
a	O
square	O
.	O
</s>
<s>
The	O
T-square	B-Application
appears	O
when	O
the	O
jumping	O
point	O
is	O
unable	O
to	O
target	O
the	O
vertex	O
directly	O
opposite	O
the	O
vertex	O
previously	O
chosen	O
.	O
</s>
<s>
If	O
vinc	O
is	O
given	O
different	O
values	O
,	O
allomorphs	O
of	O
the	O
T-square	B-Application
appear	O
that	O
are	O
computationally	O
equivalent	O
to	O
the	O
T-square	B-Application
but	O
very	O
different	O
in	O
appearance	O
:	O
</s>
<s>
The	O
T-square	B-Algorithm
fractal	I-Algorithm
can	O
be	O
derived	O
from	O
the	O
Sierpiński	O
triangle	O
,	O
and	O
vice	O
versa	O
,	O
by	O
adjusting	O
the	O
angle	O
at	O
which	O
sub-elements	O
of	O
the	O
original	O
fractal	B-Application
are	O
added	O
from	O
the	O
center	O
outwards	O
.	O
</s>
