GROWTH ALGORITHM (LINDENMAYER's) 2)
← Back
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.
Categories
- 1) General information
- 2) Methodology or model
- 3) Epistemology, ontology and semantics
- 4) Human sciences
- 5) Discipline oriented
Publisher
Bertalanffy Center for the Study of Systems Science(2020).
To cite this page, please use the following information:
Bertalanffy Center for the Study of Systems Science (2020). Title of the entry. In Charles François (Ed.), International Encyclopedia of Systems and Cybernetics (2). Retrieved from www.systemspedia.org/[full/url]
We thank the following partners for making the open access of this volume possible: