Plants are Recursive!!: Using L-Systems to Generate Realistic Weeds
summary
Claim: L-systems generate realistic weeds by iterating simple string‑rewriting rules and rendering them with turtle graphics. Implementation uses L-systems string rewriting, line commands F with + and - for turn angles, and push/pop state via [ ] to model branching. Deterministic iterations (4–7 rounds shown) produce fractal shapes while stochastic rules (50/50 alternatives) add natural variation. A live web demo renders 2D plants, the code and resources are available, and extensions to 3D trees and flowers are feasible and practical.
AI-written summary · about
chapters (9)
- 0:00Start
- 1:00plants & recursion
- 1:32repetition in a self-similar way
- 2:09recursion in nature
- 3:04algae cell growth
- 3:15a string rewriting system
- 4:04describing recursive patterns
- 8:15introducing randomness
- 10:11resources
related talks
04mThe algorithmic beauty of plants
23mThe algorithmic beauty of plants
29mBotany with Bytes
22mBotany with Bytes
12mAlgorithmically generated flower beds!!
12mL.ink: Procedural Ink Growth for Controllable Surprise
26mTwisty Little Passages
38mProcedural Generation at Runtime: From Basic to Complex by Example
