L-Systems Tree in Processing [Recursive Branching]


I started playing around with a code i have written last year based on the prototype of  Alasdair Turner’s Recursive tree ( you can find it here). I added a few snapshots of the algorithm which operates in a recursive manner adding new branches into parent ones. There is however a parametric control over the variables, such as the number of generations, the  mutation rate, the size and width of the branch all integrated in an associative procedure + a randomness that provides a large amount of interesting results. I might be posting the code soon , as long as I work it a little bit more and reinforced it with some commenting ( boring….). I really look forward implementing a phototropic character into the algorithm, affecting its organization and hierarchy through the sun’s position..