L-systems

(Difference between revisions)

-== L Systems ==
+== Introduction ==
-<em>Named after Aristid Lindenmayer.</em>
+"L System" is named after it's inventor <em>Aristid Lindenmayer.</em>
-A grammer based system for describing and generating branching structures which (often) exhibit self-similarity
+L System is a grammar based system for describing and generating branching structures which (often) exhibit self-similarity.
 === Basic Operations ===
   F[+F]F[-F]F
-{|
+{{SingleImage|imageURL=http://www-viz.tamu.edu/courses/viza658/wiki/lsys/lsys01.png|caption=Example showing string interpretation}}
-|-
-|{{SingleImage|imageURL=http://www-viz.tamu.edu/courses/viza658/wiki/lsys/lsys01.png|caption=Example showing string interpretation}}
+== L Systems Grow via Iterative String Substitution ==
+Initial condition - n d and δ
+Axiom: a starting string
+Production Rules: specifies string substitution
+=== Example ===
+Initial Conditions
+ n = 3
+ δ = 25.7°
+ d = 1
+ w: F (Axiom)
+ p: F → F[+F]F[-F]F (Production Rule)
+ n = 0; F
+ n = 1; F[+F]F[-F]F
+ n = 2; F[+F]F[-F]F[+F[+F]F[-F]F]F[+F]F[-F]F[-F[+F]F[-F]F]F[+F]F[-F]F
+{{SingleImage|imageURL=http://www-viz.tamu.edu/courses/viza658/wiki/lsys/lsys02.png|caption=Example showing string substitution}}

Revision as of 03:31, 14 September 2009