View-Dependent Refinement of Progressive Meshes Hugues Hoppe Microsoft Research SIGGRAPH 97.

Slides:



Advertisements
Similar presentations
Hugues Hoppe - SIGGRAPH 96 - Progressive Meshes
Advertisements

Progressive Simplicial Complexes Jovan Popovic Carnegie Mellon University Jovan Popovic Carnegie Mellon University Hugues Hoppe Microsoft Research Hugues.
Lapped textures Emil Praun Adam Finkelstein Hugues Hoppe
Geometry Clipmaps: Terrain Rendering Using Nested Regular Grids
View-Dependent Simplification of Arbitrary Polygonal Environments David Luebke.
Developer’s Survey of Polygonal Simplification Algorithms Based on David Luebke’s IEEE CG&A survey paper.
Real-Time Rendering POLYGONAL TECHNIQUES Lecture 05 Marina Gavrilova.
Multiresolution Analysis of Arbitrary Meshes Matthias Eck joint with Tony DeRose, Tom Duchamp, Hugues Hoppe, Michael Lounsbery and Werner Stuetzle Matthias.
Terrain rendering in games
Geometric Algorithms in 3D Real-Time Rendering and facial Expression Modeling Prof. Marina L. Gavrilova University of Calgary.
1 Further Terrain Rendering and Level of Detail Lecture 8 - Week 4 Advanced Programming for 3D Applications CE
UVA / UNC / JHU Perceptually Guided Simplification of Lit, Textured Meshes Nathaniel WilliamsUNC David LuebkeUVA Jonathan D. CohenJHU Michael KelleyUVA.
4.4. L EVEL OF D ETAIL Exploration of 3D mesh level-of-detail approaches.
Parallel View-Dependent Tessellation of Catmull-Clark Subdivision Surfaces Anjul Patney 1 Mohamed S. Ebeida 2 John D. Owens 1 University of California,
Pedro V. Sander Xianfeng Gu Steven J. Gortler Harvard University
Polygonal Mesh – Data Structure and Processing
Smooth view-dependent LOD control and its application to terrain rendering Hugues Hoppe Microsoft Research IEEE Visualization 1998.
New quadric metric for simplifying meshes with appearance attributes Hugues Hoppe Microsoft Research IEEE Visualization 1999 Hugues Hoppe Microsoft Research.
CPSC 335 Geometric Data Structures in Computer Modeling and GIS Dr. Marina L. Gavrilova Assistant Professor Dept of Comp. Science, University of Calgary,
CS CS 175 – Week 4 Mesh Decimation General Framework, Progressive Meshes.
Haptic Rendering using Simplification Comp259 Sung-Eui Yoon.
Compression opportunities using progressive meshes Hugues Hoppe Microsoft Research SIGGRAPH 98 course: “3D Geometry compression”
Smooth View-Dependent Level-of- Detail Control and its Application to Terrain Rendering Hugues Hoppe Microsoft Research.
Lapped Textures SIGGRAPH 2000 Emil Praun Adam Finkelstein Hugues Hoppe.
Surface Parametrizations Hugues Hoppe Microsoft Research IMA Workshop on Computer Graphics May 18, 2001 Hugues Hoppe Microsoft Research IMA Workshop on.
Visualization and graphics research group CIPIC January 30, 2003Multiresolution (ECS 289L) - Winter MAPS – Multiresolution Adaptive Parameterization.
Content Subdivision First some basics (control point polygon, mesh)
Kumar, Roger Sepiashvili, David Xie, Dan Professor Chen April 19, 1999 Progressive 3D Mesh Coding.
Progressive Meshes A Talk by Wallner and Wurzer for the overfull MathMeth auditorium.
Irregular to Completely Regular Meshing in Computer Graphics Hugues Hoppe Microsoft Research International Meshing Roundtable 2002/09/17 Hugues Hoppe Microsoft.
Level of Detail CS184-Sp05 Section. Level of Detail Basic Idea –Use simpler versions of an object as it makes less of a contribution Generation –How to.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Dynamic View-Dependent Simplification for Polygonal.
1 Rendering Transitions in a Geometric Level of Detail Framework Defended by Shaun David Ramsey On July 27, 2004.
Visualization and graphics research group CIPIC Feb 18, 2003Multiresolution (ECS 289L) - Winter Progressive Meshes (SIGGRAPH ’96) By Hugues Hoppe.
Advanced Computer Graphics (Spring 2005) COMS 4162, Lecture 10: Mesh simplification Ravi Ramamoorthi Many slides courtesy.
Visualization and graphics research group CIPIC February 13, 2003ECS289L – Multiresolution Methods – Winter Illumination Dependent Refinement of.
10/14/03CS679 - Fall Copyright Univ. of Wisconsin Last Time Level of Detail.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
CSE 381 – Advanced Game Programming Basic 3D Graphics
Dynamic Meshing Using Adaptively Sampled Distance Fields
Presented By Greg Gire Advised By Zoë Wood California Polytechnic State University.
Week 11 - Thursday.  What did we talk about last time?  Image processing  Blurring  Edge detection  Color correction  Tone mapping  Lens flare.
Level of Detail & Visibility: A Brief Overview David Luebke University of Virginia.
Progressive Mesh in DirectX Seung ho Lee Hyun taek Kwon.
Real-Time Rendering SPEEDING UP RENDERING Lecture 04 Marina Gavrilova.
Adaptively Sampled Distance Fields Representing Shape for Computer Graphics Ronald N. Perry and Sarah F. Frisken Mitsubishi Electric Research Laboratories.
Levels of Detail COMP 770 3/25/09. Problem Models can be very detailed Look great when close up Last week we explored one way of attacking this problem.
Progressive Simplicial Complexes Jovan Popovic Carnegie Mellon University Jovan Popovic Carnegie Mellon University Hugues Hoppe Microsoft Research Hugues.
1 KIPA Game Engine Seminars Jonathan Blow Ajou University December 2, 2002 Day 6.
10/23/2001CS 638, Fall 2001 Today Terrain –Terrain LOD.
Polygonal Simplification Techniques
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 8 Ravi Ramamoorthi
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 7 Ravi Ramamoorthi
Representation and modelling 3 – landscape specialisations 4.1 Introduction 4.2 Simple height field landscapes 4.3 Procedural modeling of landscapes- fractals.
Graphics Graphics Korea University cgvr.korea.ac.kr 1 7. Speed-up Techniques Presented by SooKyun Kim.
ALGORITHMS FOR POLYGON REDUCTION Author: Ing. Roman Schulz FIT VUT, 2008.
Applied Mathematics 1 Distributed visualization of terrain models How to get the whole world into a coffee mug... Rune Aasgaard.
Rendering Large Models (in real time)
Efficient Implementation of Real-Time View-Dependent Multiresolution Meshing Renato Pajarola, Member, IEEE Computer Society Christopher DeCoro, Student.
DPL3/10/2016 CS 551/651: Simplification Continued David Luebke
Advanced Computer Graphics (Spring 2013) Mesh representation, overview of mesh simplification Many slides courtesy Szymon Rusinkiewicz.
Level of Detail: Generating LODs David Luebke University of Virginia.
CSL 859: Advanced Computer Graphics Dept of Computer Sc. & Engg. IIT Delhi.
Real-Time Rendering & Game Technology CS 446/651 David Luebke.
1 Geometry for Game. Geometry Geometry –Position / vertex normals / vertex colors / texture coordinates Topology Topology –Primitive »Lines / triangles.
Terrain Level of Detail
CS Computer Graphics II
Today Runtime LOD Spatial Data Structures Overview
Hugues Hoppe - SIGGRAPH 96 - Progressive Meshes
Progressive Meshes Copyright, 1996 © Dale Carnegie & Associates, Inc.
Presentation transcript:

