Tuesday, October 16, 2007

L-Systems

L-systems translate letters into graphics. The letter F draws one segment, FF draws two segments, FFF draws three segments, etc..

Growing structures are enabled through a "re-writing" process. A graphical representation of a tree is grown when the strings are re-written in a cycle. The re-writing systems begins with an initiator (the first string, for example AB) and a series of consecutive rules which determine how the strings are replaced (rule 1 could be A=AB and rule 2 could be B=A).
The initial string is then rewritten based on the rules, which are followed in order (AB becomes ABA, ABA becomes ABAAB).



- joe

No comments: