building tree

The overall goal is to develop a convenient interactive program for generating three dimensional trees according to the following rules (which you may make more elaborate, but not simpler). The algorithm below is a 3D expansion of the formulation in [login to view URL] . There are other approaches (see for example [login to view URL] ) but we will stick to the formulation below for simplicity. See also [login to view URL] for example. Start with the trunk segment as the starting parent segment, Then 1. draw this segment 2. recursive for each of a number of sprouting segments (the exact number a parameter to the algorithm, with the option of a random feature) a. set the sprout direction (parents direction plus a change in 3D, with the option of a random feature) b. set segment length as a fraction of the parent’s length (random feature option here too) The sprouting segments are connected to the parent segment at the end of the parent segment, and positioned according to a rule (with a possible random feature) around the end of the parent segment. The segments are 3D objects modeled as cylinders or cones initially (use the glut model). NOTE: Do not try to avoid segments colliding. Assume segments can grow through one another. One task of the computer scientist is to construct tools that are easy to use by non-programmers, for example artists. That is one goal of this project. Identify all the parameters and choices in the above description and design a user interface (using only GLUT) to allow easy setting and adjusting of the various details that define a particular tree. Program requirements: 1. Solid tree segments (not wire frame) with hidden surface removal 2. 3D viewing (similar to class examples of rotating an object) 3. GUI & keyboard control of parameters. (More here than just keyboard entry of numbers, some well designed mouse interaction for selecting values in a range of values etc.) 1. Create a forest of at least 5 trees of differing styles. 2. Lighting 3. Polygon leaves at end of branches.