Decimation Of Triangle Meshes

Slides:



Advertisements
Similar presentations
Fast Adaptive Hybrid Mesh Generation Based on Quad-tree Decomposition
Advertisements

 Over-all: Very good idea to use more than one source. Good motivation (use of graphics). Good use of simplified, loosely defined -- but intuitive --
Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September
© Fluent Inc. 4/16/ Introductory GAMBIT Notes GAMBIT v2.0 Jan 2002 Fluent User Services Center Edge and Face Meshing.
Mesh Control through Boundary Layers and Face Vertex Types
Memory-Efficient Sliding Window Progressive Meshes Pavlo Turchyn University of Jyvaskyla.
Developer’s Survey of Polygonal Simplification Algorithms Based on David Luebke’s IEEE CG&A survey paper.
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Visualization and graphics research group CIPIC Decimation of Triangle Meshes William J. Schroeder, Jonathan A. Zarge, William E. Lorensen Presented by.
Dual Marching Cubes: An Overview
Query Processing in Databases Dr. M. Gavrilova.  Introduction  I/O algorithms for large databases  Complex geometric operations in graphical querying.
High-Quality Simplification with Generalized Pair Contractions Pavel Borodin,* Stefan Gumhold, # Michael Guthe,* Reinhard Klein* *University of Bonn, Germany.
CS CS 175 – Week 4 Mesh Decimation General Framework, Progressive Meshes.
Mesh Simplification Global and Local Methods:
Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2004 Lecture 2 Chapter 2: Polygon Partitioning.
Seminar 1 Surface Rendering, Decimation Presented By Sonali Barua Date:10/31/2005.
Complex Model Construction Mortenson Chapter 11 Geometric Modeling
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
CS 450: Computer Graphics REVIEW: OVERVIEW OF POLYGONS
Visibility Graphs and Cell Decomposition By David Johnson.
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.
4/15/04© University of Wisconsin, CS559 Spring 2004 Last Time More modeling: –Hierarchical modeling –Instancing and Parametric Instancing –Constructive.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
Presented By Greg Gire Advised By Zoë Wood California Polytechnic State University.
Polygon Modelling. 3D Representation Wire frame NURBS surface Solid Voxel Mesh.
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
Computational Geometry Piyush Kumar (Lecture 10: Point Location) Welcome to CIS5930.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
1 Polygonal Techniques 이영건. 2 Introduction This chapter –Discuss a variety of problems that are encountered within polygonal data sets The.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.
Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.
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.
1 Multi-resolution Tetrahedral Meshes Leila De Floriani Department of Computer and Information Sciences University of Genova, Genova (Italy)
A New Voronoi-based Reconstruction Algorithm
Representation and modelling 3 – landscape specialisations 4.1 Introduction 4.2 Simple height field landscapes 4.3 Procedural modeling of landscapes- fractals.
Lee Byung-Gook Dongseo Univ.
Angle Relationships.
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
University of Texas at Austin CS384G - Computer Graphics Fall 2008 Don Fussell Subdivision surfaces.
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.
COMPUTER GRAPHICS CS 482 – FALL 2015 SEPTEMBER 10, 2015 TRIANGLE MESHES 3D MESHES MESH OPERATIONS.
DPL3/10/2016 CS 551/651: Simplification Continued David Luebke
Decimation of Triangle Meshes Paper by W.J.Schroeder et.al Presented by Guangfeng Ji.
Subdivision Schemes. Center for Graphics and Geometric Computing, Technion What is Subdivision?  Subdivision is a process in which a poly-line/mesh is.
Model Optimization Wed Nov 16th 2016 Garrett Morrison.

Chapter 4 Creating Placed Features
Edge and Face Meshing.
Advanced Computer Graphics
POLYGON MESH Advance Computer Graphics
CS Computer Graphics II
CS475 3D Game Development Level Of Detail Nodes (LOD)
Query Processing in Databases Dr. M. Gavrilova
Mesh Control through Boundary Layers and Face Vertex Types
The Variety of Subdivision Schemes
Computing Vertex Normals from Arbitrary Meshes
Semi-Automated Cleanup Tools
Triangulation of a polygon
Delaunay Triangulation & Application
Iso-Surface extraction from red and green samples on a regular lattice
Chap 10. Geometric Level of Detail
Advanced Computer Graphics: Teddy
Presentation transcript:

Decimation Of Triangle Meshes Avneesh Sud Special Topics in Computer Graphics

Advanced Topics in Graphics What Is Decimation ? Reduction in the number of triangles in a triangle mesh, maintaining the original topology, as well as its overall appearance determined by discrete and scalar attributes. Decimation Advanced Topics in Graphics

Advanced Topics in Graphics The Basic Mesh The Mesh is a collection of triangles in 3- space, given by ( V,T(V) ), where V is the list of vertices, and T(V) the list of triangle definitions Decimation Advanced Topics in Graphics

Requirements for a Good Decimation The original topology of the mesh must be preserved The decimated mesh must be a good approximation to the original Optional : Vertices of the decimated mesh be a subset of original set. This allows to preserve the appearance attributes Decimation Advanced Topics in Graphics

Advanced Topics in Graphics The algorithm Characterize the local vertex geometry and topology Evaluate decimation criteria Triangulate the resulting holes. Decimation Advanced Topics in Graphics

Characterizing Local Geometry Determines the vertices which are possible candidates for deletion. All vertices except complex vertices are candidates for deletion. Decimation Advanced Topics in Graphics

Characterizing Local Geometry Corner Edge Simple Boundary Complex Interior Edge Decimation Advanced Topics in Graphics

Evaluating Decimation Criteria Simple Vertices : Distance to average plane Decimation Advanced Topics in Graphics

Evaluating Decimation Criteria Boundary and Feature Edges : Distance to edge Decimation Advanced Topics in Graphics

Advanced Topics in Graphics Triangulation If a vertex is eliminated, the loop created by removing the vertex is re-triangulated. Every loop is star shaped : recursive loop splitting triangulation schemes are used. If a loop cannot be retriangulated, the vertex generating the loop is not removed. Decimation Advanced Topics in Graphics

Recursive Splitting Triangulation A split plane orthogonal to average plane is determined. If two loops do not overlap the split plane is acceptable Decimation Advanced Topics in Graphics

Recursive Splitting Triangulation Best splitting plane is determined using an aspect ratio Maximum aspect ratio gives best splitting plane Decimation Advanced Topics in Graphics

Advanced Topics in Graphics Special Cases Modification of topology of a closed structure Topological ‘holes’ in the mesh These are checked by triangulation to ensure duplicate triangles or edges are not created Decimation Advanced Topics in Graphics

Advanced Topics in Graphics Results Decimation Advanced Topics in Graphics

Advanced Topics in Graphics Results Decimation Advanced Topics in Graphics