Progressive Mesh in DirectX 2000160114 Seung ho Lee 2000160207 Hyun taek Kwon.

Slides:



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

Introduction to Massive Model Visualization Patrick Cozzi Analytical Graphics, Inc.
View-Dependent Simplification of Arbitrary Polygonal Environments David Luebke.
Progressive Transmission of Appearance Preserving Octree-Textures Camille Perin Web3D 2008 August 9, 2008 Julien LacosteBruno Jobard LIUPPA University.
Real-Time Rendering POLYGONAL TECHNIQUES Lecture 05 Marina Gavrilova.
Terrain rendering in games
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.
Smooth view-dependent LOD control and its application to terrain rendering Hugues Hoppe Microsoft Research IEEE Visualization 1998.
CS CS 175 – Week 4 Mesh Decimation General Framework, Progressive Meshes.
Haptic Rendering using Simplification Comp259 Sung-Eui Yoon.
View-Dependent Refinement of Progressive Meshes Hugues Hoppe Microsoft Research SIGGRAPH 97.
1 Dr. Scott Schaefer Hidden Surfaces. 2/62 Hidden Surfaces.
Tomas Mőller © 2000 Speeding up your game The scene graph Culling techniques Level-of-detail rendering (LODs) Collision detection Resources and pointers.
Smooth View-Dependent Level-of- Detail Control and its Application to Terrain Rendering Hugues Hoppe Microsoft Research.
Streaming QSplat: A Viewer for Networked Visualization of Large, Dense Models Szymon Rusinkiewicz Marc Levoy Stanford University.
Simplification of Arbitrary Polyhedral Meshes Shaun D. Ramsey* Martin Bertram Charles Hansen University of Utah University of Kaiserslautern University.
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.
CS CS 175 – Week 5 Mesh Decimation Fairness Criteria.
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.
Visualization and graphics research group CIPIC Feb 18, 2003Multiresolution (ECS 289L) - Winter Progressive Meshes (SIGGRAPH ’96) By Hugues Hoppe.
Advanced Computer Graphics (Spring 2006) COMS 4162, Lecture 11: Quadric Error Metrics Ravi Ramamoorthi Some material.
CS CS 175 – Week 4 Triangle Mesh Smoothing Discrete Differential Geometry.
Advanced Computer Graphics (Spring 2005) COMS 4162, Lecture 10: Mesh simplification Ravi Ramamoorthi Many slides courtesy.
Topological Surgery Progressive Forest Split Papers by Gabriel Taubin et al Presented by João Comba.
Visualization and graphics research group CIPIC February 13, 2003ECS289L – Multiresolution Methods – Winter Illumination Dependent Refinement of.
Originally presented at: ACM SIGGRAPH 2003 Symposium on Interactive 3D Graphics Interruptible Rendering Joint work with: David Luebke * Benjamin Watson†
CSE 872 Dr. Charles B. Owen Advanced Computer Graphics1 Polygon Meshes and other modeling tools Object representation Polygon meshes Normals Scene graphs.
Geometric clustering for line drawing simplification
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
Viewpoint Entropy-driven Simplification Pascual Castelló 1, Mateu Sbert 2, Miguel Chover 1 and Miquel Feixas 2 1 Universitat Jaume I de Castelló, Spain.
Dynamic Meshing Using Adaptively Sampled Distance Fields
NDVI-based Vegetation Rendering CGIM ‘07 Stefan Roettger, University of Erlangen
Presented By Greg Gire Advised By Zoë Wood California Polytechnic State University.
1 Overview (Part 1) Background notions A reference framework for multiresolution meshes Classification of multiresolution meshes An introduction to LOD.
Surface Simplification Using Quadric Error Metrics Garland & Heckbert Siggraph 97.
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.
Semi-regular 3D mesh progressive compression and transmission based on an adaptive wavelet decomposition 21 st January 2009 Wavelet Applications in Industrial.
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 8 Ravi Ramamoorthi
CSCE 552 Spring D Models By Jijun Tang. Triangles Fundamental primitive of pipelines  Everything else constructed from them  (except lines and.
CS418 Computer Graphics John C. Hart
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 7 Ravi Ramamoorthi
Modeling, CG, and others Jyun-Ming Chen Fall 2001.
Graphics Graphics Korea University cgvr.korea.ac.kr 1 7. Speed-up Techniques Presented by SooKyun Kim.
Mesh Sekeltonization פרויקט סוף תואר איל רז מנחה – ג ' יהאד אל - סנה.
Level of Detail: Generating LODs David Luebke University of Virginia.
X-Toon: An Extended Toon Shader Pascal Barla, Joelle Thollot ARTIS GRAVIR/IMAGE INRIA Lee Markosian University of Michigan.
Rendering Large Models (in real time)
1 Overview (Part 1) Background notions A reference framework for multiresolution meshes Classification of multiresolution meshes An introduction to LOD.
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.
1 Geometry for Game. Geometry Geometry –Position / vertex normals / vertex colors / texture coordinates Topology Topology –Primitive »Lines / triangles.
CENG 789 – Digital Geometry Processing 04- Mesh Data Structures
Advanced Computer Graphics
CS Computer Graphics II
CS475 3D Game Development Level Of Detail Nodes (LOD)
Today Runtime LOD Spatial Data Structures Overview
Meshes.
Geometric Solids All bounded three-dimensional geometric figures. Examples: Sphere, Cylinders, Cubes, Cones, Pyramids, and Prisms.
Geometric Solids All bounded three-dimensional geometric figures. Examples: Sphere, Cylinders, Cubes, Cones, Pyramids, and Prisms.
Progressive Meshes Copyright, 1996 © Dale Carnegie & Associates, Inc.
Chap 10. Geometric Level of Detail
Run-Time LOD Run-time algorithms may use static or dynamic LOD models:
12.1-D Figures Objective: students will be able to identify the attributes of 3-d figures.
Presentation transcript:

Progressive Mesh in DirectX Seung ho Lee Hyun taek Kwon

What is Progressive Mesh? Level of Detail (LOD) Progressive simplification or detail Mesh

Overview of Progressive Mesh Edge collapse or Vertex Split Selective Refinement

Edge collapse or Vertex Split

Selective Refinement Use Vertex History

The Pipeline of DirectX Mesh ID3DXMesh interface ID3DXMesh ID3DXPMesh interface ID3DXPMesh

ID3DXMesh interface General Mesh interface Buffers – Vertex Buffer – Index Buffer – Attribute Buffer Functions – DrawSubset(DWORD n);

ID3DXPMesh Progressive Mesh interface Make from ID3DXMesh Using Progressive Mesh interface

Implementation Implement from ID3DXMesh Using Vertex Buffer and Index Buffer Class Gmesh Vertex Node Tree, History

Rendering Pipeline Read PM File Make GMesh Write in Mesh Buffer Draw Mesh

Result Rabbit

View-Dependent Refinement 1.Definitions 2.Refinement Criteria 3.Implementation

1. Definitions (1) -Active vertex, Active face A vertex or face is active if it exists in the selectively refined mesh M s.

1. Definitions (2) -Vertex hierarchy

1. Definitions (3) -Legal

2. Refinement Criteria (1) View frustum Coarsen regions outsize the view frustum (2) Surface orientation Coarsen regions oriented away from viewer (3) Screen-space geometric error Makes the difference between approximate surface M and the original M ^ small

2. Refinement Criteria (1) - Bounding Sphere

2. Refinement Criteria (1) -Out of View frustum Red lines show distance

2. Refinement Criteria (2) - Cone of normals Unnecessary to split if

2. Refinement Criteria (3) -Distance The distance between the approximate surface M and the original M^, when projected on the screen, is every where less than a screen-space tolerance r.

3. Implementation -ListNode *ActiveVertexHead double linked list of active vertex -ListNode *RootVertexHead Double linked list of root vertex

3. Implementation Active Vertex v1 v2 v3v4v5v6 v1v3v4v5v6 v21v22 Split Qrefine()