We spent yesterday under the beautiful fractal tree branches of all sorts. Simon followed a whole set of coding challenges by Daniel Shiffman in algorithmic botany featuring several ways of generating a tree.
In the first video Simon built an object oriented tree, with cherry blossom falling down. With this method, every part of the tree is seen as an object, so that he could apply forces and attributes to each element:
The next method is using a recursive argument: Simon explains what it is but hasn’t been able to use it on practice as his p5 ide crashed every time he tried.
The next method is based on the L-System. An L-system or Lindenmayer system is a parallel rewriting system and a type of formal grammar. An L-system consists of an alphabet of symbols that can be used to make strings, a collection of production rules that expand each symbol into some larger string of symbols, an initial “axiom” string from which to begin construction, and a mechanism for translating the generated strings into geometric structures. L-systems were introduced and developed in 1968 by Aristid Lindenmayer, a Hungarian theoretical botanistat the University of Utrecht.
Simon has also tried a fourth method, the space colonization algorithm to make a tree generator, but got stuck.