L-system
Sign in to savethumb|upright=1.5|L-system trees form realistic models of natural patterns
Article
28 sectionsContents
- Origins
- L-system structure
- Examples of L-systems
- Example 1: algae
- Example 1: algae, explained
- Example 2: fractal (binary) tree
- Example 3: Cantor set
- Example 4: Koch curve
- Example 5: Sierpinski triangle
- Example 6: dragon curve
- Example 7: fractal plant
- Variations
- Stochastic grammars
- Context sensitive grammars
- Parametric grammars
- Bi-directional grammars
- L-system Construction and Inference
- Manual L-System Construction
- L-system Inference
- Manual and Semi-Automated Tools
- Domain-Specific Inference Approaches
- Generalized Inference Algorithms
- Open problems
- Types of L-systems
- See also
- Notes
- Books
- External links
thumb|upright=1.5|L-system trees form realistic models of natural patterns
An L-system or Lindenmayer system is a parallel rewriting system and a type of formal grammar. An L-system consists of an alphabet of symbols that can be used to make strings, a collection of production rules that expand each symbol into some larger string of symbols, an initial "axiom" string from which to begin construction, and a mechanism for translating the generated strings into geometric structures. L-systems were introduced and developed in 1968 by Aristid Lindenmayer, a Hungarian theoretical biologist and botanist at the University of Utrecht. Lindenmayer used L-systems to describe the behaviour of plant cells and to model the growth processes of plant development. L-systems have also been used to model the morphology of a variety of organisms and can be used to generate self-similar fractals.