simplification of arbitrary polyhedral meshes shaun d. ramsey* martin bertram charles hansen...
Post on 20-Dec-2015
216 views
TRANSCRIPT
Simplification of Arbitrary Polyhedral Meshes
Shaun D. Ramsey*
Martin Bertram
Charles Hansen
University of Utah
University of Kaiserslautern
University of Utah
*Presented by Shaun D. Ramsey at CGIM 2003
ramsey()cs.utah.edu
http://www.cs.utah.edu/~ramsey/research
Previous Work
Level of Detail (LOD) Progressive Meshes (PM) Edge Collapses Triangulate Polygons
From Sander’s Texture Mapped Progressive Meshes
Edge Selection
For All Edges Compute Error
Choose Minimal Error
Error Metric Dot Product Test Add Threshold
Options
Half or Full-edge Collapses Changing the Error Metric Error Threshold Percent/Number of Edges Searched Treat N-sided Polygons Differently
Results – Timing
Model Original Simplified Time (s)
Dragon 871414 48584 42.900
Bunny 69451 6958 4.110
Crocodile 21590 11695 3.670
Venus 4254 711 0.310
0.99 minimum dot product, search 1% of the mesh
Future Work
Selective Refinement Multi-resolution Editing Preservation of Feature Lines Surface Parameterization Surface Segmentation