diff --git a/1.png b/1.png new file mode 100644 index 0000000..cfbfc3c Binary files /dev/null and b/1.png differ diff --git a/2.png b/2.png new file mode 100644 index 0000000..f107166 Binary files /dev/null and b/2.png differ diff --git a/3.1.png b/3.1.png new file mode 100644 index 0000000..4053408 Binary files /dev/null and b/3.1.png differ diff --git a/3.2.png b/3.2.png new file mode 100644 index 0000000..6576673 Binary files /dev/null and b/3.2.png differ diff --git a/3.3.png b/3.3.png new file mode 100644 index 0000000..30bb786 Binary files /dev/null and b/3.3.png differ diff --git a/3.png b/3.png new file mode 100644 index 0000000..7aa968c Binary files /dev/null and b/3.png differ diff --git a/README.md b/README.md index 91c9197..fb3a781 100644 --- a/README.md +++ b/README.md @@ -1,5 +1,5 @@ # lab03-grammars -Let's practice using grammars! For this lab, please pull up the L-system node in Houdini. +Name: Xiaoxiao(Crystal) Zou & Ruijun(Daniel) Zhong ## 1. Wheat grammar puzzle 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. Take a screenshot of your rules.\ @@ -7,16 +7,41 @@ Look at these iterations (n = 1, 2, 3) of a one-rule grammar. Using the built in square2 square3 + Angle: 20 +![](1.png) + ## 2. Square grammar puzzle How about this one? Take a screenshot of your rules.\ square1 square2 -square3 +square3 +Angle: 90 +![](2.png) ## 3. Custom plant 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. Think carefully about the structure of your grammar! EXPLAIN the structure of your plant in the README. What are the components? What do each of the rules do? Be sure to also include images of a few iterations of your output plant. + +![](3.png) +![](3.1.png) +![](3.3.png) +![](3.2.png) + + ### Parameters: + * Angle: 50 * randscale + * Step size: 0.08 + + ### Explanation of Rule: + We use the rules to simulate dandelion: + F = \ / \ /C: + * Turn Left-Rgiht-Left of C + + A = FFFF[//[++F]][\\[+F]][/[-F]][\[--F]] & B = B=FFFF[//[++F]][\\[+F]][/[-F]][\[--F]]: + * FFFF = Move forward 4 times + * [//[++F]]: Save the dandelion's state, Right-Right-Forward, then return to the saved state. + * [\\[+F]]: Save the dandelion's state, Left-Right-Forward, then return to the saved state. + * [/[-F]]: Save the dandelion's state, Left-Forward, then return to the saved state. + * [\[--F]]: Save the dandelion's state, Left-Left-Forward, then return to the saved state. + +C = [A][B]: +* Make system branches twice A then B. -## Submission -- Create a pull request against this repository -- In your readme, list your solutions and format your README nicely -- Profit