fractal_tree

input :

+ A:=0: B:= I; ( :: complex)

+ L :: list, L[i] = 0.7

# branches at each node = nops(L) = 4

+ ramification angles : t :: list ,

nops(t) = nops(L)

+ n = # iterations = 6

 

Notes :

1. after calling the procedure,

arbre :: listlist whose operands have the form : [0,I] or [I, x+yI]

2. using "map" commands to convert arbre :: listlist =[ [X_1,Y_1 ],[X_2,Y_2 ] ...[X_n,Y_n ] ] into

[ [ [Re(X_1), Im(X_1)], [Re(Y_1), Im(Y_1)] ],...,[ [Re(X_n), Im(X_n)], [Re(Y_n), Im(Y_n)] ] ]

i.e arbre:=map(y->map(x->[Re(x),Im(x)], y) , arbre);

in order to plot the arbre.

 

Done