https://github.com/smkplus/lsystem-unity
An L-system or Lindenmayer system is a parallel rewriting system and a type of formal grammar.
https://github.com/smkplus/lsystem-unity
Last synced: 9 months ago
JSON representation
An L-system or Lindenmayer system is a parallel rewriting system and a type of formal grammar.
- Host: GitHub
- URL: https://github.com/smkplus/lsystem-unity
- Owner: smkplus
- License: mit
- Created: 2018-08-05T15:30:23.000Z (almost 8 years ago)
- Default Branch: master
- Last Pushed: 2018-08-05T19:35:57.000Z (almost 8 years ago)
- Last Synced: 2025-04-13T22:10:01.266Z (about 1 year ago)
- Language: C#
- Size: 24.4 KB
- Stars: 3
- Watchers: 3
- Forks: 2
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# LSystem Unity
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[1] and can be used to generate self-similar fractals.
https://en.wikipedia.org/wiki/L-system
Based on this tutorials:
https://www.youtube.com/watch?v=uBEA6VSUybk
https://www.youtube.com/watch?v=E1B4UoSQMFw
