Mesh Simplification. Plan Introduction Mesh Simplifications Current Techniques The Projet Results.

Slides:



Advertisements
Similar presentations
 Over-all: Very good idea to use more than one source. Good motivation (use of graphics). Good use of simplified, loosely defined -- but intuitive --
Advertisements

Surface Simplification using Quadric Error Metrics Guowei Wu.
Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September
Memory-Efficient Sliding Window Progressive Meshes Pavlo Turchyn University of Jyvaskyla.
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.
Discrete Geometry Tutorial 2 1
Computing Stable and Compact Representation of Medial Axis Wenping Wang The University of Hong Kong.
Visualization and graphics research group CIPIC Decimation of Triangle Meshes William J. Schroeder, Jonathan A. Zarge, William E. Lorensen Presented by.
5/1/2000Deepak Bandyopadhyay / UNC Chapel Hill 1 Extended Quadric Error Functions for Surface Simplification Deepak Bandyopadhyay COMP 258 F2000 Project.
High-Quality Simplification with Generalized Pair Contractions Pavel Borodin,* Stefan Gumhold, # Michael Guthe,* Reinhard Klein* *University of Bonn, Germany.
New quadric metric for simplifying meshes with appearance attributes Hugues Hoppe Microsoft Research IEEE Visualization 1999 Hugues Hoppe Microsoft Research.
Stefan Gumhold,* Pavel Borodin, # Reinhard Klein # *University of Tuebingen, Germany # University of Bonn, Germany Intersection Free Simplification.
CS CS 175 – Week 4 Mesh Decimation General Framework, Progressive Meshes.
Mesh Simplification Global and Local Methods:
CENG 789 – Digital Geometry Processing 05- Smoothing and Remeshing
Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.
Visibility-Guided Simplification Eugene Zhang and Greg Turk GVU Center, College of Computing Georgia Institute of Technology.
3D Model Simplification (GATE-540)
Visualization 2000 Tutorial Mesh-Based Methods for Multiresolution Representations Instructor: Ken Joy Center for Image Processing and Integrated Computing.
Advanced Computer Graphics (Spring 2006) COMS 4162, Lecture 11: Quadric Error Metrics Ravi Ramamoorthi Some material.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
ECS 289L A Survey of Mesh-Based Multiresolution Representations Ken Joy Center for Image Processing and Integrated Computing Computer Science Department.
1 Note on QEM Implementation. 2 Algorithm Summary.
10/14/03CS679 - Fall Copyright Univ. of Wisconsin Last Time Level of Detail.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
A D V A N C E D C O M P U T E R G R A P H I C S CMSC 635 January 15, 2013 Quadric Error Metrics 1/20 Quadric Error Metrics.
Presented By Greg Gire Advised By Zoë Wood California Polytechnic State University.
10/02/2001CS 638, Fall 2001 Today Level of Detail Overview Decimation Algorithms LOD Switching.
Progressive Meshes with Controlled Topology Modification University of Bonn Institute II. for Computer Science Computer Graphics Group Pavcl Borodin Rchinhard.
DPL10/16/2015 CS 551/651: Simplification Continued David Luebke
Surface Simplification Using Quadric Error Metrics Garland & Heckbert Siggraph 97.
Triangular Mesh Decimation
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.
Scalable, High-Quality Mesh Simplification Michael Garland Eric Shaffer University of Illinois at Urbana–Champaign Michael Garland Eric Shaffer University.
Polygonal Simplification Techniques
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Geometric Modeling How to design a graphical model? How to create a digital description of a real-world object? Design Digitize.
Using Coordinate Geometry to Prove Parallelograms
CS418 Computer Graphics John C. Hart
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 7 Ravi Ramamoorthi
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert August 1997 Michael Garland Paul S. Heckbert August 1997.
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 9 Ravi Ramamoorthi
ALGORITHMS FOR POLYGON REDUCTION Author: Ing. Roman Schulz FIT VUT, 2008.
Level of Detail: Generating LODs David Luebke University of Virginia.
DPL2/10/2016 CS 551/651: Final Review David Luebke
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
Rendering Large Models (in real time)
COMPUTER GRAPHICS CS 482 – FALL 2015 SEPTEMBER 10, 2015 TRIANGLE MESHES 3D MESHES MESH OPERATIONS.
DPL3/9/2016 CS 551/651: Simplification Continued David Luebke
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.
南亚和印度.
A Multiphase Approach to Efficient Surface Simplification Michael Garland Eric Shaffer University of Illinois at Urbana–Champaign Michael Garland Eric.
Advanced Computer Graphics
CS Computer Graphics II
User-Guided Simplification
Using Coordinate Geometry to Prove Parallelograms
CS679 - Fall Copyright Univ. of Wisconsin
CS475 3D Game Development Level Of Detail Nodes (LOD)
Today Runtime LOD Spatial Data Structures Overview
Using Coordinate Geometry to Prove Parallelograms
Parallel Model Simplification of Very Large Polygonal Meshes
Subdivision and Simplification
Meshes.
AB AC AD AE AF 5 ways If you used AB, then, there would be 4 remaining ODD vertices (C, D, E and F) CD CE CF 3 ways If you used CD, then, there.
Chap 10. Geometric Level of Detail
Simplification of Articulated Mesh
Distance Formula d = √ (x1 – x2)2 + (y1 – y2)2, where d is the distance between the points (x1, y1) and (x2, y2).
Homework Solutions.
Presentation transcript:

