Fractal trees with L-system

Back

Leaves


The polygon drawing routine { } is a simple movement command. A triangle is drawn each move, that is, each “f” in the script. Directions are specified in brackets (degrees) or with “|” (turn 180 degrees).

5
30
10
FFL
a=30 # changes leaf angle, broad or thin.
L={-(a)f+(a)f+(a)f-(a)|-(a)f+(a)f}
@
fig31 (15K)

If more complex polygons are desired each angle of the contour is estimated with a leaf in the background, using any drawing editor. It’s convenient to just estimate the contour of one half of the leaf, and mirror the routine by using “roll” and [ ]. Here is an example of a Maple leaf.

5
40
10
FF[L]<(160)L
L={|+(45)f|-(45)z-(70)f|-(45)z-(100)z+(40)z+(90)z+(30)z|+(60)f+(55)z}
@
fig32 (14K)

When groups of leaves are arranged along a twig, like with the Rowan, polygons are repeatedly added for each recursion.

8
30
10
FFLK
K={-f+f+f-|-f+f}
L=f[+(70)K][-(70)K]L
@
fig33 (14K)