MQP: Mesh Algorithms

Mesh Decimation Source code (46 KB) - Release Notes
Win32 Binary (126 KB)
Test Models (2.12 MB) - test009.wrl courtsey of Mark Stevens Ph. D.
Stanford Bunny Model (914 KB) - courtesy of the Large Geometric Models Archive at Georgia Tech
Hand Model (9.29 MB) - courtesy of the Large Geometric Models Archive at Georgia Tech
Our Report (3.1 MB)

Our goal of this project is to use known algorithms to alter the polygonal count of triangle meshes. There are two ways to alter triangle meshes, either increase or decrease the polygonal count. We decrease the polygonal count so images render faster. We increase the polygonal count so images render with more detail. One method used to decrease the polygonal count is known as mesh simplification or decimation. The first published decimation algorithm was first documented by Schroeder, Zarge, and Lorensen in the July 1992 issue of Computer Graphics, a publication of ACM SIGGRAPH. Mesh simplification is defined as "the problem of reducing the number of faces in a dense mesh while minimally perturbing the shape."