![](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhiJhyphenhyphenysR_W9CYBoQMAkM8IBaOd72VPRbM_VRGpqixDOZMGzkyKmqm6eEcY8YXaEYVgcoq9wP1dKxIerU-RTefGfKD5mkh9nUijVWauI7S2HC6avHVYiZQxS2vcq23wIwPpO1mpAqHrftJc/s400/koch_star_lsystem_code.jpg)
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).
![](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgdX7pxSiQ6cCi7edJ-QRm4YEaEd_dpo0G1QemffSs9JEW1sgl12kBpDVPvv5OH8VOTLwZpMvQQoYp3Q8GFZ99_PcN-Urr2Gk_gvE5XBrVBIDXR00wAZftXy3BOon9_2V-IbjFMKaJDO80E/s320/koch_star+copy.jpg)
- joe
No comments:
Post a Comment