logging in or signing up present Irvette Download Post to : URL : Related Presentations : Share Add to Flag Embed Email Send to Blogs and Networks Add to Channel Uploaded from authorPOINTLite Insert YouTube videos in PowerPont slides with aS Desktop Copy embed code: (To copy code, click on the text box) Embed: URL: Thumbnail: WordPress Embed Customize Embed The presentation is successfully added In Your Favorites. Views: 56 Category: Entertainment License: All Rights Reserved Like it (0) Dislike it (0) Added: October 12, 2007 This Presentation is Public Favorites: 0 Presentation Description No description available. Comments Posting comment... Premium member Presentation Transcript Simplification of Arbitrary Polyhedral Meshes: Simplification of Arbitrary Polyhedral Meshes *Presented by Shaun D. Ramsey at CGIM 2003 ramsey()cs.utah.edu http://www.cs.utah.edu/~ramsey/research Motivation: Motivation Model Size Interactive/Hardware Rendering Editing Modeling Programs TransmissionPrevious Work: Previous Work Level of Detail (LOD) Progressive Meshes (PM) Edge Collapses Triangulate Polygons From Sander’s Texture Mapped Progressive MeshesThe Process: The Process Edge Selection Vertex Selection Edge CollapseThe Process: The Process Edge Selection Vertex Selection Edge CollapseThe Process: The Process Edge Selection Vertex Selection Edge CollapseEdge Selection: Edge Selection For All Edges Compute Error Choose Minimal Error Error Metric Dot Product Test Add Threshold Polygon Normals: Polygon Normals Triangles Quads N-sided A A A B B B A = p - p ; B = p - p i-1 i i+1 iRefined Edge Selection: Refined Edge Selection Pre-computation Random Selection Single SelectionVertex Selection: Vertex Selection Half-edge Full-edgeVertex Selection: Vertex Selection Half-edge Full-edge Collapse and Split: Collapse and SplitOptions: Options Half or Full-edge Collapses Changing the Error Metric Error Threshold Percent/Number of Edges Searched Treat N-sided Polygons Differently Threshold Differences – Maximum Simplification: Threshold Differences – Maximum Simplification 256 1478 6492 13795 0.950 0.990 0.999 0.9999 Threshold Differences Remove 15000 Polygons: Threshold Differences Remove 15000 Polygons 0.00 minimum dot product 0.99 minimum dot productResults Percentage Search: Results Percentage Search Original 42 Edges 425 EdgesResults Simplification: Results Simplification ~870k polygons ~370k polygonsResults LOD Simplification: Results LOD Simplification 871k 378k 67kResults – Timing: Results – Timing 0.99 minimum dot product, search 1% of the meshFuture Work: Future Work Selective Refinement Multi-resolution Editing Preservation of Feature Lines Surface Parameterization Surface SegmentationAcknowledgements: Acknowledgements Utah Graphics Group Stanford Scanning Repository Avalon You do not have the permission to view this presentation. In order to view it, please contact the author of the presentation.
present Irvette Download Post to : URL : Related Presentations : Share Add to Flag Embed Email Send to Blogs and Networks Add to Channel Uploaded from authorPOINTLite Insert YouTube videos in PowerPont slides with aS Desktop Copy embed code: (To copy code, click on the text box) Embed: URL: Thumbnail: WordPress Embed Customize Embed The presentation is successfully added In Your Favorites. Views: 56 Category: Entertainment License: All Rights Reserved Like it (0) Dislike it (0) Added: October 12, 2007 This Presentation is Public Favorites: 0 Presentation Description No description available. Comments Posting comment... Premium member Presentation Transcript Simplification of Arbitrary Polyhedral Meshes: Simplification of Arbitrary Polyhedral Meshes *Presented by Shaun D. Ramsey at CGIM 2003 ramsey()cs.utah.edu http://www.cs.utah.edu/~ramsey/research Motivation: Motivation Model Size Interactive/Hardware Rendering Editing Modeling Programs TransmissionPrevious Work: Previous Work Level of Detail (LOD) Progressive Meshes (PM) Edge Collapses Triangulate Polygons From Sander’s Texture Mapped Progressive MeshesThe Process: The Process Edge Selection Vertex Selection Edge CollapseThe Process: The Process Edge Selection Vertex Selection Edge CollapseThe Process: The Process Edge Selection Vertex Selection Edge CollapseEdge Selection: Edge Selection For All Edges Compute Error Choose Minimal Error Error Metric Dot Product Test Add Threshold Polygon Normals: Polygon Normals Triangles Quads N-sided A A A B B B A = p - p ; B = p - p i-1 i i+1 iRefined Edge Selection: Refined Edge Selection Pre-computation Random Selection Single SelectionVertex Selection: Vertex Selection Half-edge Full-edgeVertex Selection: Vertex Selection Half-edge Full-edge Collapse and Split: Collapse and SplitOptions: Options Half or Full-edge Collapses Changing the Error Metric Error Threshold Percent/Number of Edges Searched Treat N-sided Polygons Differently Threshold Differences – Maximum Simplification: Threshold Differences – Maximum Simplification 256 1478 6492 13795 0.950 0.990 0.999 0.9999 Threshold Differences Remove 15000 Polygons: Threshold Differences Remove 15000 Polygons 0.00 minimum dot product 0.99 minimum dot productResults Percentage Search: Results Percentage Search Original 42 Edges 425 EdgesResults Simplification: Results Simplification ~870k polygons ~370k polygonsResults LOD Simplification: Results LOD Simplification 871k 378k 67kResults – Timing: Results – Timing 0.99 minimum dot product, search 1% of the meshFuture Work: Future Work Selective Refinement Multi-resolution Editing Preservation of Feature Lines Surface Parameterization Surface SegmentationAcknowledgements: Acknowledgements Utah Graphics Group Stanford Scanning Repository Avalon