1 / 21

Simplification of Arbitrary Polyhedral Meshes

Simplification of Arbitrary Polyhedral Meshes. *Presented by Shaun D. Ramsey at CGIM 2003 ra msey()cs.utah.edu http://www.cs.utah.edu/~ramsey/research. Motivation. Model Size Interactive/Hardware Rendering Editing Modeling Programs Transmission. Level of Detail (LOD)

kata
Download Presentation

Simplification of Arbitrary Polyhedral Meshes

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Simplification of Arbitrary Polyhedral Meshes *Presented by Shaun D. Ramsey at CGIM 2003 ramsey()cs.utah.edu http://www.cs.utah.edu/~ramsey/research

  2. Motivation • Model Size • Interactive/Hardware • Rendering • Editing • Modeling Programs • Transmission

  3. Level of Detail (LOD) Progressive Meshes (PM) Edge Collapses Triangulate Polygons Previous Work From Sander’s Texture Mapped Progressive Meshes

  4. The Process • Edge Selection • Vertex Selection • Edge Collapse

  5. The Process • Edge Selection • Vertex Selection • Edge Collapse

  6. The Process • Edge Selection • Vertex Selection • Edge Collapse

  7. For All Edges Compute Error Choose Minimal Error Error Metric Dot Product Test Add Threshold Edge Selection

  8. Triangles Quads N-sided  Polygon Normals B B B A A A A = p - p ; B = p - p i-1 ii+1 i

  9. Pre-computation Random Selection Single Selection Refined Edge Selection

  10. Half-edge Full-edge Vertex Selection

  11. Half-edge Full-edge Vertex Selection

  12. Collapse and Split

  13. Options • Half or Full-edge Collapses • Changing the Error Metric • Error Threshold • Percent/Number of Edges Searched • Treat N-sided Polygons Differently

  14. Threshold Differences – Maximum Simplification 256 1478 6492 137950.950 0.990 0.999 0.9999

  15. Threshold DifferencesRemove 15000 Polygons 0.00 minimum dot product 0.99 minimum dot product

  16. ResultsPercentage Search Original 42 Edges 425 Edges

  17. Results Simplification ~870k polygons ~370k polygons

  18. ResultsLOD Simplification 871k 378k 67k

  19. Results – Timing 0.99 minimum dot product, search 1% of the mesh

  20. Future Work • Selective Refinement • Multi-resolution Editing • Preservation of Feature Lines • Surface Parameterization • Surface Segmentation

  21. Acknowledgements • Utah Graphics Group • Stanford Scanning Repository • Avalon

More Related