DPL2/10/2016
CS 551/651:Final ReviewCS 551/651:Final Review
David LuebkeDavid Luebke
cs551dl@cs.virginia.educs551dl@cs.virginia.edu
http://www.cs.virginia.edu/~cs551dlhttp://www.cs.virginia.edu/~cs551dl
DPL2/10/2016
AdministriviaAdministrivia
Exercise 2 sign-up sheetExercise 2 sign-up sheet
–3-5 PM, May 4-11–3-5 PM, May 4-11
Course evaluationsCourse evaluations
Assignments graded byMonday, May 10Assignments graded byMonday, May 10
DPL2/10/2016
Final ExamFinal Exam
Format: in-class, closed-book,closed-note, closed-computer examFormat: in-class, closed-book,closed-note, closed-computer exam
Length: 1-2 hours expected lengthLength: 1-2 hours expected length
Topics: All lectures, all readingTopics: All lectures, all reading
DPL2/10/2016
RealismRealism
Global vs. local illumination modelsGlobal vs. local illumination models
Ray tracingRay tracing
–Principles & limitations–Principles & limitations
–Optimizations–Optimizations
–Advanced techniques–Advanced techniques
DPL2/10/2016
RealismRealism
Antialiasing: theory & practiceAntialiasing: theory & practice
–Frequency domain, Nyquist limit, etc.–Frequency domain, Nyquist limit, etc.
–Convolution, filters, etc.–Convolution, filters, etc.
–Sampling strategies–Sampling strategies
–Antialiasing & texture mapping–Antialiasing & texture mapping
DPL2/10/2016
RealismRealism
RadiosityRadiosity
–Principles & limitations–Principles & limitations
–Progressive radiosity–Progressive radiosity
–Computing form factors–Computing form factors
DPL2/10/2016
SpeedSpeed
VisibilityVisibility
–View-frustum culling–View-frustum culling
–Cells & portals–Cells & portals
Airey: ray-castingAirey: ray-casting
Teller: linear programming line-of-signcalculationsTeller: linear programming line-of-signcalculations
Luebke (pfPortals): depth-first adjacencygraph traversal using cull boxesLuebke (pfPortals): depth-first adjacencygraph traversal using cull boxes
DPL2/10/2016
SpeedSpeed
Visibility continuedVisibility continued
–General occlusion culling–General occlusion culling
Hierarchical Z-Buffer: coherence in imagespace, object space, and timeHierarchical Z-Buffer: coherence in imagespace, object space, and time
Hierarchical Occlusion Maps: depth vs.overlap, single-pass occluder selection,using texture hardware to accelerate HOMHierarchical Occlusion Maps: depth vs.overlap, single-pass occluder selection,using texture hardware to accelerate HOM
DPL2/10/2016
SpeedSpeed
Level of detail mechanismsLevel of detail mechanisms
–Sampling–Sampling
–Adaptive subdivision–Adaptive subdivision
–Decimation–Decimation
–Vertex merging–Vertex merging
DPL2/10/2016
SpeedSpeed
LOD criteriaLOD criteria
–Geometric vs. perceptual–Geometric vs. perceptual
–Vertex clustering: importance ranking–Vertex clustering: importance ranking
CurvatureCurvature
Edge lengthEdge length
–Decimation: distance from plane,distance from edge–Decimation: distance from plane,distance from edge
–Quadric Error Metric: squared distancefrom all supporting planes–Quadric Error Metric: squared distancefrom all supporting planes
DPL2/10/2016
SpeedSpeed
LOD algorithmsLOD algorithms
–Vertex clustering (Rossignac, Low)–Vertex clustering (Rossignac, Low)
–Decimation (Schroeder)–Decimation (Schroeder)
–Quadric error metrics (Garland)–Quadric error metrics (Garland)
DPL2/10/2016
SpeedSpeed
Choosing LODsChoosing LODs
–Simple metrics (distance, screen size)–Simple metrics (distance, screen size)
–"Knapsack” approach–"Knapsack” approach
Cost (time, polygons)Cost (time, polygons)
Benefit (lots of possible criteria)Benefit (lots of possible criteria)
DPL2/10/2016
SpeedSpeed
Dynamic LODDynamic LOD
–Idea: don’t build LODs in preprocess,build data structure & extract LODs–Idea: don’t build LODs in preprocess,build data structure & extract LODs
–Mechanism: reversible vertexclustering/edge collapsing–Mechanism: reversible vertexclustering/edge collapsing
Structures: vertex tree, active triangle listStructures: vertex tree, active triangle list
Store tris, subtris with nodesStore tris, subtris with nodes
–Static vs. dynamic LOD: pros & cons–Static vs. dynamic LOD: pros & cons
–View-dependent LOD: pros & cons–View-dependent LOD: pros & cons
DPL2/10/2016
SpeedSpeed
Dynamic LOD continuedDynamic LOD continued
–View-dependent LOD criteria–View-dependent LOD criteria
Vertex cluster sizeVertex cluster size
Silhouette preservationSilhouette preservation
Triangle budgetTriangle budget
–Optimizations: temporal coherence,asynchronous parallelization–Optimizations: temporal coherence,asynchronous parallelization
DPL2/10/2016
TopicsTopics
Work we’ve sampled in more detail:Work we’ve sampled in more detail:
–Debevec: modeling & renderingarchitecture from photographs–Debevec: modeling & renderingarchitecture from photographs
–Zhang: Hierarchical Occlusion Maps–Zhang: Hierarchical Occlusion Maps
–Luebke: View-dependent polygonalsimplification–Luebke: View-dependent polygonalsimplification
–Raskar: Image-precision silhouetteedges–Raskar: Image-precision silhouetteedges