ALGORITHMS FOR POLYGON REDUCTION Author: Ing. Roman Schulz FIT VUT, 2008.

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
Chapter 3 Designing a Newsletter
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.
Measuring Simplification Error Jonathan Cohen Computer Science Department Johns Hopkins University
Mesh Simplification. Plan Introduction Mesh Simplifications Current Techniques The Projet Results.
Visualization and graphics research group CIPIC Decimation of Triangle Meshes William J. Schroeder, Jonathan A. Zarge, William E. Lorensen Presented by.
UVA / UNC / JHU Perceptually Guided Simplification of Lit, Textured Meshes Nathaniel WilliamsUNC David LuebkeUVA Jonathan D. CohenJHU Michael KelleyUVA.
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.
Haptic Rendering using Simplification Comp259 Sung-Eui Yoon.
View-Dependent Refinement of Progressive Meshes Hugues Hoppe Microsoft Research SIGGRAPH 97.
EFFICIENT RENDERING LARGE TERRAINS USING MULTIRESOLUTION MODELLING AND IMAGE PROCESSING TECHNIQUES Ömer Nebil YAVEROĞLU Department of Computer Engineering.
1 Displaced Subdivision Surfaces Aaron Lee Princeton University Henry Moreton Nvidia Hugues Hoppe Microsoft Research.
Large Mesh Simplification using Processing Sequences Martin Isenburg UNC Chapel Hill Peter Lindstrom LLNL Livermore Stefan Gumhold GRIS Tubingen Jack Snoeyink.
Korea Game Society, 1~3 February 2005, Muju Simple and Fast Polygonal Simplification using IAMC, Kim Nam Woo Simple and Fast Polygonal Simplification using.
Simplification of Arbitrary Polyhedral Meshes Shaun D. Ramsey* Martin Bertram Charles Hansen University of Utah University of Kaiserslautern University.
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.
CS6500 Adv. Computer Graphics © Chun-Fa Chang, Spring 2003 Acceleration of Rendering.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Dynamic View-Dependent Simplification for Polygonal.
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.
Advanced Computer Graphics (Spring 2005) COMS 4162, Lecture 10: Mesh simplification Ravi Ramamoorthi Many slides courtesy.
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.
Dynamic Meshing Using Adaptively Sampled Distance Fields
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.
DPL10/16/2015 CS 551/651: Simplification Continued David Luebke
Level of Detail: Choosing and Generating LODs David Luebke University of Virginia.
Surface Simplification Using Quadric Error Metrics Garland & Heckbert Siggraph 97.
Triangular Mesh Decimation
MIRALab Where Research means Creativity SVG Open 2005 University of Geneva 1 Converting 3D Facial Animation with Gouraud shaded SVG A method.
Simplifying Surfaces with Color and Texture using Quadric Error Metrics Michael Garland Paul S. Heckbert Carnegie Mellon University October 1998 Michael.
Polygonal Simplification Techniques
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.
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 8 Ravi Ramamoorthi
Level of Detail Management for Games David Luebke University of Virginia Introduction, Overview.
Daniele D’Agostino CNR - IMATI - Sezione di Genova
Hierarchical Error-Driven Approximation of Implicit Surfaces from Polygonal Meshes Takashi Kanai Yutaka Ohtake Kiwamu Kase University of Tokyo RIKEN, VCAD.
All the Polygons You Can Eat
CS418 Computer Graphics John C. Hart
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 7 Ravi Ramamoorthi
PMR: Point to Mesh Rendering, A Feature-Based Approach Tamal K. Dey and James Hudson
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 9 Ravi Ramamoorthi
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)
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.
3-D Mesh Morphing By Newton Der.
A Multiphase Approach to Efficient Surface Simplification Michael Garland Eric Shaffer University of Illinois at Urbana–Champaign Michael Garland Eric.
Advanced Computer Graphics
CS 551 / 645: Introductory Computer Graphics
CS Computer Graphics II
User-Guided Simplification
CS475 3D Game Development Level Of Detail Nodes (LOD)
Parallel Model Simplification of Very Large Polygonal Meshes
Chapter III Modeling.
Chang-Hun Kim Department of Computer Science Korea University
Chap 10. Geometric Level of Detail
Presentation transcript:

ALGORITHMS FOR POLYGON REDUCTION Author: Ing. Roman Schulz FIT VUT, 2008

Purpose of work It is not possible to display all models in scene in full detail, because their rendering takes too much gpu time. Detail view requires a quality model Far objects may use much lower level of detail It is expensive to create objects with lower detail by hand

Object simplification Simplified object may create Graphic designer – hard work, he may to do more important and interesting work. Advantage of such simplification is that only a graphic designer knows, which parts of object are important and needs more detail. Independent application – It is necessary to select only an algorithm and a quality, and then verify a simplified object. It is also possible to simplify many models by script to save time and money.

Selecting of edge to remove Simplification is done by removing of edges, which are at least important Selection of that edge is done by used metric size of edge – Importance of each edge is done by its length. This metric is very fast. error quadrics – fast and good quality edge andles – Metric was described in Game Developer's Magazine – It is quite slow, but perfect quality progressive meshes

Edge remove Select at least important edge and remove it. It also removes two triangles adjacent with edge and one point. Process of removing edge uv – Remove all triangles which contains both points u and v (ie. edge uv )‏ – Update all other triangles which contains point u to use point v instead of point u – Remove point u

Quality of metrics We have done thousands of tests on various 3d models Quadric error metrics produces the best results But it is possible to try all metrics and select the highest quality model

Application structure Modular design makes it possible to include any block into existing project (program or game). It is also possible to add new file format support One of most important features is 3ds file format support, which is commonly used for 3d file exchange

Program control Settings of all features is done by command line parameters. This way is useful for batch processing of many models at a time by script../reducer.exe -i - Input file -o - Output file -q - quality settings a - algorithm settings -b – Preserve borders of object -j – Preserve borders between materials...and others(see parameter --help)‏

Example – Reduction of object with polygons to 50%, 25% and 10% of original size

References [1] David Luebke, Martin Reddy, Jonathan Cohen. Level of Detail for 3D Graphics. Morgan Kaufmann Publishers, 2003 [2] Stan Melax. A Simple, Fast and Effective Polygon Reduction Algorithm. Game Developer Magazine, November 1998 [3] P. Lindstrom, G. Turk. Fast and memory efficient polygonal simplification. IEEE Visualization 98 Conference Proceedings, [4] M. Garland, P. Heckbert. Surface simplification using quadric error metrics. SIGGRAPH 97 Conference Proceedings, 1997 [5] William Schroeder, Jonathan Zarge, William Lorensen. Decimation of triangle meshes. SIGGRAPH 92 Conference Proceedings, 1992 [6] Hugues Hoppe, Tony DeRose. Mesh Optimization. Proceedings of SIGGRAPH

Questions?