Visualization and graphics research group CIPIC Decimation of Triangle Meshes William J. Schroeder, Jonathan A. Zarge, William E. Lorensen Presented by.

Slides:



Advertisements
Similar presentations
Day 7.
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.
Efficient access to TIN Regular square grid TIN Efficient access to TIN Let q := (x, y) be a point. We want to estimate an elevation at a point q: 1. should.
Mesh Control through Boundary Layers and Face Vertex Types
Developer’s Survey of Polygonal Simplification Algorithms Based on David Luebke’s IEEE CG&A survey paper.
Mr. Schaab’s Geometry Class Our Lady of Providence Jr.-Sr. High School
Mesh Simplification. Plan Introduction Mesh Simplifications Current Techniques The Projet Results.
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:
Polygonal Mesh – Data Structure and Smoothing
Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.
Polygonal Meshes 3D Object Representation -Tyler Abrams.
CS CS 175 – Week 5 Mesh Decimation Fairness Criteria.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Dynamic View-Dependent Simplification for Polygonal.
Seminar 1 Surface Rendering, Decimation Presented By Sonali Barua Date:10/31/2005.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
©A. Weinberg By Ms. Weinberg SOL ©A. Weinberg Let’s learn a bit about Geometry! Geometry is a part of Math that focuses on shapes and lines. Shapes.
You have used coordinate geometry to find the midpoint of a line segment and to find the distance between two points. Coordinate geometry can also be used.
Warm Up Evaluate. 1. Find the midpoint between (0, 2x) and (2y, 2z).
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.
J.Byrne Geometry involves the study of angles, points, lines, surfaces & solids An angle is formed by the intersection of two straight lines. This.
Chapter 4 Creating Placed Features
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.
5 CM 4 CM Calculation Area = Length times Width (lw or l x W) Note Length of a rectangle is always the longest side.
Progressive Meshes with Controlled Topology Modification University of Bonn Institute II. for Computer Science Computer Graphics Group Pavcl Borodin Rchinhard.
Angle Relationships Section 1-5 Adjacent angles Angles in the same plane that have a common vertex and a common side, but no common interior points.
DPL10/16/2015 CS 551/651: Simplification Continued David Luebke
SKM 4200 Computer Animation Chapter 4: Animation (3D Computer Animation – Part 1)
Triangular Mesh Decimation
CAP4730: Computational Structures in Computer Graphics
Computer Graphics Basic 3D Geometry CO2409 Computer Graphics Week 5-1.
Chapter 1 Exploring Geometry: Points, Lines, and Angles in the Plane
Conceptual Geometry Exam Review. Round 1 PolygonsVocabularyAnglesTriangles $100 $200 $300.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.
Today we will be learning: to sort 2-D shapes into groups. to recognise and describe 2-D shapes.
Abney V. Martinez. Tell which shapes are polygons.  A polygon is a closed plane figure made up of line segments.  Each line segment is a side.  The.
Angle Relationships.
ALGORITHMS FOR POLYGON REDUCTION Author: Ing. Roman Schulz FIT VUT, 2008.
Parallel and Perpendicular Lines UNIT 2 REVIEW GEOMETRY.
Geometry Notes. The Language of Geometry Point: A point is a specific location in space but the point has no size or shape Line: a collection of points.
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
DPL3/10/2016 CS 551/651: Simplification Continued David Luebke
Pairs of Angles Geometry Farris O I can identify adjacent, vertical, complementary, and supplementary angles. I can find measures of pairs of angles.
Possible Art Gallery Polygonal Closed CurveSay what?  Any figure that is made up of straight line pieces that are connected end to end to form a loop.
Decimation of Triangle Meshes Paper by W.J.Schroeder et.al Presented by Guangfeng Ji.
Midpoint and Distance in the Coordinate Plane
Chapter 4 Creating Placed Features
Edge and Face Meshing.
Geometry 1 J.Byrne 2017.
Decimation Of Triangle Meshes
5.8 Vocabulary coordinate proof
CS Computer Graphics II
Geometry Symbols The angle with vertex B and having points A
Properties of Geometric Shapes
Mesh Control through Boundary Layers and Face Vertex Types
Parallel Model Simplification of Very Large Polygonal Meshes
R F Z D W X C E Y M S V N G T I A L H Q P J O U
Angle Relationships.
Semi-Automated Cleanup Tools
Delaunay Triangulation & Application
Chapter 7 – Special Right Triangles Review
Exploring Angles and Angle Relationships
Chap 10. Geometric Level of Detail
4.1 – Apply triangle sum properties
Presentation transcript:

visualization and graphics research group CIPIC Decimation of Triangle Meshes William J. Schroeder, Jonathan A. Zarge, William E. Lorensen Presented by Alden Chew Serban Porumbescu

visualization and graphics research group CIPIC What is the Problem? Want to visualize data interactively Too many triangles Too little hardware

visualization and graphics research group CIPIC High Level Approach Characterize the local vertex geometry and topology Evaluate decimation criteria for vertex removal Triangulate the resulting hole

visualization and graphics research group CIPIC Vertex Classification Feature edge: dihedral angle greater than user specified feature angle An interior edge vertex is a vertex with two feature edges A corner has one, three, or more feature edges

visualization and graphics research group CIPIC Vertex Removal Based on user specified distance to plane or distance to edge (boundary vertex)

visualization and graphics research group CIPIC Vertex Removal Removal of vertex creates a hole in the mesh –Triangulate Removal of feature edge: –Create a new feature edge –If two non-overlapping loops can be created, triangulate the two loops

visualization and graphics research group CIPIC Triangulate Resulting Hole Triangulate using a recursive loop splitting procedure The stencil of the hole is called a loop Loops are divided into two parts by a split line Split line –A line between two non-adjacent vertices in the loop

visualization and graphics research group CIPIC Split Plane Split plane –The plane orthogonal to the average plane through a split line Used for half space comparisons

visualization and graphics research group CIPIC Loop Splitting Procedure Need to create two non-overlapping loops A valid loop is entirely on one side of the split plane …. If the loop contain more than three vertices, recurse If the loop has three vertices, form a triangle

visualization and graphics research group CIPIC Split Line Selection Many split lines to choose from Choose line that maximizes the aspect ratio The aspect ratio is the minimum distance of the loop vertices to the split plane divided by the length of the split line

visualization and graphics research group CIPIC Special Cases Want to preserve topology Don’t create duplicate triangles and triangle edges

visualization and graphics research group CIPIC Sample Run From VTK (US Patent Number 5,559,388)

visualization and graphics research group CIPIC Skull

visualization and graphics research group CIPIC Blade

visualization and graphics research group CIPIC Hawaii

visualization and graphics research group CIPIC Mars