View-Dependent Refinement of Progressive Meshes Hugues Hoppe Microsoft Research SIGGRAPH 97

Rendering complex meshes 860,000 faces! VF

Traditional level-of-detail 50,000 faces progressive mesh representation [SIGGRAPH96] 10,000 faces 2,000 faces view-independent LOD linear sequence poppop

View-Independent LOD: Difficulties 100,000 faces outside view frustum distant backfacing S

View-dependent LOD 29,400 faces different LOD’s coexist over surface

Applications & Related work height fields parametric surfaces arbitrary meshes [Cignoni etal 95] [De Floriani etal 96] [Lindstrom etal 96] … [Rockwood etal 89] [Abi Ezzi etal 93] [Kumar etal 95] … [Xia-Varshney 96] S

Contributions l Progressive mesh  vertex hierarchy  selective refinement l Dependencies  consistent framework l View-dependent refinement criteria

base mesh original mesh 150 M0M0M0M0 M1M1M1M1 152 Review of progressive meshes … M 175 … 50013,546 MnMnMnMn vlvlvlvl vrvrvrvr vuvuvuvu vtvtvtvt vsvsvsvs vlvlvlvl vrvrvrvr edge collapse vertex split

150 M0M0M0M0 M1M1M1M1 vspl The PM representation M … vspl i … 13,546 vspl n-1 MnMnMnMn progressive mesh (PM) representation vspl 0 … vspl i … vspl n-1 M0M0M0M0 M0M0M0M0 MnMnMnMn MiMiMiMi MnMnMnMn

Idea: Selective refinement M0M0M0M0 vspl 0 vspl 1 vspl i-1 vspl n-1 [SIGGRAPH 96]: incremental update not possible

Parent-child vertex relations vsvsvsvs vtvtvtvt vuvuvuvu vsplit

