Designing with L-Systems, Part 8: Non-Terminal T-Sequence Generation
Sample pages
Page 1, at reduced quality. Open the document to read every page in full.
Part 8 of Ralph Griswold's series on designing with L-Systems, dealing with non-terminal L-Systems that generate t-sequence expressions. It gives two examples of recursive rule sets (using pal, motif, hor, coll and ver operations), assigns values to the undefined variables, and shows the resulting sequences, partial drafts and weave drawdowns. It closes by listing four problems with the approach (hard to design, predict, assign values, and sequences become very long) and recommends trying many alternatives with computer programs.
(A free account is all you need)
From Ralph Griswold's Digital Archive, delivered by the University of Arizona.
Have missing pages or a better copy of this document, or another document to share? Contributing documents »