L-systems
From GenerativeArt
(Difference between revisions)
(→Example) |
(→L Systems Growth) |
||
L Systems can grow via iterative string substitution. | L Systems can grow via iterative string substitution. | ||
| - | Initial condition - n d and | + | Initial condition - n d and δ |
Axiom: a starting string | Axiom: a starting string | ||
w: X | w: X | ||
| - | p1: X | + | p1: X → F[+X]F[-X]+X |
| - | p2: F | + | p2: F → FF |
n = 0; X | n = 0; X | ||
