L-Systems

What sort of literature do you fancy in the evening? Simon’s downloaded the book The Algorithmic Beauty of Plants tonight.

IMG_4465

Here Simon explained to me how L-systems and Cantor Set worked:

img_4468.jpg

IMG_4467

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.

Simon says that an L-sestem is “also a context-free grammar that can have infinite generations”.

IMG_4466

The Cantor set is a set of points lying on a single line segment that has a number of remarkable and deep properties.

Simon followed the book and Daniel Shiffman’s tutorial on L-Systems to create beautiful trees and other recursive patterns in

http://turtleacademy.com/playground/en

and

http://www.kevs3d.co.uk/dev/lsystems/#

L_System Fractal Trees 15 Apr 2017 1

L_System Fractal Trees 15 Apr 2017 2 square brackets around last F

L_System Fractal Trees 15 Apr 2017 2

L_System Fractal Trees 15 Apr 2017 23

L_System Fractal Trees 15 Apr 2017 4

And “what you also might need by an L-system is a String Buffer”:

String Buffer (might need by L system) 15 Apr 2017 2

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s