Let's practice using grammars! For this lab, please pull up the L-system node in Houdini.
Look at these iterations (n = 1, 2, 3) of a one-rule grammar. Using the built in symbols in Houdini, design a grammar that produces this output.
Axiom: F,
Rule 1 : F = FF[+FF]F[+FF]FF+
Angle of rotation : 20
Iteration 1 | Iteration 2 | Iteration 3 |
---|---|---|
![]() |
![]() |
![]() |
Axiom: -F,
Rule 1 : F = F-F+F+F-F
Angle of rotation : 90
Iteration 1 | Iteration 2 | Iteration 3 |
---|---|---|
![]() |
![]() |
![]() |
Choose a plant in the world. Working off a reference, design a grammar that mimics the structure of that plant. Unlike our simple puzzles, please use multiple rules for greater complexity. You can take this as an opportunity to design a grammar for your homework assignment! Include images of your grammar's output.
- Create a pull request against this repository
- In your readme, list your solutions to the puzzles, then your custom grammar and images of a few iterations of output
- Profit