GROWTH ALGORITHM (LINDENMAYER's)
Charles François (2004). GROWTH ALGORITHM (LINDENMAYER's), International Encyclopedia of Systems and Cybernetics, 2(1): 1475.
| Collection | International Encyclopedia of Systems and Cybernetics |
|---|---|
| Year | 2004 |
| Vol. (num.) | 2(1) |
| ID | ◀ 1475 ▶ |
| Object type | Methodology or model |
An algorithm for construction of a tree that can generate one-dimensional sequences , but also apply its rules in several places simultaneously (After C. EMMECHE, 1994, p.74)
The algorithm is recursive , i.e. it functions as a programmed rewriting process .
EMMECHE comments that it “…can be viewed as a series of recipes or algorithms for the creation of the parts of a plant” (Ibid).
The “trees ” thus constructed are more or less self-similar , which explains why many plants tend to develop a fractal disposition of their parts. The models thus generated can be made more realistic by introducing some randomness in the algorithm.