Appearance Preservation

Size: px
Start display at page:

Download "Appearance Preservation"

Transcription

1 CS 283 Advanced Computer Graphics Mesh Simplification James F. O Brien Professor U.C. Berkeley Based on slides by Ravi Ramamoorthi 1 Appearance Preservation Caltech & Stanford Graphics Labs and Jonathan Cohen 2

2 Mesh Decimation Basic simplification operation is edge collapse 3 Mesh Decimation Basic simplification operation is edge collapse 4

3 Edge Collapse A A X v1 v v0 Create new vertex v (based on appropriate rule) Find all faces/edges neighbor vertex v1 (such as A) Change them to use v instead of v1. Do the same for v0 Depend on data structure, you need to fix all faces, edges 5 Edge Collapse A A X v1 v v0 Create new vertex v based on appropriate rule like average Find all faces that neighbor vertex v1 (such as A) Simple use of vertex to face adjacency Change them to use v instead of v1. Do the same for v0 6

4 Edge Collapse A A X v1 v v0 Find faces neighboring edge v0-v1 (such as X) Remove from mesh This may involve updating face/vertex adjacency relationships etc. e.g. what is adjacency for v (faces adjacent to vertex?) Are other vertices affected in terms of adjacent faces? Worry about triangle fins 7 Progressive Meshes Write edge collapses to file Read in file and invert order Key idea is vertex-split (opposite of edge-collapse) Include some control to make model coarser/finer e.g. Hoppe geomorph demo 8

5 Progressive Meshes Hoppe 9 Progressive Meshes Hoppe 10

6 Geomorph Demo Hoppe 11 Reverse of Edge Collapse 12

7 View-Dependent Simplification Simplify dynamically according to viewpoint Visibility Silhouettes Lighting Hoppe 13 Quadric Error Metrics Garland & Heckbert, SIGGRAPH 97 Greedy decimation algorithm Pair collapse (allow edge + non-edge collapses) Quadric error metrics: Evaluate potential collapses Determine optimal new vertex locations 14

8 Background: Computing Planes Each triangle in mesh has associated plane ax by cz d 0 For a triangle, find its (normalized) normal using cross products ABAC n nv An 0 ABAC Plane equation?? a n b d An c 15 Quadric Error Metrics Based on point-to-plane distance Better quality than point-to-point d c d a d b a b c 16

9 Quadric Error Metrics Quadric Error Metrics v p Dist ( vp, ) Dist ( vp, ) ax by cz d p v 2 x a y b v, z p c 1 d T p v 17 Quadric Error Metrics p p ( pv ) T vqv T 2 T T vppv T T v pp v p vqv vppv Common mathematical trick: quadratic form = symmetric matrix Q multiplied twice by a vector Initially, distance to all planes 0, net is 0 for all vertices 18

10 Using Quadrics Approximate error of edge collapses Each vertex v has associated quadric dric Q Q Error of collapsing v1 and v2 to v is s v T Q 1 v +v T Q 2 v Quadric for new vertex v is Q =Q1+Q2 +Q 19 Using Quadrics Find optimal location v after collapse: q q q q q q q q Q ' q q q q q q q q min v' Q' v' : T min v' Q' v' : 0 v ' x y z 20

11 Using Quadrics Find optimal location v after collapse: q q q q q 12 q22 q23 q 24 0 v ' q13 q23 q33 q q 11 q12 q13 q 14 0 q 12 q22 q23 q 24 0 v ' q13 q23 q33 q Quadric Visualization Ellipsoids: iso-error surfaces Smaller ellipsoid = greater error for a given motion Lower error for motion parallel to surface Lower error in flat regions than at corners Elongated in cylindrical regions 22

12 Surface Simplification Efficiency (70000 to 100 faces in 15s in 1997) High quality, feature preserving (primary appearance emphasized rather than topology) Generality, non-manifold models, collapse disjoint regions 23 Simplification Pair contractions in addition to edge collapses Previously connected regions may come together 24

13 Algorithm Outline Use quadric error 25 Final Algorithm 26

14 Results Original Quadrics 1k tris 100 tris 27 Results Original Quadrics 250 tris 250 tris, edge collapses only 28

15 Additional Details Preserving boundaries/discontinuities (weight quadrics by appropriate penalty factors) Preventing mesh inversion (flipping of orientation): compare normal of neighboring faces, before after Has been modified for many other applications e.g. in silhouettes, want to make sure volume always increases, never decreases Take color and texture into account (followup paper) See paper, other more recent works for details 29

Mesh Simplification. Mesh Simplification. Mesh Simplification Goals. Mesh Simplification Motivation. Vertex Clustering. Mesh Simplification Overview

Mesh Simplification. Mesh Simplification. Mesh Simplification Goals. Mesh Simplification Motivation. Vertex Clustering. Mesh Simplification Overview Mesh Simplification Mesh Simplification Adam Finkelstein Princeton University COS 56, Fall 008 Slides from: Funkhouser Division, Viewpoint, Cohen Mesh Simplification Motivation Interactive visualization

More information

To Do. Resources. Algorithm Outline. Simplifications. Advanced Computer Graphics (Spring 2013) Surface Simplification: Goals (Garland)

