| Shaun D. Ramsey | Martin Bertram | Charles Hansen |
| University of Utah | University of Kaiserslautern | University of Utah |
| Salt Lake City, UT | Kaiserslautern, Germany | Salt Lake City, UT |
| email: ramsey( )cs.utah.edu | email: bertram( )informatik.uni-kl.de | email: hansen( )cs.utah.edu |
CGIM 2003. August 13-15, 2003. Honolulu, Hawaii.
Abstract
Surface models containing billions of polygons are becoming more
frequent in computer graphics.
Mesh simplification is necessary for displaying
such surfaces at interactive rates.
We describe a novel method for simplifying
polyhedral meshes while producing multiple levels of detail
for progressive transmission and interactive exploration.
Unlike previous work on mesh simplification,
our method is not restricted to triangle meshes.
We propose a highly efficient edge-collapsing algorithm
for meshes composed of non-planar multi-sided polygons
based on a simple edge-selection strategy.
| |
Full Paper in pdf: Simplification of Arbitrary Polyhedral Meshes
Extreme Simplification
| 
| 
| |
Sample Edge Collapses
| 
| 
| |
Using Different Threshold Values
| 
| 
| 
| ||