Project Proposal: Monkey Tree Variations
> Trenton Bush
> Cyrus Smith
> 
> Design:
>        The images are split into three sections by two lines emerging from the lower right corner.  One line intersects the midpoint of the left edge, the other intersects the midpoint of the top edge.  The resulting shapes are triangles in both the upper right and lower left corners of the canvas and the remaining quadrilateral in the center.

> Each section explores a different region of the color wheel. The colors of the sections are determined by an analogic selection from the color wheel and have saturation gradients alternating in direction from section to section.  Each section contains a fractal of varying iteration and color (based on the n value). These fractals are drawn in the color complementary to their respective section. By exploring the intersection of the three dimensionality of the color wheel and the iterative complexity inherent in fractals, we hope to have created an image that tickles the viewers mind.

Technique:
        Two aspects of our algorithm will rely on the input n value. The first is the iteration of our fractal. Each fractal is a very complex recursive form of four cases that draws 11^n number of lines for the nth iteration, so we capped the complexity at the 4th iteration. Thus, by dividing the n value by 333 and rounding we achieve a good level of complexity while still retaining elegance.
        The second n-dependent part of our algorithm is the color triad.  The colors of the three sections of the canvas are determined by rotation of the hue as a function of n and +- 41 degrees.  The gradient of the image is attained through three separate image-pixel-compute! commands that operate on two inequalities, y > Ax + .5*height, and y > Bx - height where A and B are slopes, determined by canvas dimensions, such that the lines intersect the midpoints of the top and left edges of the canvas.  To create our images we are using the following techniques: turtles, region-based color blends, and recursion.

 Combinations of fractal iterations, fractal hue, color selection and rotation will allow us to generate the requisite 1000 images.  We know the images generated for n=0…999 are unique because the fractal iteration increases every 333 n, and the color cycles through 360 unique hues per iteration.  Thus for n=0…999, the background will cycle through only 333 out of 360 colors per iteration, thereby producing no duplicates.