To Do. Resources. Algorithm Outline. Simplifications. Advanced Computer Graphics (Spring 2013) Surface Simplification: Goals (Garland) Advanced omputer Graphics (Spring 213) S 283, Lecture 6: Quadric Error Metrics Ravi Ramamoorthi To Do Assignment 1, Due Feb 22. Should have made some serious progress by end of week This lecture reviews

More information

CGAL. Mesh Simplification. (Slides from Tom Funkhouser, Adam Finkelstein)

CGAL. Mesh Simplification. (Slides from Tom Funkhouser, Adam Finkelstein) CGAL Mesh Simplification (Slides from Tom Funkhouser, Adam Finkelstein) Siddhartha Chaudhuri http://www.cse.iitb.ac.in/~cs749 In a nutshell Problem: Meshes have too many polygons for storage, rendering,

More information

Applications. Oversampled 3D scan data. ~150k triangles ~80k triangles

Applications. Oversampled 3D scan data. ~150k triangles ~80k triangles Mesh Simplification Applications Oversampled 3D scan data ~150k triangles ~80k triangles 2 Applications Overtessellation: E.g. iso-surface extraction 3 Applications Multi-resolution hierarchies for efficient

More information

CS 283: Assignment 1 Geometric Modeling and Mesh Simplification

CS 283: Assignment 1 Geometric Modeling and Mesh Simplification CS 283: Assignment 1 Geometric Modeling and Mesh Simplification Ravi Ramamoorthi 1 Introduction This assignment is about triangle meshes as a tool for geometric modeling. As the complexity of models becomes

More information

Surface Simplification Using Quadric Error Metrics

Surface Simplification Using Quadric Error Metrics Surface Simplification Using Quadric Error Metrics Authors: Michael Garland & Paul Heckbert Presented by: Niu Xiaozhen Disclaimer: Some slides are modified from original slides, which were designed by

More information

To Do. Assignment Overview. Outline. Mesh Viewer (3.1) Mesh Connectivity (3.2) Advanced Computer Graphics (Spring 2013)

To Do. Assignment Overview. Outline. Mesh Viewer (3.1) Mesh Connectivity (3.2) Advanced Computer Graphics (Spring 2013) daned Computer Graphis (Spring 23) CS 283, Leture 5: Mesh Simplifiation Rai Ramamoorthi http://inst.ees.berkeley.edu/~s283/sp3 To Do ssignment, Due Feb 22 Start reading and working on it now. This leture

More information

Mesh Decimation. Mark Pauly

Mesh Decimation. Mark Pauly Mesh Decimation Mark Pauly Applications Oversampled 3D scan data ~150k triangles ~80k triangles Mark Pauly - ETH Zurich 280 Applications Overtessellation: E.g. iso-surface extraction Mark Pauly - ETH Zurich

More information

CSE 163: Assignment 2 Geometric Modeling and Mesh Simplification

CSE 163: Assignment 2 Geometric Modeling and Mesh Simplification CSE 163: Assignment 2 Geometric Modeling and Mesh Simplification Ravi Ramamoorthi 1 Introduction This assignment is about triangle meshes as a tool for geometric modeling. As the complexity of models becomes

More information

Geometric Modeling. Mesh Decimation. Mesh Decimation. Applications. Copyright 2010 Gotsman, Pauly Page 1. Oversampled 3D scan data

Geometric Modeling. Mesh Decimation. Mesh Decimation. Applications. Copyright 2010 Gotsman, Pauly Page 1. Oversampled 3D scan data Applications Oversampled 3D scan data ~150k triangles ~80k triangles 2 Copyright 2010 Gotsman, Pauly Page 1 Applications Overtessellation: E.g. iso-surface extraction 3 Applications Multi-resolution hierarchies

More information

Geometric Features for Non-photorealistiic Rendering

Geometric Features for Non-photorealistiic Rendering CS348a: Computer Graphics Handout # 6 Geometric Modeling and Processing Stanford University Monday, 27 February 2017 Homework #4: Due Date: Mesh simplification and expressive rendering [95 points] Wednesday,

More information

Mesh Repairing and Simplification. Gianpaolo Palma

Mesh Repairing and Simplification. Gianpaolo Palma Mesh Repairing and Simplification Gianpaolo Palma Mesh Repairing Removal of artifacts from geometric model such that it becomes suitable for further processing Input: a generic 3D model Output: (hopefully)a

More information

Mesh and Mesh Simplification

Mesh and Mesh Simplification Slide Credit: Mirela Ben-Chen Mesh and Mesh Simplification Qixing Huang Mar. 21 st 2018 Mesh DataStructures Data Structures What should bestored? Geometry: 3D coordinates Attributes e.g. normal, color,

More information

Mesh Decimation Using VTK

Mesh Decimation Using VTK Mesh Decimation Using VTK Michael Knapp knapp@cg.tuwien.ac.at Institute of Computer Graphics and Algorithms Vienna University of Technology Abstract This paper describes general mesh decimation methods

More information

Geometry Processing & Geometric Queries. Computer Graphics CMU /15-662

Geometry Processing & Geometric Queries. Computer Graphics CMU /15-662 Geometry Processing & Geometric Queries Computer Graphics CMU 15-462/15-662 Last time: Meshes & Manifolds Mathematical description of geometry - simplifying assumption: manifold - for polygon meshes: fans,

