L-System Generator

This project was part of "Basics of Math for Games and VR/AR" course in the MSc Computer Games Programming at Goldsmiths University. It is an exploratory project studying L-Systems and how to algorithmically generate tree-like shapes (in 2D) using recursivity and "turtle graphics."

In essence, an L-System is a programmatically generated string of characters starting from an axiom, a set of rules to iterate upon a given string and transform it further, and a translation mechanism to move from strings to graphics. You can find examples of the algorithms at play on the Wikipedia entry for L-Systems (https://en.wikipedia.org/wiki/L-system).

This project is based on the work of Aristid Lindenmeyer and Przemyslaw Prusinkiewicz in "The Algorithmic Beauty of Plants" (1990), but also implements famous curves (such as the Koch curve), as well as interesting geometrical shapes.

It is quite simple to use, with a graphical interface giving you the possibility to add stochasticity, modify key variables and add special effects such as color.

Use the Spacebar to iterate through each level of complexity in for a given L-System (going too high will cause computer/browser to freeze eventually, be careful when setting high maximal iterations).

You can pick which pre-generated L-System you wish to see by using the relevant buttons on the left of the screen, or by hitting the 1-0 keys on top of your keyboard.