Geometric Modeling. Mesh Decimation. Mesh Decimation. Applications. Copyright 2010 Gotsman, Pauly Page 1. Oversampled 3D scan data
|
|
- Dwain Walters
- 5 years ago
- Views:
Transcription
1 Applications Oversampled 3D scan data ~150k triangles ~80k triangles 2 Copyright 2010 Gotsman, Pauly Page 1
2 Applications Overtessellation: E.g. iso-surface extraction 3 Applications Multi-resolution hierarchies for efficient geometry processing level-of-detail (LOD) rendering 4 Copyright 2010 Gotsman, Pauly Page 2
3 Applications Adaptation to hardware capabilities 5 Size-Quality Tradeoff error size 6 Copyright 2010 Gotsman, Pauly Page 3
4 Problem Statement Given: Find: such that 1. and is minimal, or 2. and is minimal Respect additional fairness criteria normal deviation, triangle shape, scalar attributes, etc. 7 Methods Vertex clustering Incremental decimation Resampling Mesh approximation 8 Copyright 2010 Gotsman, Pauly Page 4
5 Vertex Clustering Cluster Generation Computing a representative Mesh generation Topology changes 9 Vertex Clustering Cluster Generation Uniform 3D grid Map vertices to cluster cells Computing a representative Mesh generation Topology changes 10 Copyright 2010 Gotsman, Pauly Page 5
6 Vertex Clustering Cluster Generation Hierarchical approach Top-down or bottom-up Computing a representative Mesh generation Topology changes 11 Vertex Clustering Cluster Generation Computing a representative Average/median vertex position Error quadrics Mesh generation Topology changes 12 Copyright 2010 Gotsman, Pauly Page 6
7 Computing a Representative Average vertex position 13 Computing a Representative Median vertex position 14 Copyright 2010 Gotsman, Pauly Page 7
8 Computing a Representative Error quadrics 15 Error Quadrics Patch is expected to be piecewise flat Minimize distance to neighboring triangles planes 16 Copyright 2010 Gotsman, Pauly Page 8
9 Error Quadrics Squared distance of point p to plane q: Q q 2 a ab ac ad E ca cb c cd f 2 da db dc d f 2 ba b bc bd 3 3 = = 2 T g 17 Error Quadrics Sum distances to planes q i of vertex neighboring triangles: An expression of the energy using E,f,g: p T E f 3 3 T f p g 18 Copyright 2010 Gotsman, Pauly Page 9
10 Error Quadrics Point p* that minimizes the error satisfies (simple linear least squares): 3 3 (,,,1) T T E f p= x y z, min p p T f g Ep= f Achieved by taking derivatives for all (x,y,z). E might not be full rank (why?) Use pseudo-inverse 19 Comparison average median error quadric 20 Copyright 2010 Gotsman, Pauly Page 10
11 Vertex Clustering Cluster Generation Computing a representative Mesh generation Clusters p {p 0,...,p n }, q {q 0,...,q m } Topology changes 21 Vertex Clustering Cluster Generation Computing a representative Mesh generation Clusters p {p 0,...,p n }, q {q 0,...,q m } Connect (p,q) if there was an edge (p i,q j ) Topology changes 22 Copyright 2010 Gotsman, Pauly Page 11
12 Vertex Clustering Cluster Generation Computing a representative Mesh generation Topology changes If different sheets pass through one cell Can be non-manifold 23 Outline Applications Problem Statement Methods Vertex Clustering Incremental Decimation Extensions 24 Copyright 2010 Gotsman, Pauly Page 12
13 Incremental Decimation 25 Incremental Decimation General Setup Decimation operators Error metrics Fairness criteria Topology changes 26 Copyright 2010 Gotsman, Pauly Page 13
14 General Setup Repeat: pick mesh region apply decimation operator Until no further reduction possible 27 Greedy Optimization For each region evaluate quality after decimation enqeue(quality, region) Repeat: get best mesh region from queue apply decimation operator update queue Until no further reduction possible 28 Copyright 2010 Gotsman, Pauly Page 14
15 Global Error Control For each region evaluate quality after decimation enqeue(quality, region) Repeat: get best mesh region from queue if error < ε apply decimation operator update queue Until no further reduction possible 29 Incremental Decimation General Setup Decimation operators Error metrics Fairness criteria Topology changes 30 Copyright 2010 Gotsman, Pauly Page 15
16 Decimation Operators What is a "region"? What are the DOF for re-triangulation? Classification Topology-changing vs. topology-preserving Subsampling vs. filtering Inverse operation progressive meshes 31 Vertex Removal Select a vertex to be eliminated 32 Copyright 2010 Gotsman, Pauly Page 16
17 Vertex Removal Select all triangles sharing this vertex 33 Vertex Removal Remove the selected triangles, creating the hole 34 Copyright 2010 Gotsman, Pauly Page 17
18 Vertex Removal Fill the hole with new triangles 35 Decimation Operators Vertex Removal Vertex Insertion Remove vertex Re-triangulate hole Combinatorial degrees of freedom 36 Copyright 2010 Gotsman, Pauly Page 18
19 Decimation Operators Edge Collapse Vertex Split Merge two adjacent vertices Define new vertex position Continuous degrees of freedom Filter along the way 37 Decimation Operators Half-Edge Collapse Restricted Vertex Split Collapse edge into one end point Special case of vertex removal Special case of edge collapse No degrees of freedom Separates global optimization from local optimization 38 Copyright 2010 Gotsman, Pauly Page 19
20 Half-Edge Collapse 39 Half-Edge Collapse 40 Copyright 2010 Gotsman, Pauly Page 20
21 Half-Edge Collapse 41 Half-Edge Collapse 42 Copyright 2010 Gotsman, Pauly Page 21
22 Half-Edge Collapse 43 Half-Edge Collapse 44 Copyright 2010 Gotsman, Pauly Page 22
23 Half-Edge Collapse 45 Half-Edge Collapse 46 Copyright 2010 Gotsman, Pauly Page 23
24 Half-Edge Collapse 47 Half-Edge Collapse flip! 48 Copyright 2010 Gotsman, Pauly Page 24
25 Incremental Decimation General Setup Decimation operators Error metrics Fairness criteria Topology changes 49 Local Error Metrics Local distance to mesh Compute average plane No comparison to original geometry 50 Copyright 2010 Gotsman, Pauly Page 25
26 Global Error Metrics Error quadrics Squared distance to planes at vertex No bound on true error Q 1 p it Q i p i = 0, i={1,2} p 1 p 2 Q 2 solve v 3T Q 3 v 3 = min < ε? ok Q 3 = Q 1 +Q 2 v 3 51 Incremental Decimation General Setup Decimation operators Error metrics Fairness criteria Topology changes 52 Copyright 2010 Gotsman, Pauly Page 26
27 Fairness Criteria Rate quality of decimation operation Approximation error Triangle shape Dihedral angles Valence balance Fairness Criteria Rate quality after decimation Approximation error Triangle shape Dihedral angles Valence balance... r 1 r 2 54 Copyright 2010 Gotsman, Pauly Page 27
28 Fairness Criteria Rate quality after decimation Approximation error Triangle shape Dihedral angles Valence balance Fairness Criteria Rate quality after decimation Approximation error Triangle shape Dihedral angles Valence balance Color differences Copyright 2010 Gotsman, Pauly Page 28
29 Fairness Criteria Rate quality after decimation Approximation error Triangle shape Dihedral angles Valence balance Color differences Fairness Criteria Rate quality after decimation Approximation error Triangle shape Dihedral angles Valence balance Color differences Copyright 2010 Gotsman, Pauly Page 29
30 Fairness Criteria Rate quality after decimation Approximation error Triangle shape Dihedral angles Valence balance Color differences Incremental Decimation General Setup Decimation operators Error metrics Fairness criteria Topology changes 60 Copyright 2010 Gotsman, Pauly Page 30
31 Topology Changes? Merge vertices across non-edges Changes mesh topology Need spatial neighborhood information Generates non-manifold meshes Vertex Contraction Vertex Separation 61 Topology Changes? Merge vertices across non-edges Changes mesh topology Need spatial neighborhood information Generates non-manifold meshes manifold non-manifold 62 Copyright 2010 Gotsman, Pauly Page 31
32 Comparison Vertex clustering fast, but difficult to control simplified mesh topology changes, non-manifold meshes global error bound, but often not close to optimum Incremental decimation with quadric error metrics good trade-off between mesh quality and speed explicit control over mesh topology restricting normal deviation improves mesh quality 63 The Exercise Do Edge-collapse with error quadrics Tasks: Compute Quadric error for each pair of vertices sharing an edge Test that an halfedge collapse is valid (triangles remain valid), no intersections) Choose next candidate according to sum of error quadrics Collapse and repeat until target mesh size achieved 64 Copyright 2010 Gotsman, Pauly Page 32
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 informationMesh 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 informationMesh 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 informationMesh 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 informationMesh 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 informationSurface 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 informationCGAL. 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 informationGeometry 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 informationA 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 informationMesh 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 informationOverview. 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 informationGeometric 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 informationAppearance Preservation
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
More informationProcessing 3D Surface Data
Processing 3D Surface Data Computer Animation and Visualisation Lecture 17 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing
More informationGeometric 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 informationOverview. Spectral Processing of Point- Sampled Geometry. Introduction. Introduction. Fourier Transform. Fourier Transform
Overview Spectral Processing of Point- Sampled Geometry Introduction Fourier transform Spectral processing pipeline Spectral filtering Adaptive subsampling Summary Point-Based Computer Graphics Markus
More informationProcessing 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 informationFinal Project, Digital Geometry Processing
Final Project, Digital Geometry Processing Shayan Hoshyari Student #: 81382153 December 2016 Introduction In this project an adaptive surface remesher has been developed based on the paper [1]. An algorithm
More informationA 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 informationDigital 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 informationTutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass
Tutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass University of California, Davis, USA http://www.cs.ucdavis.edu/~koehl/ims2017/ What is a shape? A shape is a 2-manifold with a Riemannian
More informationMeshes and Manifolds. Computer Graphics CMU /15-662
Meshes and Manifolds Computer Graphics CMU 15-462/15-662 Fractal Quiz Last time: overview of geometry Many types of geometry in nature Geometry Demand sophisticated representations Two major categories:
More informationAdjacency 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 informationCSE 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 informationCurvature-Adaptive Remeshing with Feature Preservation of Manifold Triangle Meshes with Boundary
Curvature-Adaptive Remeshing with Feature Preservation of Manifold Triangle Meshes with Boundary Master s Project Tanja Munz Master of Science Computer Animation and Visual Effects 24th August, 2015 Abstract
More informationAlex Li 11/20/2009. Chris Wojtan, Nils Thurey, Markus Gross, Greg Turk
Alex Li 11/20/2009 Chris Wojtan, Nils Thurey, Markus Gross, Greg Turk duction Overview of Lagrangian of Topological s Altering the Topology 2 Presents a method for accurately tracking the moving surface
More informationMotivation. Freeform Shape Representations for Efficient Geometry Processing. Operations on Geometric Objects. Functional Representations
Motivation Freeform Shape Representations for Efficient Geometry Processing Eurographics 23 Granada, Spain Geometry Processing (points, wireframes, patches, volumes) Efficient algorithms always have to
More informationVoronoi Diagram. Xiao-Ming Fu
Voronoi Diagram Xiao-Ming Fu Outlines Introduction Post Office Problem Voronoi Diagram Duality: Delaunay triangulation Centroidal Voronoi tessellations (CVT) Definition Applications Algorithms Outlines
More informationFast 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 informationCross-Parameterization and Compatible Remeshing of 3D Models
Cross-Parameterization and Compatible Remeshing of 3D Models Vladislav Kraevoy Alla Sheffer University of British Columbia Authors Vladislav Kraevoy Ph.D. Student Alla Sheffer Assistant Professor Outline
More informationLesson 2: Basic Concepts of Geometry
: Basic Concepts of Geometry Learning Target I can identify the difference between a figure notation and its measurements I can list collinear and non collinear points I can find the distance / length
More information: Mesh Processing. Chapter 8
600.657: Mesh Processing Chapter 8 Handling Mesh Degeneracies [Botsch et al., Polygon Mesh Processing] Class of Approaches Geometric: Preserve the mesh where it s good. Volumetric: Can guarantee no self-intersection.
More informationHandles. 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 informationAll 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 informationMultiresolution 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 informationPLANE GEOMETRY SKILL BUILDER ELEVEN
PLANE GEOMETRY SKILL BUILDER ELEVEN Lines, Segments, and Rays The following examples should help you distinguish between lines, segments, and rays. The three undefined terms in geometry are point, line,
More informationIsotopic 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 information3-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 informationSimplification. 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 informationGeometric Modeling Mortenson Chapter 11. Complex Model Construction
Geometric Modeling 91.580.201 Mortenson Chapter 11 Complex Model Construction Topics Topology of Models Connectivity and other intrinsic properties Graph-Based Models Emphasize topological structure Boolean
More informationTo 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 informationTopological Data Analysis - I. Afra Zomorodian Department of Computer Science Dartmouth College
Topological Data Analysis - I Afra Zomorodian Department of Computer Science Dartmouth College September 3, 2007 1 Acquisition Vision: Images (2D) GIS: Terrains (3D) Graphics: Surfaces (3D) Medicine: MRI
More informationcoding of various parts showing different features, the possibility of rotation or of hiding covering parts of the object's surface to gain an insight
Three-Dimensional Object Reconstruction from Layered Spatial Data Michael Dangl and Robert Sablatnig Vienna University of Technology, Institute of Computer Aided Automation, Pattern Recognition and Image
More informationAs 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 informationGeometry: 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 informationTutorial 9 - Fast Marching Methods
236861 Numerical Geometry of Images Tutorial 9 Fast Marching Methods c 2012 Why measure distances? Shape analysis Image analysis Registration Morphology Navigation And many other uses.. There are many
More informationDefinitions. Topology/Geometry of Geodesics. Joseph D. Clinton. SNEC June Magnus J. Wenninger
Topology/Geometry of Geodesics Joseph D. Clinton SNEC-04 28-29 June 2003 Magnus J. Wenninger Introduction Definitions Topology Goldberg s polyhedra Classes of Geodesic polyhedra Triangular tessellations
More informationOn Your Own. Applications. Unit 3. b. AC = 8 units y BD = 16 units C(5, 2)
Applications 1 a. If students use uniform and y scales or ZSquare, they should have a shape that looks like a kite. Using the distance formula, DC = AD = 1 and BC = BA = 0. b. AC = 8 units y BD = 16 units
More informationCollision Detection. Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering
RBE 550 MOTION PLANNING BASED ON DR. DMITRY BERENSON S RBE 550 Collision Detection Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering http://users.wpi.edu/~zli11 Euler Angle RBE
More informationIllumination and Geometry Techniques. Karljohan Lundin Palmerius
Illumination and Geometry Techniques Karljohan Lundin Palmerius Objectives Complex geometries Translucency Huge areas Really nice graphics! Shadows Graceful degradation Acceleration Optimization Straightforward
More informationProcessing 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 informationParameterization with Manifolds
Parameterization with Manifolds Manifold What they are Why they re difficult to use When a mesh isn t good enough Problem areas besides surface models A simple manifold Sphere, torus, plane, etc. Using
More informationA General Framework for Mesh Decimation
A General Framework for Mesh Decimation Leif Kobbelt Swen Campagna Hans-Peter Seidel Computer Sciences Department, University of Erlangen-Nürnberg Am Weichselgarten 9, 91058 Erlangen, Germany kobbelt@informatik.uni-erlangen.de
More informationGeometric 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 informationA 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 information5.2 Surface Registration
Spring 2018 CSCI 621: Digital Geometry Processing 5.2 Surface Registration Hao Li http://cs621.hao-li.com 1 Acknowledgement Images and Slides are courtesy of Prof. Szymon Rusinkiewicz, Princeton University
More informationReporting Category 3. Geometry and Measurement BINGO
Reporting Category 3 Geometry and Measurement BINGO names an exact location in space, named by a capital letter Has NO width, length, or depth. 2 a straight path with 2 endpoints, has a definite beginning
More information3.1 Investigate Properties of Triangles Principles of Mathematics 10, pages
3.1 Investigate Properties of Triangles Principles of Mathematics 10, pages 110 116 A 1. The area of PQR is 16 square units. Find the area of PQS. the bisector of F the right bisector of side EF the right
More informationEfficient 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 informationGreedy Routing with Guaranteed Delivery Using Ricci Flow
Greedy Routing with Guaranteed Delivery Using Ricci Flow Jie Gao Stony Brook University Joint work with Rik Sarkar, Xiaotian Yin, Wei Zeng, Feng Luo, Xianfeng David Gu Greedy Routing Assign coordinatesto
More informationMedium Term Plan Year 6: Autumn Term
Medium Term Plan Year 6: Autumn Term Block A1.a: Multiply integers and decimals by 10, 100 or 1000 AUTUMN TERM Block A1.b: Divide integers by 10, 100 or 1000, and divide decimals by 10 or 100 Block A1.c:
More informationCSC Computer Graphics
// CSC. Computer Graphics Lecture Kasun@dscs.sjp.ac.lk Department of Computer Science University of Sri Jayewardanepura Polygon Filling Scan-Line Polygon Fill Algorithm Span Flood-Fill Algorithm Inside-outside
More informationLesson 05. Mid Phase. Collision Detection
Lesson 05 Mid Phase Collision Detection Lecture 05 Outline Problem definition and motivations Generic Bounding Volume Hierarchy (BVH) BVH construction, fitting, overlapping Metrics and Tandem traversal
More informationCS133 Computational Geometry
CS133 Computational Geometry Voronoi Diagram Delaunay Triangulation 5/17/2018 1 Nearest Neighbor Problem Given a set of points P and a query point q, find the closest point p P to q p, r P, dist p, q dist(r,
More informationManipulating the Boundary Mesh
Chapter 7. Manipulating the Boundary Mesh The first step in producing an unstructured grid is to define the shape of the domain boundaries. Using a preprocessor (GAMBIT or a third-party CAD package) you
More informationMST & Shortest Path -Prim s -Djikstra s
MST & Shortest Path -Prim s -Djikstra s PRIM s - Minimum Spanning Tree - A spanning tree of a graph is a tree that has all the vertices of the graph connected by some edges. - A graph can have one or more
More informationEECS 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 informationScientific Visualization Example exam questions with commented answers
Scientific Visualization Example exam questions with commented answers The theoretical part of this course is evaluated by means of a multiple- choice exam. The questions cover the material mentioned during
More informationCS 468, Spring 2013 Differential Geometry for Computer Science Justin Solomon and Adrian Butscher
http://alice.loria.fr/index.php/publications.html?redirect=0&paper=vsdm@2011&author=levy CS 468, Spring 2013 Differential Geometry for Computer Science Justin Solomon and Adrian Butscher µ R 3 µ R 2 http://upload.wikimedia.org/wikipedia/commons/b/bc/double_torus_illustration.png
More informationK-structure, Separating Chain, Gap Tree, and Layered DAG
K-structure, Separating Chain, Gap Tree, and Layered DAG Presented by Dave Tahmoush Overview Improvement on Gap Tree and K-structure Faster point location Encompasses Separating Chain Better storage Designed
More informationMulti-level Partition of Unity Implicits
Multi-level Partition of Unity Implicits Diego Salume October 23 rd, 2013 Author: Ohtake, et.al. Overview Goal: Use multi-level partition of unity (MPU) implicit surface to construct surface models. 3
More informationCurves & 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 informationDefinitions. You can represent a point by a dot and name it by a capital letter.
Definitions Name Block Term Definition Notes Sketch Notation Point A location in space that is represented by a dot and has no dimension You can represent a point by a dot and name it by a capital letter.
More informationMoving Least Squares Multiresolution Surface Approximation
Moving Least Squares Multiresolution Surface Approximation BORIS MEDEROS LUIZ VELHO LUIZ HENRIQUE DE FIGUEIREDO IMPA Instituto de Matemática Pura e Aplicada Estrada Dona Castorina 110, 22461-320 Rio de
More informationA Study on View-Dependent Representation of 3-D Mesh Models Using Hierarchical Partitioning
Thesis for Master s Degree A Study on View-Dependent Representation of 3-D Mesh Models Using Hierarchical Partitioning Sung-Yeol Kim Department of Information and Communications Kwangju Institute of Science
More informationPROPERTIES OF TRIANGLES AND QUADRILATERALS (plus polygons in general)
Mathematics Revision Guides Properties of Triangles, Quadrilaterals and Polygons Page 1 of 15 M.K. HOME TUITION Mathematics Revision Guides Level: GCSE Foundation Tier PROPERTIES OF TRIANGLES AND QUADRILATERALS
More informationSimple 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 informationSaab. Kyle McDonald. Polygon Meshes
Saab Kyle McDonald Polygon Meshes Siddhartha Chaudhuri http://www.cse.iitb.ac.in/~cs749 What is a polygon mesh? Like a point cloud, it is a discrete sampling of a surface... but, it adds linear (flat)
More informationSubdivision 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 informationMesh 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 informationSubdivision 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 informationMesh Generation. Quadtrees. Geometric Algorithms. Lecture 9: Quadtrees
Lecture 9: Lecture 9: VLSI Design To Lecture 9: Finite Element Method To http://www.antics1.demon.co.uk/finelms.html Lecture 9: To Lecture 9: To component not conforming doesn t respect input not well-shaped
More informationSurfaces, meshes, and topology
Surfaces from Point Samples Surfaces, meshes, and topology A surface is a 2-manifold embedded in 3- dimensional Euclidean space Such surfaces are often approximated by triangle meshes 2 1 Triangle mesh
More informationMarching Squares Algorithm. Can you summarize the marching squares algorithm based on what we just discussed?
Marching Squares Algorithm Can you summarize the marching squares algorithm based on what we just discussed? Marching Squares Algorithm Can you summarize the marching squares algorithm based on what we
More informationGEOMETRY HONORS COORDINATE GEOMETRY PACKET
GEOMETRY HONORS COORDINATE GEOMETRY PACKET Name Period 1 Day 1 - Directed Line Segments DO NOW Distance formula 1 2 1 2 2 2 D x x y y Midpoint formula x x, y y 2 2 M 1 2 1 2 Slope formula y y m x x 2 1
More informationFinding 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 informationITK Mesh Simplification using Error Quadrics and Directed Edges
GRAZ UNIVERSITY OF TECHNOLOGY INSTITUTE FOR COMPUTER GRAPHICS AND VISION ITK Mesh Simplification using Error Quadrics and Directed Edges Bachelor s Thesis Markus Pröll proell@student.tugraz.at Graz, September
More informationGeometric Modeling in Graphics
Geometric Modeling in Graphics Part 2: Meshes properties Martin Samuelčík www.sccg.sk/~samuelcik samuelcik@sccg.sk Meshes properties Working with DCEL representation One connected component with simple
More information3/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 informationComputational Geometry
Computational Geometry 600.658 Convexity A set S is convex if for any two points p, q S the line segment pq S. S p S q Not convex Convex? Convexity A set S is convex if it is the intersection of (possibly
More informationScalar Algorithms: Contouring
Scalar Algorithms: Contouring Computer Animation and Visualisation Lecture tkomura@inf.ed.ac.uk Institute for Perception, Action & Behaviour School of Informatics Contouring Scaler Data Last Lecture...
More informationDesign Intent of Geometric Models
School of Computer Science Cardiff University Design Intent of Geometric Models Frank C. Langbein GR/M78267 GR/S69085/01 NUF-NAL 00638/G Auckland University 15th September 2004; Version 1.1 Design Intent
More informationLecture notes: Object modeling
Lecture notes: Object modeling One of the classic problems in computer vision is to construct a model of an object from an image of the object. An object model has the following general principles: Compact
More informationDEFINITIONS. Perpendicular Two lines are called perpendicular if they form a right angle.
DEFINITIONS Degree A degree is the 1 th part of a straight angle. 180 Right Angle A 90 angle is called a right angle. Perpendicular Two lines are called perpendicular if they form a right angle. Congruent
More informationIso-surface cell search. Iso-surface Cells. Efficient Searching. Efficient search methods. Efficient iso-surface cell search. Problem statement:
Iso-Contouring Advanced Issues Iso-surface cell search 1. Efficiently determining which cells to examine. 2. Using iso-contouring as a slicing mechanism 3. Iso-contouring in higher dimensions 4. Texturing
More informationComputer Graphics Ray Casting. Matthias Teschner
Computer Graphics Ray Casting Matthias Teschner Outline Context Implicit surfaces Parametric surfaces Combined objects Triangles Axis-aligned boxes Iso-surfaces in grids Summary University of Freiburg
More informationOutline. Reconstruction of 3D Meshes from Point Clouds. Motivation. Problem Statement. Applications. Challenges
Reconstruction of 3D Meshes from Point Clouds Ming Zhang Patrick Min cs598b, Geometric Modeling for Computer Graphics Feb. 17, 2000 Outline - problem statement - motivation - applications - challenges
More informationAPEX PON VIDYASHRAM, VELACHERY ( ) HALF-YEARLY WORKSHEET 1 LINES AND ANGLES SECTION A
APEX PON VIDYASHRAM, VELACHERY (2017 18) HALF-YEARLY WORKSHEET 1 CLASS: VII LINES AND ANGLES SECTION A MATHEMATICS 1. The supplement of 0 is. 2. The common end point where two rays meet to form an angle
More informationG.CO Reflections and Isosceles
G.CO Reflections and Isosceles Triangles Alignments to Content Standards: G-CO.B Task Suppose is an isosceles triangle with side congruent to side AC as pictured below: Also pictured above is the midpoint
More informationSTL Rapid Prototyping
CATIA V5 Training Foils STL Rapid Prototyping Version 5 Release 19 January 2009 EDU_CAT_EN_STL_FI_V5R19 1 About this course Objectives of the course Upon completion of this course you will learn how to
More information