v2v2v2v2 Vertex hierarchy vspl 0 M0M0M0M0 vspl 1 vspl 2 vspl 3 vspl 4 vspl 5 v1v1v1v1 v3v3v3v3 M0M0M0M0 v 10 v 11 vspl 3 v1v1v1v1 v2v2v2v2 v4v4v4v4 v5v5v5v5 vspl 0 v8v8v8v8 v9v9v9v9 vspl 2 v3v3v3v3 v6v6v6v6 v7v7v7v7 vspl 1 v5v5v5v5 v 12 v 13 vspl 4 v 10 vspl 5 v 14 v 15 v6v6v6v6 PM: MnMnMnMn [Xia & Varshney 96] M0M0M0M0

vspl 2 v 11 v1v1v1v1 v2v2v2v2 v4v4v4v4 v8v8v8v8 v9v9v9v9 v3v3v3v3 v7v7v7v7 v5v5v5v5 v 12 v 13 v 10 v 14 v 15 v6v6v6v6 v2v2v2v2 Selective refinement vspl 0 M0M0M0M0 vspl 1 vspl 3 vspl 4 vspl 5 v1v1v1v1 v3v3v3v3 M0M0M0M0 v 10 v 11 vspl 3 v1v1v1v1 v2v2v2v2 v4v4v4v4 v5v5v5v5 vspl 0 v6v6v6v6 v7v7v7v7 vspl 1 v5v5v5v5 v 12 v 13 vspl 4 v 10 selectively refined mesh v8v8v8v8 v9v9v9v9 vspl 2 v3v3v3v3 v8v8v8v8 v9v9v9v9 v3v3v3v3 Restrictions?

Legality conditions? vlvlvlvl vrvrvrvr vuvuvuvu vtvtvtvt vsvsvsvs vlvlvlvl vrvrvrvr vsplit ecol n vsplit legal if: –v s is active –v l and v r are active n ecol legal if: –? problem: consistent? [SIGGRAPH96] [Xia&Varshney96]: legal if identical neighborhood

New vspl/ecol parametrizations vsplit ecol f n1 f n0 vsvsvsvs f n3 f n2 f n1 f n0 vuvuvuvu vtvtvtvt f n3 f n2 n vsplit legal if: –v s is active –f n0,f n1,f n2,f n3 are active n ecol legal if: –v t,v u are active –f n0,f n1,f n2,f n3 are adjacent

previous mesh v5v5v5v5 v 10 v 11 v4v4v4v4 v8v8v8v8 v9v9v9v9 v7v7v7v7 v 12 v 13 v1v1v1v1 v2v2v2v2 v3v3v3v3 Runtime algorithm M0M0M0M0 v6v6v6v6 v 14 v 15 v 12 v 13 v 12 v 10 v 11 v 10 v 11 v4v4v4v4 v4v4v4v4 v6v6v6v6 v 14 v 15 v6v6v6v6 v 14 v 15 v8v8v8v8 v9v9v9v9 v3v3v3v3 v7v7v7v7 v7v7v7v7 v8v8v8v8 v8v8v8v8 v9v9v9v9 v9v9v9v9 new mesh dependency l Algorithm: n incremental (frame coherence) n efficient (~15% of frame time) n amortizable v 11 v 10 v4v4v4v4 v 14 v 15 v7v7v7v7 v8v8v8v8 v9v9v9v9

View-dependent refinement criteria 3 criteria: n view frustum n surface orientation n screen-space geometric error See paper for details. S

(1) View frustum too high too far right view is unchanged

(2) Surface orientation view is unchanged oriented away

(3) Screen-space geometric error refinement near silhouette coarser in distance tolerance=0.5 pixels

All three criteria together 69,473 faces  10,528 faces 1.9 frame/sec  6.7 frame/sec S

Fast rendering: triangle strips Greedy algorithm: n IRIS GL: avg faces/strip n OpenGL: avg. 4.2 faces/strip

32 Bezier patches Application: Parametric surfaces PM M0M0M0M0 pre- process vspl 25,440 VF M v1v1v1v1 M0M0M0M0 v2v2v2v2 v3v3v3v3 v4v4v4v4 v5v5v5v5 v6v6v6v6 v7v7v7v7 v8v8v8v8 MnMnMnMn load 10,000 1,800

Geomorphs smooth visual transitions

VIDEO view frustum (2-window terrain) screen-space error (2-window terrain) silhouette refinement (sphere) all 3 criteria including orientation (teapot) arbitrary mesh (gameguy) geomorph flythrough of gcanyon

Summary l Selective refinement framework l View-dependent refinement criteria l Real-time algorithm (fast, amortizable) l Arbitrary progressive meshes  geometrically optimized refinement!

Future work l Memory management for large models l Runtime generation of geomorphs l Refinement criteria for surface shading l Animated models