|
||||||
|
||||||
| Undergraduate Honours Projects | ||||||
|
Carleton University - School of Computer Science Undergraduate Honours Project Summer 2011 Procedural Terrain Generation David Turcotte 
ABSTRACT Moore's Law dictates that processing speed available from modern processors doubles every 18 months. Needless to say, processing power is expanding at a rate much faster than human modeling capabilities. As such, it is only fitting that modeling techniques evolve to take advantage of this phenomenon. This project features two algorithms for procedurally creating complex and aesthetically pleasing terrain. Heightmaps are discussed in detail and are demonstrated in their ability to store and represent a wide variety of terrain types. Next, the Marching Cubes algorithm is discussed in detail. We will use these two algorithms to polygonise fractal and noise functions to create unique and interesting terrain topology. |
||||||
|