More information

CSE 554 Lecture 6: Fairing and Simplification

CSE 554 Lecture 6: Fairing and Simplification CSE 554 Lecture 6: Fairing and Simplification Fall 2012 CSE554 Fairing and simplification Slide 1 Review Iso-contours in grayscale images and volumes Piece-wise linear representations Polylines (2D) and

More information

As a consequence of the operation, there are new incidences between edges and triangles that did not exist in K; see Figure II.9.

As a consequence of the operation, there are new incidences between edges and triangles that did not exist in K; see Figure II.9. II.4 Surface Simplification 37 II.4 Surface Simplification In applications it is often necessary to simplify the data or its representation. One reason is measurement noise, which we would like to eliminate,

More information

Adjacency Data Structures

Adjacency Data Structures Last Time? Simple Transformations Adjacency Data Structures material from Justin Legakis Classes of Transformations Representation homogeneous coordinates Composition not commutative Orthographic & Perspective

More information

All the Polygons You Can Eat. Doug Rogers Developer Relations

All the Polygons You Can Eat. Doug Rogers Developer Relations All the Polygons You Can Eat Doug Rogers Developer Relations doug@nvidia.com Future of Games Very high resolution models 20,000 triangles per model Lots of them Complex Lighting Equations Floating point

More information

A Comparison of Mesh Simplification Algorithms

A Comparison of Mesh Simplification Algorithms A Comparison of Mesh Simplification Algorithms Nicole Ortega Project Summary, Group 16 Browser Based Constructive Solid Geometry for Anatomical Models - Orthotics for cerebral palsy patients - Fusiform

More information

A Developer s Survey of Polygonal Simplification algorithms. CS 563 Advanced Topics in Computer Graphics Fan Wu Mar. 31, 2005

A Developer s Survey of Polygonal Simplification algorithms. CS 563 Advanced Topics in Computer Graphics Fan Wu Mar. 31, 2005 A Developer s Survey of Polygonal Simplification algorithms CS 563 Advanced Topics in Computer Graphics Fan Wu Mar. 31, 2005 Some questions to ask Why simplification? What are my models like? What matters

More information

Progressive Mesh. Reddy Sambavaram Insomniac Games

