primaryobjects / lsystems

Recursive patterns using Lindenmayer systems.

L-Systems

Drawing recursive patterns using a formal grammar heuristic.

This is a demo of using a Lindenmayer system to draw patterns using a basic implementation of the programming language Logo. The pattern is drawn using a heuristic based upon a formula for X and Y movement. The formula is defined using the grammar shown below. The default value is the Dragon pattern!

The project is demonstrated using React, Javascript, and the HTML5 canvas. Run it on Codepen.

Screenshot

Try the online demo.

Grammar

A lindemayer system consists of a formal grammar, which defines the movement, steps, and direction for the pen to take. This project's grammar is defined below.

X = Run the formula for X
Y = Run the formula for Y
F = Move forward by n steps
+ = Turn right by 90 degrees
- = Turn left by 90 degrees

From the above set of simple rules, complex patterns can emerge on the canvas. For example, the default formula defines the so-called "Dragon" pattern, which consists of a x-axis movement and a y-axis movement. The definition is listed below.

X: X+YF+
Y: -FX-Y

For formula X, the grammar dictates that we first execute the X-axis formula for the pen, turn right by 90 degrees, execute the Y-axis formula, move forward (drawing a line), turn right by 90 degrees.

We follow a similar set of steps for formula Y. Since the recursive nature of the grammar would continue running infinitely, we limit the execution of the pattern to a specified number of steps, thus completing the pattern.

Example Formulas to Try

Cross

X: X+YF+
Y: -FX

Diagonal

X: X+YYF-
Y: -FX+Y

License

MIT

Author

Kory Becker http://www.primaryobjects.com/kory-becker