Here
Below
Decimation of Triangular Meshes
Studied and presented on the following decimation algorithms :
 | Decimation of triangular Meshes : Schroeder et al. (SIGGRAPH'92) |
| Progrssive Meshes : Hughes Hoppe (Microsoft Research) |
| Multiresolution Analysis of Arbitary Meshes : Eck, Hoppe et al.(SIGGRAPH'95) |
The mesh implmentation is based on a hierarchical structure as presented in Schroeder's paper. I immplemented and tested the decimation algorithm as specified in the paper, and plan to extend the triangulation algorithm to include material attributes.
The Presentation
On Schroeder's decimation algorithm
Introduction to Hoppe's Progressive Meshes
The source code
An Example Mesh
This illustrates the basics of decimation. A flat 2D mesh of 162 triangles is reduced to 16 triangles, keeping relatively higher error thresholds.
 Original wireframe |
 Decimated Mesh |
Some Select Results
A plot of the function : z=sin(x*x + y*y)
Original Mesh : 3600 vertices, 6962 triangles
Gourard Shading |
Wireframe |
Original Mesh |
 Original Mesh |
20% reduction (5568 triangles) |
 20% reduction |
40% reduction (3555 triangles) |
 40 % reduction (note more reduction of flatter areas) |
 71% reduction (2015 triangles) |
71% reduction (note the fan at the outer membranes) |
(Equation and image grabbing courtesy : Anshul Sood)