Abstract
Lindenmayer systems, or L-systems, are formal grammars originally developed by Aristid Lindenmayer (left) to describe the growth patterns of plants and multicellular organisms. They are similar to text replacement systems such as Semi-Thue and Markov systems, with the exception that an L-system applies all matching rules at each production step, whereas other systems apply only one rule at a time.Our presentation will cover the following:
- Introduction
- Types of L-Systems
- The relationship between fractals and L-Systems
- BREAK
- Application: Music
- Application: Plant forms
- Application: Network traffic modelling
- Conclusion
A computer generated rose based on a Lindenmayer grammar.