Progressive Mesh. Reddy Sambavaram Insomniac Games Progressive Mesh Reddy Sambavaram Insomniac Games LOD Schemes Artist made LODs (time consuming, old but effective way) ViewDependentMesh (usually used for very large complicated meshes. CAD apps. Probably

More information

Efficient Minimization of New Quadric Metric for Simplifying Meshes with Appearance Attributes

Efficient Minimization of New Quadric Metric for Simplifying Meshes with Appearance Attributes Efficient Minimization of New Quadric Metric for Simplifying Meshes with Appearance Attributes (Addendum to IEEE Visualization 1999 paper) Hugues Hoppe Steve Marschner June 2000 Technical Report MSR-TR-2000-64

More information

and Recent Extensions Progressive Meshes Progressive Meshes Multiresolution Surface Modeling Multiresolution Surface Modeling Hugues Hoppe

and Recent Extensions Progressive Meshes Progressive Meshes Multiresolution Surface Modeling Multiresolution Surface Modeling Hugues Hoppe Progressive Meshes Progressive Meshes and Recent Extensions Hugues Hoppe Microsoft Research SIGGRAPH 97 Course SIGGRAPH 97 Course Multiresolution Surface Modeling Multiresolution Surface Modeling Meshes

More information

Geometry: 3D coordinates Attributes. e.g. normal, color, texture coordinate. Connectivity

Geometry: 3D coordinates Attributes. e.g. normal, color, texture coordinate. Connectivity Mesh Data Structures res Data Structures What should be stored? Geometry: 3D coordinates Attributes eg normal, color, texture coordinate Per vertex, per face, per edge Connectivity Adjacency relationships

More information

Geometric Modeling. Bing-Yu Chen National Taiwan University The University of Tokyo

Geometric Modeling. Bing-Yu Chen National Taiwan University The University of Tokyo Geometric Modeling Bing-Yu Chen National Taiwan University The University of Tokyo Surface Simplification Motivation Basic Idea of LOD Discrete LOD Continuous LOD Simplification Problem Characteristics

More information

Level Set Extraction from Gridded 2D and 3D Data

Level Set Extraction from Gridded 2D and 3D Data Level Set Extraction from Gridded 2D and 3D Data David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International

More information

Simplification. Stolen from various places

Simplification. Stolen from various places Simplification Stolen from various places The Problem of Detail Graphics systems are awash in model data: highly detailed CAD models high-precision surface scans surface reconstruction algorithms Available

More information

Digital Geometry Processing. Computer Graphics CMU /15-662

Digital Geometry Processing. Computer Graphics CMU /15-662 Digital Geometry Processing Computer Graphics CMU 15-462/15-662 Last time: Meshes & Manifolds Mathematical description of geometry - simplifying assumption: manifold - for polygon meshes: fans, not fins

More information

Curves & Surfaces. Last Time? Progressive Meshes. Selective Refinement. Adjacency Data Structures. Mesh Simplification. Mesh Simplification

Curves & Surfaces. Last Time? Progressive Meshes. Selective Refinement. Adjacency Data Structures. Mesh Simplification. Mesh Simplification Last Time? Adjacency Data Structures Curves & Surfaces Geometric & topologic information Dynamic allocation Efficiency of access Mesh Simplification edge collapse/vertex split geomorphs progressive transmission

More information

Surface Simplification Using Quadric Error Metrics

Surface Simplification Using Quadric Error Metrics Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert Carnegie Mellon University Abstract Many applications in computer graphics require complex, highly detailed models. However,

More information

Fast Stellar Mesh Simplification

Fast Stellar Mesh Simplification Fast Stellar Mesh Simplification ANTÔNIO W. VIEIRA 1,2, LUIZ VELHO 3, HÉLIO LOPES 1, GEOVAN TAVARES 1 AND THOMAS LEWINER 1,4 1 PUC Rio Laboratório Matmídia Rio de Janeiro 2 UNIMONTES CCET Montes Claros

More information

Triangle meshes 2. CS 4620 Lecture Steve Marschner. Cornell CS4620 Fall 2018 Lecture 3

Triangle meshes 2. CS 4620 Lecture Steve Marschner. Cornell CS4620 Fall 2018 Lecture 3 Triangle meshes 2 CS 4620 Lecture 3 2018 Steve Marschner 1 Practical encoding of meshes OBJ file format widely used format for polygon meshes supports the usual attributes: position, normal, texture coordinate

More information

Mesh Representations & Geometry Processing

Mesh Representations & Geometry Processing Lecture 10/11: Mesh Representations & Geometry Processing Computer Graphics and Imaging UC Berkeley A Small Triangle Mesh 8 vertices, 12 triangles A Large Triangle Mesh David Digital Michelangelo Project

More information

3/1/2010. Acceleration Techniques V1.2. Goals. Overview. Based on slides from Celine Loscos (v1.0)

3/1/2010. Acceleration Techniques V1.2. Goals. Overview. Based on slides from Celine Loscos (v1.0) Acceleration Techniques V1.2 Anthony Steed Based on slides from Celine Loscos (v1.0) Goals Although processor can now deal with many polygons (millions), the size of the models for application keeps on

More information

A Short Survey of Mesh Simplification Algorithms

A Short Survey of Mesh Simplification Algorithms A Short Survey of Mesh Simplification Algorithms Jerry O. Talton III University of Illinois at Urbana-Champaign 1. INTRODUCTION The problem of approximating a given input mesh with a less complex but geometrically

More information

Half-edge Collapse Simplification Algorithm Based on Angle Feature

Half-edge Collapse Simplification Algorithm Based on Angle Feature International Conference on Automation, Mechanical Control and Computational Engineering (AMCCE 2015) Half-edge Collapse Simplification Algorithm Based on Angle Feature 1,2 JunFeng Li, 2 YongBo Chen, 3

More information

Mesh Simplification Method Using Principal Curvatures and Directions

Mesh Simplification Method Using Principal Curvatures and Directions Copyright 2011 Tech Science Press CMES, vol.77, no.4, pp.201-219, 2011 Mesh Simplification Method Using Principal Curvatures and Directions V. Ungvichian 1 and P. Kanongchaiyos 1 Abstract: This paper describes

More information

Research Article Quadratic Error Metric Mesh Simplification Algorithm Based on Discrete Curvature

Research Article Quadratic Error Metric Mesh Simplification Algorithm Based on Discrete Curvature Mathematical Problems in Engineering Volume 2015, Article ID 428917, 7 pages http://dx.doi.org/10.1155/2015/428917 Research Article Quadratic Error Metric Mesh Simplification Algorithm Based on Discrete

More information

Simplification of Meshes into Curved PN Triangles

Simplification of Meshes into Curved PN Triangles Simplification of Meshes into Curved PN Triangles Xiaoqun Wu, Jianmin Zheng, Xunnian Yang, Yiyu Cai Nanyang Technological University, Singapore Email: {wuxi0006,asjmzheng,xnyang,myycai}@ntu.edu.sg Abstract

More information

Interpolating and Approximating Implicit Surfaces from Polygon Soup

Interpolating and Approximating Implicit Surfaces from Polygon Soup Interpolating and Approimating Implicit Surfaces from Polygon Soup Chen Shen, James F. O Brien, Jonathan R. Shewchuk University of California, Berkeley Geometric Algorithms Seminar CS 468 Fall 2005 Overview

More information

CS 563 Advanced Topics in Computer Graphics Polygonal Techniques. by Linna Ma

CS 563 Advanced Topics in Computer Graphics Polygonal Techniques. by Linna Ma CS 563 Advanced Topics in Computer Graphics Polygonal Techniques by Linna Ma What I ll Talk About Introduction Tessellation and Triangulation Consolidation Triangle Strips, Fans and Meshes Simplification

More information

INSTANCE-AWARE SIMPLIFICATION OF 3D POLYGONAL MESHES

INSTANCE-AWARE SIMPLIFICATION OF 3D POLYGONAL MESHES INSTANCE-AWARE SIMPLIFICATION OF 3D POLYGONAL MESHES Tahir Azim Ewen Cheslack-Postava Philip Levis Stanford University, Stanford, CA, USA NUST-SEECS, Islamabad, Pakistan {tazim, ewencp, pal}@cs.stanford.edu

More information

Simulation in Computer Graphics. Deformable Objects. Matthias Teschner. Computer Science Department University of Freiburg

Simulation in Computer Graphics. Deformable Objects. Matthias Teschner. Computer Science Department University of Freiburg Simulation in Computer Graphics Deformable Objects Matthias Teschner Computer Science Department University of Freiburg Outline introduction forces performance collision handling visualization University

More information

Shape from LIDAR Data. Univ. of Florida

Shape from LIDAR Data. Univ. of Florida Shape from LIDAR Data Yusuf Sahillioğlu Alper Üngör Univ. of Florida 1. Introduction LIght Detection And Ranging systems, LIDAR, are capable of acquiring data to produce accurate digital elevation models

More information

Advanced Computer Graphics

Advanced Computer Graphics Advanced Computer Graphics Lecture 2: Modeling (1): Polygon Meshes Bernhard Jung TU-BAF, Summer 2007 Overview Computer Graphics Icon: Utah teapot Polygon Meshes Subdivision Polygon Mesh Optimization high-level:

More information

Segmentation & Constraints

Segmentation & Constraints Siggraph Course Mesh Parameterization Theory and Practice Segmentation & Constraints Segmentation Necessary for closed and high genus meshes Reduce parametric distortion Chartification Texture Atlas Segmentation

More information

Simple Silhouettes for Complex Surfaces

Simple Silhouettes for Complex Surfaces Eurographics Symposium on Geometry Processing(2003) L. Kobbelt, P. Schröder, H. Hoppe (Editors) Simple Silhouettes for Complex Surfaces D. Kirsanov, P. V. Sander, and S. J. Gortler Harvard University Abstract

More information

Subdivision overview

Subdivision overview Subdivision overview CS4620 Lecture 16 2018 Steve Marschner 1 Introduction: corner cutting Piecewise linear curve too jagged for you? Lop off the corners! results in a curve with twice as many corners

More information

Processing 3D Surface Data

Processing 3D Surface Data Processing 3D Surface Data Computer Animation and Visualisation Lecture 12 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing

More information

Efficient Representation and Extraction of 2-Manifold Isosurfaces Using kd-trees

Efficient Representation and Extraction of 2-Manifold Isosurfaces Using kd-trees Efficient Representation and Extraction of 2-Manifold Isosurfaces Using kd-trees Alexander Greß and Reinhard Klein University of Bonn Institute of Computer Science II Römerstraße 164, 53117 Bonn, Germany

More information

Enhanced Qslim for 3D city model compression and rendering

Enhanced Qslim for 3D city model compression and rendering University of California, Berkeley, Spring 2006: EE 225B Enhanced Qslim for 3D city model compression and rering Mary Knox, Min Ding and Sergey Timofeev May 14, 2006 University of California, Berkeley

More information

Translations, Reflections, and Rotations

Translations, Reflections, and Rotations * Translations, Reflections, and Rotations Vocabulary Transformation- changes the position or orientation of a figure. Image- the resulting figure after a transformation. Preimage- the original figure.

More information

Feature Preserving Mesh Simplification Using Feature Sensitive Metric

Feature Preserving Mesh Simplification Using Feature Sensitive Metric Wei J, Lou Y. Feature preserving mesh simplification using feature sensitive metric. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 25(3): 595 605 May 2010 Feature Preserving Mesh Simplification Using Feature

More information

Geometric Modeling and Processing

Geometric Modeling and Processing Geometric Modeling and Processing Tutorial of 3DIM&PVT 2011 (Hangzhou, China) May 16, 2011 6. Mesh Simplification Problems High resolution meshes becoming increasingly available 3D active scanners Computer

More information

MESH DECIMATION. A Major Qualifying Project Report: submitted to the Faculty. of the WORCESTER POLYTECHNIC INSTITUTE

MESH DECIMATION. A Major Qualifying Project Report: submitted to the Faculty. of the WORCESTER POLYTECHNIC INSTITUTE Project Number: MOW-2733 MESH DECIMATION A Major Qualifying Project Report: submitted to the Faculty of the WORCESTER POLYTECHNIC INSTITUTE in partial fulfillment of the requirements for the Degree of

More information

An Algorithm of 3D Mesh Reconstructing Based on the Rendering Pipeline

An Algorithm of 3D Mesh Reconstructing Based on the Rendering Pipeline 3rd International Conference on Mechatronics and Information Technology (ICMIT 2016) An Algorithm of 3D Mesh Reconstructing Based on the Rendering Pipeline Zhengjie Deng1, a, Shuqian He1,b, Chun Shi1,c,

More information

Deformation Sensitive Decimation

Deformation Sensitive Decimation Deformation Sensitive Decimation Alex Mohr Michael Gleicher University of Wisconsin, Madison Abstract In computer graphics, many automatic methods for simplifying polygonal meshes have been developed.

More information

04 - Normal Estimation, Curves

04 - Normal Estimation, Curves 04 - Normal Estimation, Curves Acknowledgements: Olga Sorkine-Hornung Normal Estimation Implicit Surface Reconstruction Implicit function from point clouds Need consistently oriented normals < 0 0 > 0

More information

Summer Review for Students Entering Pre-Calculus with Trigonometry. TI-84 Plus Graphing Calculator is required for this course.

Summer Review for Students Entering Pre-Calculus with Trigonometry. TI-84 Plus Graphing Calculator is required for this course. 1. Using Function Notation and Identifying Domain and Range 2. Multiplying Polynomials and Solving Quadratics 3. Solving with Trig Ratios and Pythagorean Theorem 4. Multiplying and Dividing Rational Expressions

More information

Subdivision. Outline. Key Questions. Subdivision Surfaces. Advanced Computer Graphics (Spring 2013) Video: Geri s Game (outside link)

Subdivision. Outline. Key Questions. Subdivision Surfaces. Advanced Computer Graphics (Spring 2013) Video: Geri s Game (outside link) Advanced Computer Graphics (Spring 03) CS 83, Lecture 7: Subdivision Ravi Ramamoorthi http://inst.eecs.berkeley.edu/~cs83/sp3 Slides courtesy of Szymon Rusinkiewicz, James O Brien with material from Denis

More information

Simplification and Streaming of GIS Terrain for Web Client

Simplification and Streaming of GIS Terrain for Web Client Simplification and Streaming of GIS Terrain for Web Client Web3D 2012 Geomod Liris : Pierre-Marie Gandoin Geomod Liris : Raphaëlle Chaine Atos Wordline : Aurélien Barbier-Accary Fabien CELLIER Université

More information

Geometry Processing & Geometric Queries. Computer Graphics CMU /15-662

Geometry Processing & Geometric Queries. Computer Graphics CMU /15-662 Geometry Processing & Geometric Queries Computer Graphics CMU 15-462/15-662 Last time: Meshes & Manifolds Mathematical description of geometry - simplifying assumption: manifold - for polygon meshes: fans,

More information

LOD and Occlusion Christian Miller CS Fall 2011

LOD and Occlusion Christian Miller CS Fall 2011 LOD and Occlusion Christian Miller CS 354 - Fall 2011 Problem You want to render an enormous island covered in dense vegetation in realtime [Crysis] Scene complexity Many billions of triangles Many gigabytes

More information

Multiresolution structures for interactive visualization of very large 3D datasets

Multiresolution structures for interactive visualization of very large 3D datasets Multiresolution structures for interactive visualization of very large 3D datasets Doctoral Thesis (Dissertation) to be awarded the degree of Doctor rerum naturalium (Dr.rer.nat.) submitted by Federico

More information

Summer Review for Students Entering Pre-Calculus with Trigonometry. TI-84 Plus Graphing Calculator is required for this course.

Summer Review for Students Entering Pre-Calculus with Trigonometry. TI-84 Plus Graphing Calculator is required for this course. Summer Review for Students Entering Pre-Calculus with Trigonometry 1. Using Function Notation and Identifying Domain and Range 2. Multiplying Polynomials and Solving Quadratics 3. Solving with Trig Ratios

More information

Midterm Exam Fundamentals of Computer Graphics (COMP 557) Thurs. Feb. 19, 2015 Professor Michael Langer

Midterm Exam Fundamentals of Computer Graphics (COMP 557) Thurs. Feb. 19, 2015 Professor Michael Langer Midterm Exam Fundamentals of Computer Graphics (COMP 557) Thurs. Feb. 19, 2015 Professor Michael Langer The exam consists of 10 questions. There are 2 points per question for a total of 20 points. You

More information

Properties of Quadratic functions

Properties of Quadratic functions Name Today s Learning Goals: #1 How do we determine the axis of symmetry and vertex of a quadratic function? Properties of Quadratic functions Date 5-1 Properties of a Quadratic Function A quadratic equation

More information

Multiresolution Techniques for the Simplification of Triangular and Tetrahedral Meshes

Multiresolution Techniques for the Simplification of Triangular and Tetrahedral Meshes Multiresolution Techniques for the Simplification of Triangular and Tetrahedral Meshes Nikos Platis Department of Informatics and Telecommunications University of Athens, Greece nplatis@di.uoa.gr Abstract.

More information

Motivation. Parametric Curves (later Surfaces) Outline. Tangents, Normals, Binormals. Arclength. Advanced Computer Graphics (Fall 2010)

Motivation. Parametric Curves (later Surfaces) Outline. Tangents, Normals, Binormals. Arclength. Advanced Computer Graphics (Fall 2010) Advanced Computer Graphics (Fall 2010) CS 283, Lecture 19: Basic Geometric Concepts and Rotations Ravi Ramamoorthi http://inst.eecs.berkeley.edu/~cs283/fa10 Motivation Moving from rendering to simulation,

More information

EECS 487: Interactive Computer Graphics

EECS 487: Interactive Computer Graphics EECS 487: Interactive Computer Graphics Lecture 36: Polygonal mesh simplification The Modeling-Rendering Paradigm Modeler: Modeling complex shapes no equation for a chair, face, etc. instead, achieve complexity

More information

Finding Shortest Path on Land Surface

Finding Shortest Path on Land Surface Finding Shortest Path on Land Surface Lian Liu, Raymond Chi-Wing Wong Hong Kong University of Science and Technology June 14th, 211 Introduction Land Surface Land surfaces are modeled as terrains A terrain

More information

Meshes: Catmull-Clark Subdivision and Simplification

Meshes: Catmull-Clark Subdivision and Simplification Meshes: Catmull-Clark Subdivision and Simplification Part 1: What I did CS 838, Project 1 Eric Aderhold My main goal with this project was to learn about and better understand three-dimensional mesh surfaces.

More information

Section 12.2: Quadric Surfaces

Section 12.2: Quadric Surfaces Section 12.2: Quadric Surfaces Goals: 1. To recognize and write equations of quadric surfaces 2. To graph quadric surfaces by hand Definitions: 1. A quadric surface is the three-dimensional graph of an

More information

Isotopic Approximation within a Tolerance Volume

Isotopic Approximation within a Tolerance Volume Isotopic Approximation within a Tolerance Volume Manish Mandad David Cohen-Steiner Pierre Alliez Inria Sophia Antipolis - 1 Goals and Motivation - 2 Goals and Motivation Input: Tolerance volume of a surface

More information

Homework #2 and #3 Due Friday, October 12 th and Friday, October 19 th

Homework #2 and #3 Due Friday, October 12 th and Friday, October 19 th Homework #2 and #3 Due Friday, October 12 th and Friday, October 19 th 1. a. Show that the following sequences commute: i. A rotation and a uniform scaling ii. Two rotations about the same axis iii. Two

More information

A Real-time System of Crowd Rendering: Parallel LOD and Texture-Preserving Approach on GPU

A Real-time System of Crowd Rendering: Parallel LOD and Texture-Preserving Approach on GPU A Real-time System of Crowd Rendering: Parallel LOD and Texture-Preserving Approach on GPU Chao Peng, Seung In Park, Yong Cao Computer Science Department, Virginia Tech, USA {chaopeng,spark80,yongcao}@vt.edu

More information

Parallel Computation of Spherical Parameterizations for Mesh Analysis. Th. Athanasiadis and I. Fudos University of Ioannina, Greece

Parallel Computation of Spherical Parameterizations for Mesh Analysis. Th. Athanasiadis and I. Fudos University of Ioannina, Greece Parallel Computation of Spherical Parameterizations for Mesh Analysis Th. Athanasiadis and I. Fudos, Greece Introduction Mesh parameterization is a powerful geometry processing tool Applications Remeshing

More information

Processing 3D Surface Data

Processing 3D Surface Data Processing 3D Surface Data Computer Animation and Visualisation Lecture 15 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing

More information

Multiresolution Computation of Conformal Structures of Surfaces

Multiresolution Computation of Conformal Structures of Surfaces Multiresolution Computation of Conformal Structures of Surfaces Xianfeng Gu Yalin Wang Shing-Tung Yau Division of Engineering and Applied Science, Harvard University, Cambridge, MA 0138 Mathematics Department,

More information

A General Algorithm for Triangular Meshes Simplification

A General Algorithm for Triangular Meshes Simplification Proceedings of the 11th WSEAS International Conference on COMPUTERS, Agios Nikolaos, Crete Island, Greece, July 26-28, 2007 613 A General Algorithm for Triangular Meshes Simplification BOŠTJAN PIVEC University

More information

Grafica 3D per i beni culturali: MeshLab features. Lezione 7: 22 Marzo 2013

Grafica 3D per i beni culturali: MeshLab features. Lezione 7: 22 Marzo 2013 Grafica 3D per i beni culturali: MeshLab features Lezione 7: 22 Marzo 2013 0 Cleaning Cleaning Cleaning a mesh is an operation which is often necessary before, during and after the processing of a mesh

More information

Subdivision Surfaces. Homework 1: Questions on Homework? Last Time? Today. Tensor Product. What s an illegal edge collapse?

Subdivision Surfaces. Homework 1: Questions on Homework? Last Time? Today. Tensor Product. What s an illegal edge collapse? Homework 1: Questions/Comments? Subdivision Surfaces Questions on Homework? Last Time? What s an illegal edge collapse? Curves & Surfaces Continuity Definitions 2 3 C0, G1, C1, C 1 a b 4 Interpolation

More information

Subdivision Surfaces

Subdivision Surfaces Subdivision Surfaces CS 4620 Lecture 31 Cornell CS4620 Fall 2015 1 Administration A5 due on Friday Dreamworks visiting Thu/Fri Rest of class Surfaces, Animation, Rendering w/ prior instructor Steve Marschner

More information

Large Mesh Deformation Using the Volumetric Graph Laplacian

Large Mesh Deformation Using the Volumetric Graph Laplacian Large Mesh Deformation Using the Volumetric Graph Laplacian Kun Zhou1 Jin Huang2 John Snyder3 Xinguo Liu1 Hujun Bao2 Baining Guo1 Heung-Yeung Shum1 1 Microsoft Research Asia 2 Zhejiang University 3 Microsoft

More information

Subdivision Surfaces. Homework 1: Questions/Comments?

Subdivision Surfaces. Homework 1: Questions/Comments? Subdivision Surfaces Homework 1: Questions/Comments? 1 Questions on Homework? What s an illegal edge collapse? 1 2 3 a b 4 7 To be legal, the ring of vertex neighbors must be unique (have no duplicates)!

More information

Appearance-Preserving Simplification

Appearance-Preserving Simplification Appearance-Preserving Simplification 7809 tris 975 tris 488 tris 1951 tris 3905 tris model courtesy of Stanford and Caltech Simplification Create representation for faster rendering Measure representation

More information

CLUSTERING A LARGE NUMBER OF FACES FOR 2-DIMENSIONAL MESH GENERATION

CLUSTERING A LARGE NUMBER OF FACES FOR 2-DIMENSIONAL MESH GENERATION CLUSTERING A LARGE NUMBER OF FACES FOR -DIMENSIONAL MESH GENERATION Keisuke Inoue, Takayuki Itoh, Atsushi Yamada 3, Tomotake Furuhata 4, Kenji Shimada 5,,3,4 IBM Japan Ltd., Yamato-shi, Kanagawa, Japan

More information

Overview. Efficient Simplification of Point-sampled Surfaces. Introduction. Introduction. Neighborhood. Local Surface Analysis

Overview. Efficient Simplification of Point-sampled Surfaces. Introduction. Introduction. Neighborhood. Local Surface Analysis Overview Efficient Simplification of Pointsampled Surfaces Introduction Local surface analysis Simplification methods Error measurement Comparison PointBased Computer Graphics Mark Pauly PointBased Computer

More information

Semiautomatic Simplification

Semiautomatic Simplification Semiautomatic Simplification ABSTRACT Gong Li gongli@cs.ualberta.ca Dept. Computing Science Univ. Alberta Edmonton, Alberta CANADA T6G 2H1 We present semisimp, a tool for semiautomatic simplification of

More information

Robust Stencil Shadow Volumes. CEDEC 2001 Tokyo, Japan

Robust Stencil Shadow Volumes. CEDEC 2001 Tokyo, Japan Robust Stencil Shadow Volumes CEDEC 2001 Tokyo, Japan Mark J. Kilgard Graphics Software Engineer NVIDIA Corporation 2 Games Begin to Embrace Robust Shadows 3 John Carmack s new Doom engine leads the way

More information

A General Simplification Algorithm

A General Simplification Algorithm A General Simplification Algorithm Boštjan Pivec, Vid Domiter Abstract In this article a new general algorithm for triangular mesh simplification is proposed. The algorithm extends Krivograd's work from

More information

Random volumes from matrices

Random volumes from matrices Random volumes from matrices Naoya Umeda (Kyoto Univ.) 2016.2.15 @ 京都産業大学益川塾 Based on the work with Masafumi Fukuma and Sotaro Sugishita (Kyoto Univ.) [arxiv:1503.08812][jhep 1507 (2015) 088] Random volumes

More information

Optimal Möbius Transformation for Information Visualization and Meshing

Optimal Möbius Transformation for Information Visualization and Meshing Optimal Möbius Transformation for Information Visualization and Meshing Marshall Bern Xerox Palo Alto Research Ctr. David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science

More information

Handles. The justification: For a 0 genus triangle mesh we can write the formula as follows:

Handles. The justification: For a 0 genus triangle mesh we can write the formula as follows: Handles A handle in a 3d mesh is a through hole. The number of handles can be extracted of the genus of the 3d mesh. Genus is the number of times we can cut 2k edges without disconnecting the 3d mesh.

More information

Advanced Computer Graphics Project Report. Terrain Approximation

Advanced Computer Graphics Project Report. Terrain Approximation Advanced Computer Graphics Project Report Terrain Approximation Wenli Li (liw9@rpi.edu) 1. Introduction DEM datasets are getting larger and larger with increasing precision, so that approximating DEM can

More information

Simplified Mesh Generation from Renders. Thorvald Natvig

Simplified Mesh Generation from Renders. Thorvald Natvig Simplified Mesh Generation from Renders Thorvald Natvig Department of Computer and Information Science (IDI) Norwegian University of Science and Technology (NTNU) Sem Sælandsvei 7-9, NO-7491 Trondheim

More information

3-Dimensional Object Modeling with Mesh Simplification Based Resolution Adjustment

3-Dimensional Object Modeling with Mesh Simplification Based Resolution Adjustment 3-Dimensional Object Modeling with Mesh Simplification Based Resolution Adjustment Özgür ULUCAY Sarp ERTÜRK University of Kocaeli Electronics & Communication Engineering Department 41040 Izmit, Kocaeli

More information

Investigating Transformations With DESMOS

Investigating Transformations With DESMOS MPM D0 Date: Investigating Transformations With DESMOS INVESTIGATION Part A: What if we add a constant to the x in y = x? 1. Use DESMOS to graph the following quadratic functions on the same grid. Graph

More information

Review for Quarter 3 Cumulative Test

Review for Quarter 3 Cumulative Test Review for Quarter 3 Cumulative Test I. Solving quadratic equations (LT 4.2, 4.3, 4.4) Key Facts To factor a polynomial, first factor out any common factors, then use the box method to factor the quadratic.

More information