CS 551/651: Simplification Continued
Assignment 3 Issues
Administrivia
Lecture Outline
Recap: Level of Detail
Recap: Creating LODs
Recap: Vertex Clustering
Recap: Decimation
Edge Collapse Algorithm
Vertex-Pair Merging
Quadric Error Metric
Quadric Derivation (cont’d)
Using Quadrics
Optimal Vertex Placement
Q.E.M. Algorithm
Boundary Preservation
Preventing Mesh Inversion
Dynamic LOD
Traditional Approach: Static Level of Detail
Advantages of Static LOD
Dynamic Level of Detail
Advantages of Dynamic LOD
View-Dependent LOD: Examples
Advantages of View-Dependent LOD
Drastic Simplification: The Problem With Large Objects
Dynamic LOD Algorithms
Overview: The Algorithm
Data Structures
The Vertex Tree
Vertex Tree Example
The Vertex Tree: Folding And Unfolding
The Vertex Tree: Tris and Subtris
View-Dependent Simplification
Screenspace Error Threshold
Silhouette Preservation
Triangle Budget Simplification
Other Possible View-Dependent Criteria
Optimizations
Exploiting Temporal Coherence
Asynchronous Simplification
Optimizations: Node?Tris
Summary: Pros
Summary: Cons
Related Work
Related Work: Static LOD
Dynamic Vs. Static LOD
Email: cs551dl@cs.virginia.edu
Home Page: http://www.cs.virginia.edu/~cs551dl
Download presentation source