lecture13

# lecture13 - CS 551/651: Advanced Computer Graphics LOD: A...

This preview shows pages 1–8. Sign up to view the full content.

David Luebke 1 CS 551/651: Advanced Computer Graphics LOD: A Sampling of Influential Algorithms

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
David Luebke 2 Recap: Quadric Error Metrics What is a quadric in this algorithm? How is it calculated? How is it used?
David Luebke 3 Recap: Quadric Error Metric Minimize distance to all planes at a vertex Plane equation for each face: 0 : p = + + + D Cz By Ax v [ ] = 1 z y x D C B A T v p Distance to vertex v :

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
David Luebke 4 Recap: Quadric Derivation = ) ( ) )( ( v planes p T T v p p v = ) ( ) ( v planes p T T v pp v v pp v v planes p T T = ) ( = ) ( 2 ) ( ) ( v planes p T v p v
David Luebke 5 Recap: Quadric Derivation (cont’d) pp T is simply the plane equation squared: The pp T sum at a vertex v is a matrix, Q : (29 v Q v v T = ) ( = 2 2 2 2 D CD BD AD CD C BC AC BD BC B AB AD AC AB A pp T

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
David Luebke 6 Construct a quadric Q for every vertex Q 1 Q 2 v 2 v 1 Q 1 T 1 Qv v cost edge = Sort edges based on edge cost Suppose we contract to v 1 : v 1 ’s new quadric is simply: Q 2 1 Q Q Q + = The edge quadric : Recap: Using Quadrics
David Luebke 7 Recap: Minimize Q to calculate optimal coordinates for placing new vertex Details in paper; involves inverting Q

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 12/09/2011 for the course CS 561/661 taught by Professor Lubke during the Summer '11 term at Virginia Tech.

### Page1 / 22

lecture13 - CS 551/651: Advanced Computer Graphics LOD: A...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online