Thursday, April 23, 2009

Assignment 01A

As discussed in last class, you are supposed to deliver a small set of diagrams (like the ones from the post below), showing an idea of a recursive algorithm using basic 2D geometric shapes (square, circle, triangle, straight line, pentagon etc).

You should define a simple rule and show in a diagram how the iteration of this rule is going to create complexity. Also, define initial state and final condition.

The results should be posted here on the blog by Saturday, 25.04, so that I can take a look at it on Sunday and choose some to further develop in class.

The goal of this first assignment is to create the basic graphical idea to be further explored and developed into a pavilion-like structure.

No comments:

Post a Comment