Mesh Simplification

Plan Introduction Mesh Simplifications Current Techniques The Projet Results

Introduction  What’s a mesh? Vertices, edges, polygones Manifold (machine are able to make it) Non-manifold  Meshes usage Scientific imaging, movies, games…  Common problems Stocking, rendering, data transferts…

Plan Introduction Mesh Simplification Current Techniques The Project Results

Mesh Simplification  Idea Remove « negligeable » elements  Caracteristics Fidelity to original morphology Topology Re-exploitation

Plan Introduction Mesh Simplification Current Techniques The Project Results

Current Techniques  Decimation  Contraction  Clustering  Progressive Mesh  Statistics Wavelets, fractals,…

Decimation

Contraction

Clustering

Plan Introduction Mesh Simplification Current Techniques The Project Results

The Project (1)  Studies on current techniques Schroeder, Lorensen, Zarge Garland, Heckbert  Implementation C/C++ OpenGL GLUT, GLUI

The Project (2)  Bounds Triangulated meshes  Implemented triangulations methods Triangle Fan Triangle Strip  Optimal solution Delaunay’s Triangulation

Triangulation : Triangle Fan

Triangulation : Triangle Strip

The Project (3)  Method 1: Edge Contraction Edge Length Distance criteria Percentage How many vertices to remove? Cardinality ordering Stronger Weaker Goal : avoid « dumb » mesh browsing

Cardinalities, examples

The Project (4)  Method 2: QEM Quadric Error Metric One error value per vertex Create valid vertices pairs Compute the contraction cost Percentage How many vertices to remove?

The Project (5)  Method 2: QEM p = [a b c d] T, ax + by +cz +d = 0 Δ(v) = Σ p Є plans (v) (p T v) ² Δ(v) = Σ p Є plans (v) (v T p) (p T v) = Σ p Є plans (v) v T (pp T ) v = v T [ Σ p Є plans (v) Kp] v

The Project (6)  Méthode 2: QEM (suite) a² ab ac ad Kp = pp T = ab b² bc bd ac bc c² cd ad bd cd d² Q = Σ p Є plans (v) Kp

Plan Introduction Mesh Simplification Current Techniques The Project Results

ReductionTime(s) 10% % %1.051 « cow.obj » model (5804 faces) Method 1 ReductionTime(s) 10% % %3.825 « cow.obj » model (5804 faces) QEM

Plan Introduction Mesh Simplification Current Techniques The Project Results The

EOF ;)