 |
|
|
|
|
|
|
|
|
|
|
|
|
|
| ABSTRACT | |||||||||||||
 |
|||||||||||||
| For my final project for PMath 370, I decided to implement an algorithm that would produce fractal landscapes. I decided to do so using Visual C++ and the OpenGL Utilities Toolkit (glut). Using OpenGL allowed me to let it take care of things such as lighting. Though I could have let OpenGL take care of transformations - rotations, translations, and perspective - I opted to do them myself, as I have a good understanding of such things. This choice caused some significant efficiency problems with larger matrix sizes. | |||||||||||||
The algorithm I implemented is the diamond square algorithm. I decided to take a recursive approach, which caused a bit of a problem in the end. The algorithm I came up with is slightly flawed in its calculation of midpoints in the early diamond stages. To determine the extent of the flaw I decided to compare the fractal without randomization of the new offset value, which is supposed to look something like a cauliflower, with what |
 |
||||||||||||
| my algorithm generates.As you can see from the image to the right, the flaw does not appear to have any noticable side effects. | |||||||||||||
|
|||||||||||||
| - back to main - next - | |||||||||||||