Broken square tree

Broken square tree

Source code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
lsystem BrokenSquareTree {
 
set symbols axiom = x;
set iterations = 6;
 
interpret F(age) as DrawForward(2^age * 3);
interpret + as TurnLeft(90);
interpret - as TurnLeft(-90);
 
rewrite x to F(1) x - F(1) x - F(1) x - F(1) x -;
rewrite F(x) to F(x + 1);
}
 
process all with SvgRenderer;