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

Size: px
Start display at page:

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

Transcription

1 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. The formula for the genus of the triangle mesh is: The justification: For a 0 genus triangle mesh we can write the formula as follows: To prove it we will need to use the Cauchy s proof, Now we can fully assume that F-E+V=2 Without any loss of generality we can assume that the number of faces in a manifold mesh is the same as the number of triangles: T=F, hence: T-E+V=2 The uses u is as follow: - each triangle uses 3 edges U=3T - each edge is used by 2 triangles U=2E Therefore we can assert that 3T=2E, in other words E=3T/2 this way we can reformulate the T-E+V=2 as T-3T/2+V=2 and from here multiply by 2 and 2T-3T+2V=4

2 Point in solid test Parity is the key for our technique. Remembering the formula of the point in a tetrahedra: We have a formula called s, that computes if the point a is front facing a triangle d,c,b:

3 Assuming that we know the formula, for computing if a point is inside a solid, invent a new formula called PinT(a,b,c,d), assuming the following distribution of the points: PinT(a,b,c,d) returns: With those new tools we will be able to deduce if a point is inside a solid or not following the next technique, we pick an arbitrary point in the space O, and for all the tetrahedra defined by this arbitrary point and the triangles that define the solid, we would say that the point lies in the solid if there is an ODD number of tetrahedra that contains that point.

4 Connectivity/geometry discrepancy Some models can have non-manifold singularities, that is that an edge can be shared by more than 2 triangles, but despite that we can have an invalid geometry to represent it replicate the edges shared by more than 2 triangles The amount of replication The pseudo technique for obtaining convex hulls and why It does not work. The idea that an intuitive idea for obtaining a convex hull out of any concave triangle mesh is converting any concave edge into convex. The problem lies in that the mesh can intersect. In that case, we would obtain a convex shape but NOT a convex hull.

5 Compression and simplification Loss less compression: We quantize the parameters (depending on the quantization we are losing accuracy on the measures. We compress all this information, and then rebuild the shape. Lossy compression: We construct an approximation of the surface (different representation) then, compress. LOD: Level of detail. Triangle count reduction techniques - Divide by sets - Name the vertex - Any triangle that happens to have 3 vertices in the same cluster we collapse it into a point. - A triangle that happens to have 2 vertices in the same set, we convert it into an edge. This technique does not guarantee keeping the topology unchanged NON PRESERVING SIMPLIFICATION Repeatedly collapse best edge - Pick the best edge (depends on the goal we want to achieve): The ones that minimize error between original and resulting level of detail, geometric proximity clustering of vertices, collapse edges (collapse the longer edges in almost planar regions) or point-plane distance. - With this technique we bound the Hausdorff error of the simplification. Each vertex is guaranteed not to be moved for more distance than the diameter of triangle bounding circle.

6 3D compression Compact encoding of 3d representations with efficient compression decompression algorithms. We can compress the connectivity and the geometry of the 3d shape. Location: specifying where the interior vertices are. Incidence: Defining how the surface interpolates the points. The way of compressing the 3d shape: - Codification of each triangle independently (their vertices and incidence) : highly redundant. - Triangle strips: given the corridor codifying the incidence is just one bit (left or right). But you have to codify each vertex twice so the adjacent corridors share their vertices: also redundant - Vertex and Triangle tables best performance, no redundancy. Connectivity compression - Triangle strip: its simple and cheap but the strips are irregular and have warts, so breaks all the simplicity of the idea. - Vertex Spanning Tree and Triangle Spanning Tree: knowing the relative position of triangles between them and knowing vertex positions relative to each other, we can codify the mesh. The triangle spanning tree can be codified using two bits per triangle and the vertex spanning tree using 2 bits per vertex. The next step: Topological surgery.

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

MA 323 Geometric Modelling Course Notes: Day 36 Subdivision Surfaces

MA 323 Geometric Modelling Course Notes: Day 36 Subdivision Surfaces MA 323 Geometric Modelling Course Notes: Day 36 Subdivision Surfaces David L. Finn Today, we continue our discussion of subdivision surfaces, by first looking in more detail at the midpoint method and

More information

Mesh Basics: Definitions, Topology & Data Structures. Standard Graph Definitions

Mesh Basics: Definitions, Topology & Data Structures. Standard Graph Definitions Mesh : Definitions, Topology & Data Structures 1 Standard Graph Definitions G = V = vertices = {A,B,C,D,E,F,G,H,I,J,K,L} E = edges = {(A,B),(B,C),(C,D),(D,E),(E,F),(F,G), (G,H),(H,A),(A,J),(A,G),(B,J),(K,F),

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

3D Mesh Compression in Open3DGC. Khaled MAMMOU

3D Mesh Compression in Open3DGC. Khaled MAMMOU 3D Mesh Compression in Open3DGC Khaled MAMMOU OPPORTUNITIES FOR COMPRESSION Indexed Face Set Geometry: positions Connectivity: of triangles Requires 192 bits per vertex! Redundancy Indexes repeated multiple

More information

Geometric Modeling Mortenson Chapter 11. Complex Model Construction

Geometric 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 information

Voronoi Diagrams in the Plane. Chapter 5 of O Rourke text Chapter 7 and 9 of course text

Voronoi Diagrams in the Plane. Chapter 5 of O Rourke text Chapter 7 and 9 of course text Voronoi Diagrams in the Plane Chapter 5 of O Rourke text Chapter 7 and 9 of course text Voronoi Diagrams As important as convex hulls Captures the neighborhood (proximity) information of geometric objects

More information

Flavor of Computational Geometry. Convex Hull in 2D. Shireen Y. Elhabian Aly A. Farag University of Louisville

Flavor of Computational Geometry. Convex Hull in 2D. Shireen Y. Elhabian Aly A. Farag University of Louisville Flavor of Computational Geometry Convex Hull in 2D Shireen Y. Elhabian Aly A. Farag University of Louisville February 2010 Agenda Introduction Definitions of Convexity and Convex Hulls Naïve Algorithms

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

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

Single Triangle Strip and Loop on Manifolds with Boundaries

Single Triangle Strip and Loop on Manifolds with Boundaries Single Triangle Strip and Loop on Manifolds with Boundaries Pablo Diaz-Gutierrez David Eppstein M. Gopi Department of Computer Science, University of California, Irvine. Abstract The single triangle-strip

More information

Computational Geometry

Computational 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 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

CS Object Representation. Aditi Majumder, CS 112 Slide 1

CS Object Representation. Aditi Majumder, CS 112 Slide 1 CS 112 - Object Representation Aditi Majumder, CS 112 Slide 1 What is Graphics? Modeling Computer representation of the 3D world Analysis For efficient rendering For catering the model to different applications..

More information

Some Open Problems in Graph Theory and Computational Geometry

Some Open Problems in Graph Theory and Computational Geometry Some Open Problems in Graph Theory and Computational Geometry David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science ICS 269, January 25, 2002 Two Models of Algorithms Research

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

Voronoi Diagram. Xiao-Ming Fu

Voronoi 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 information

coding of various parts showing different features, the possibility of rotation or of hiding covering parts of the object's surface to gain an insight

coding 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 information

Euler Characteristic

Euler Characteristic Euler Characteristic Rebecca Robinson May 15, 2007 Euler Characteristic Rebecca Robinson 1 PLANAR GRAPHS 1 Planar graphs v = 5, e = 4, f = 1 v e + f = 2 v = 6, e = 7, f = 3 v = 4, e = 6, f = 4 v e + f

More information

13 - Meshes. Acknowledgement: Enrico Puppo. CSCI-GA Computer Graphics - Fall 16 - Daniele Panozzo

13 - Meshes. Acknowledgement: Enrico Puppo. CSCI-GA Computer Graphics - Fall 16 - Daniele Panozzo 13 - Meshes Acknowledgement: Enrico Puppo What is a mesh? A surface made of polygonal faces glued at common edges Origin of Meshes In nature, meshes arise in a variety of contexts: Cells in organic tissues

More information

Line Arrangement. Chapter 6

Line Arrangement. Chapter 6 Line Arrangement Chapter 6 Line Arrangement Problem: Given a set L of n lines in the plane, compute their arrangement which is a planar subdivision. Line Arrangements Problem: Given a set L of n lines

More information

Topological Data Analysis - I. Afra Zomorodian Department of Computer Science Dartmouth College

Topological 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 information

CLASSIFICATION OF SURFACES

CLASSIFICATION OF SURFACES CLASSIFICATION OF SURFACES YUJIE ZHANG Abstract. The sphere, Möbius strip, torus, real projective plane and Klein bottle are all important examples of surfaces (topological 2-manifolds). In fact, via the

More information

Scheduling, Map Coloring, and Graph Coloring

Scheduling, Map Coloring, and Graph Coloring Scheduling, Map Coloring, and Graph Coloring Scheduling via Graph Coloring: Final Exam Example Suppose want to schedule some ;inal exams for CS courses with following course numbers: 1007, 3137, 3157,

More information

Solutions to the ARML Power Question 2006: The Power of Origami

Solutions to the ARML Power Question 2006: The Power of Origami Solutions to the L ower uestion 006: The ower of Origami 1. a) The crease is the perpendicular bisector of, no justification is necessary. b) The crease is the bisector of two of the angles formed by the

More information

arxiv: v2 [math.ag] 8 Mar 2017

arxiv: v2 [math.ag] 8 Mar 2017 arxiv:1412.5313v2 [math.g] 8 Mar 2017 M-curves of degree 9 or 11 with one unique non-empty oval Séverine Fiedler-Le Touzé June 27, 2018 bstract In this note, we consider M-curves of odd degree m with real

More information

Convex Hulls (3D) O Rourke, Chapter 4

Convex Hulls (3D) O Rourke, Chapter 4 Convex Hulls (3D) O Rourke, Chapter 4 Outline Polyhedra Polytopes Euler Characteristic (Oriented) Mesh Representation Polyhedra Definition: A polyhedron is a solid region in 3D space whose boundary is

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

Planarity. 1 Introduction. 2 Topological Results

Planarity. 1 Introduction. 2 Topological Results Planarity 1 Introduction A notion of drawing a graph in the plane has led to some of the most deep results in graph theory. Vaguely speaking by a drawing or embedding of a graph G in the plane we mean

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

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

Voronoi diagram and Delaunay triangulation

Voronoi diagram and Delaunay triangulation Voronoi diagram and Delaunay triangulation Ioannis Emiris & Vissarion Fisikopoulos Dept. of Informatics & Telecommunications, University of Athens Computational Geometry, spring 2015 Outline 1 Voronoi

More information

Week 7 Convex Hulls in 3D

Week 7 Convex Hulls in 3D 1 Week 7 Convex Hulls in 3D 2 Polyhedra A polyhedron is the natural generalization of a 2D polygon to 3D 3 Closed Polyhedral Surface A closed polyhedral surface is a finite set of interior disjoint polygons

More information

Three applications of Euler s formula. Chapter 10

Three applications of Euler s formula. Chapter 10 Three applications of Euler s formula Chapter 10 A graph is planar if it can be drawn in the plane R without crossing edges (or, equivalently, on the -dimensional sphere S ). We talk of a plane graph if

More information

: Mesh Processing. Chapter 8

: 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 information

CS 177 Homework 1. Julian Panetta. October 22, We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F:

CS 177 Homework 1. Julian Panetta. October 22, We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F: CS 177 Homework 1 Julian Panetta October, 009 1 Euler Characteristic 1.1 Polyhedral Formula We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F: V E + F = 1 First,

More information

Simplicial Complexes: Second Lecture

Simplicial Complexes: Second Lecture Simplicial Complexes: Second Lecture 4 Nov, 2010 1 Overview Today we have two main goals: Prove that every continuous map between triangulable spaces can be approximated by a simplicial map. To do this,

More information

INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES

INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES RACHEL CARANDANG Abstract. This paper provides an overview of the homology groups of a 2- dimensional complex. It then demonstrates a proof of the Invariance

More information

Tangencies between disjoint regions in the plane

Tangencies between disjoint regions in the plane June 16, 20 Problem Definition Two nonoverlapping Jordan regions in the plane are said to touch each other or to be tangent to each other if their boundaries have precisely one point in common and their

More information

Single Triangle Strip and Loop on Manifolds with Boundaries

Single Triangle Strip and Loop on Manifolds with Boundaries Single Triangle Strip and Loop on Manifolds with Boundaries Pablo Diaz-Gutierrez David Eppstein Department of Computer Science University of California, Irvine. M. Gopi Abstract The single triangle-strip

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

Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings

Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 12: Planar Graphs Math 184A / Fall 2017 1 / 45 12.1 12.2. Planar graphs Definition

More information

1 Appendix to notes 2, on Hyperbolic geometry:

1 Appendix to notes 2, on Hyperbolic geometry: 1230, notes 3 1 Appendix to notes 2, on Hyperbolic geometry: The axioms of hyperbolic geometry are axioms 1-4 of Euclid, plus an alternative to axiom 5: Axiom 5-h: Given a line l and a point p not on l,

More information

Elementary Planar Geometry

Elementary Planar Geometry Elementary Planar Geometry What is a geometric solid? It is the part of space occupied by a physical object. A geometric solid is separated from the surrounding space by a surface. A part of the surface

More information

1. The following graph is not Eulerian. Make it into an Eulerian graph by adding as few edges as possible.

1. The following graph is not Eulerian. Make it into an Eulerian graph by adding as few edges as possible. 1. The following graph is not Eulerian. Make it into an Eulerian graph by adding as few edges as possible. A graph is Eulerian if it has an Eulerian circuit, which occurs if the graph is connected and

More information

Surfaces: notes on Geometry & Topology

Surfaces: notes on Geometry & Topology Surfaces: notes on Geometry & Topology 1 Surfaces A 2-dimensional region of 3D space A portion of space having length and breadth but no thickness 2 Defining Surfaces Analytically... Parametric surfaces

More information

Pebble Sets in Convex Polygons

Pebble Sets in Convex Polygons 2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon

More information

Unit 2A: Angle Pairs and Transversal Notes

Unit 2A: Angle Pairs and Transversal Notes Unit 2A: Angle Pairs and Transversal Notes Day 1: Special angle pairs Day 2: Angle pairs formed by transversal through two nonparallel lines Day 3: Angle pairs formed by transversal through parallel lines

More information

Linear Complexity Hexahedral Mesh Generation

Linear Complexity Hexahedral Mesh Generation Linear Complexity Hexahedral Mesh Generation David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717 http://www.ics.uci.edu/ eppstein/ Tech. Report 95-51

More information

Saab. Kyle McDonald. Polygon Meshes

Saab. 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 information

1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D.

1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. 1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third

More information

Multiresolution Meshes. COS 526 Tom Funkhouser, Fall 2016 Slides by Guskov, Praun, Sweldens, etc.

Multiresolution Meshes. COS 526 Tom Funkhouser, Fall 2016 Slides by Guskov, Praun, Sweldens, etc. Multiresolution Meshes COS 526 Tom Funkhouser, Fall 2016 Slides by Guskov, Praun, Sweldens, etc. Motivation Huge meshes are difficult to render store transmit edit Multiresolution Meshes! [Guskov et al.]

More information

1 Introduction To construct a branched covering of a 3-manifold M, we start with a tamely embedded knot or link L ρ M (the branch set) and a represent

1 Introduction To construct a branched covering of a 3-manifold M, we start with a tamely embedded knot or link L ρ M (the branch set) and a represent Kirby diagrams from branched-covering presentations Frank J. Swenton Department of Mathematics Middlebury College Middlebury, VT 05753 Email: fswenton@alumni.princeton.edu Abstract We present an algorithm

More information

: Mesh Processing. Chapter 2

: Mesh Processing. Chapter 2 600.657: Mesh Processing Chapter 2 Data Structures Polygon/Triangle Soup Indexed Polygon/Triangle Set Winged-Edge Half-Edge Directed-Edge List of faces Polygon Soup Each face represented independently

More information

Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 24 Solid Modelling

Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 24 Solid Modelling Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 24 Solid Modelling Welcome to the lectures on computer graphics. We have

More information

My Favorite Problems, 4 Harold B. Reiter University of North Carolina Charlotte

My Favorite Problems, 4 Harold B. Reiter University of North Carolina Charlotte My Favorite Problems, 4 Harold B Reiter University of North Carolina Charlotte This is the fourth of a series of columns about problems I am soliciting problems from the readers of M&I Quarterly I m looking

More information

Max-Cut and Max-Bisection are NP-hard on unit disk graphs

Max-Cut and Max-Bisection are NP-hard on unit disk graphs Max-Cut and Max-Bisection are NP-hard on unit disk graphs Josep Díaz and Marcin Kamiński 2 Llenguatges i Sistemes Informàtics 2 RUTCOR, Rutgers University Universitat Politècnica de Catalunya 640 Bartholomew

More information

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

Surface Mesh Generation

Surface Mesh Generation Surface Mesh Generation J.-F. Remacle Université catholique de Louvain September 22, 2011 0 3D Model For the description of the mesh generation process, let us consider the CAD model of a propeller presented

More information

6.2 Classification of Closed Surfaces

6.2 Classification of Closed Surfaces Table 6.1: A polygon diagram 6.1.2 Second Proof: Compactifying Teichmuller Space 6.2 Classification of Closed Surfaces We saw that each surface has a triangulation. Compact surfaces have finite triangulations.

More information

Simple Graph. General Graph

Simple Graph. General Graph Graph Theory A graph is a collection of points (also called vertices) and lines (also called edges), with each edge ending at a vertex In general, it is allowed for more than one edge to have the same

More information

Line Arrangements. Applications

Line Arrangements. Applications Computational Geometry Chapter 9 Line Arrangements 1 Line Arrangements Applications On the Agenda 2 1 Complexity of a Line Arrangement Given a set L of n lines in the plane, their arrangement A(L) is the

More information

γ 2 γ 3 γ 1 R 2 (b) a bounded Yin set (a) an unbounded Yin set

γ 2 γ 3 γ 1 R 2 (b) a bounded Yin set (a) an unbounded Yin set γ 1 γ 3 γ γ 3 γ γ 1 R (a) an unbounded Yin set (b) a bounded Yin set Fig..1: Jordan curve representation of a connected Yin set M R. A shaded region represents M and the dashed curves its boundary M that

More information

Max-Cut and Max-Bisection are NP-hard on unit disk graphs

Max-Cut and Max-Bisection are NP-hard on unit disk graphs R u t c o r Research R e p o r t Max-Cut and Max-Bisection are NP-hard on unit disk graphs Josep Díaz a Marcin Kamiński b RRR 2006-23, September 2006 RUTCOR Rutgers Center for Operations Research Rutgers

More information

CAD & Computational Geometry Course plan

CAD & Computational Geometry Course plan Course plan Introduction Segment-Segment intersections Polygon Triangulation Intro to Voronoï Diagrams & Geometric Search Sweeping algorithm for Voronoï Diagrams 1 Voronoi Diagrams Voronoi Diagrams or

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

Multi-View Matching & Mesh Generation. Qixing Huang Feb. 13 th 2017

Multi-View Matching & Mesh Generation. Qixing Huang Feb. 13 th 2017 Multi-View Matching & Mesh Generation Qixing Huang Feb. 13 th 2017 Geometry Reconstruction Pipeline RANSAC --- facts Sampling Feature point detection [Gelfand et al. 05, Huang et al. 06] Correspondences

More information

Angles of Polygons. Essential Question What is the sum of the measures of the interior angles of a polygon?

Angles of Polygons. Essential Question What is the sum of the measures of the interior angles of a polygon? 7.1 Angles of Polygons Essential Question What is the sum of the measures of the interior angles of a polygon? The Sum of the Angle Measures of a Polygon Work with a partner. Use dynamic geometry software.

More information

Geometric Modeling in Graphics

Geometric 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 information

TWO CONTRIBUTIONS OF EULER

TWO CONTRIBUTIONS OF EULER TWO CONTRIBUTIONS OF EULER SIEMION FAJTLOWICZ. MATH 4315 Eulerian Tours. Although some mathematical problems which now can be thought of as graph-theoretical, go back to the times of Euclid, the invention

More information

CLASSIFICATION OF SURFACES

CLASSIFICATION OF SURFACES CLASSIFICATION OF SURFACES JUSTIN HUANG Abstract. We will classify compact, connected surfaces into three classes: the sphere, the connected sum of tori, and the connected sum of projective planes. Contents

More information

Subdivision Curves and Surfaces: An Introduction

Subdivision Curves and Surfaces: An Introduction Subdivision Curves and Surfaces: An Introduction Corner Cutting De Casteljau s and de Boor s algorithms all use corner-cutting procedures. Corner cutting can be local or non-local. A cut is local if it

More information

Lecture notes: Object modeling

Lecture 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 information

arxiv: v1 [cs.cc] 30 Jun 2017

arxiv: v1 [cs.cc] 30 Jun 2017 Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs Erik D. Demaine Mikhail Rudoy arxiv:1706.10046v1 [cs.cc] 30 Jun 2017 Abstract In 2007, Arkin et al. [3] initiated

More information

The Geodesic Integral on Medial Graphs

The Geodesic Integral on Medial Graphs The Geodesic Integral on Medial Graphs Kolya Malkin August 013 We define the geodesic integral defined on paths in the duals of medial graphs on surfaces and use it to study lens elimination and connection

More information

Curve Corner Cutting

Curve Corner Cutting Subdivision ision Techniqueses Spring 2010 1 Curve Corner Cutting Take two points on different edges of a polygon and join them with a line segment. Then, use this line segment to replace all vertices

More information

Section 4: Introduction to Polygons Part 1

Section 4: Introduction to Polygons Part 1 The following Mathematics Florida Standards will be covered in this section: MAFS.912.G-CO.1.1 Know precise definitions of angle, circle, perpendicular line, parallel line, and line segment, based on the

More information

10. Line Arrangements Lecture on Monday 2 nd November, 2009 by Michael Homann

10. Line Arrangements Lecture on Monday 2 nd November, 2009 by Michael Homann 10. Line Arrangements Lecture on Monday 2 nd November, 2009 by Michael Homann During the course of this lecture we encountered several situations where it was convenient to assume

More information

Simplicial Hyperbolic Surfaces

Simplicial Hyperbolic Surfaces Simplicial Hyperbolic Surfaces Talk by Ken Bromberg August 21, 2007 1-Lipschitz Surfaces- In this lecture we will discuss geometrically meaningful ways of mapping a surface S into a hyperbolic manifold

More information

Answers. (1) Parallelogram. Remember: A four-sided flat shape where the opposite sides are parallel is called a parallelogram. Here, AB DC and BC AD.

Answers. (1) Parallelogram. Remember: A four-sided flat shape where the opposite sides are parallel is called a parallelogram. Here, AB DC and BC AD. Answers (1) Parallelogram Remember: A four-sided flat shape where the opposite sides are parallel is called a parallelogram. Here, AB DC and BC AD. (2) straight angle The angle whose measure is 180 will

More information

Computational Geometry

Computational Geometry Lecture 12: Lecture 12: Motivation: Terrains by interpolation To build a model of the terrain surface, we can start with a number of sample points where we know the height. Lecture 12: Motivation: Terrains

More information

Tutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass

Tutorial 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 information

What is a tessellation???? Give an example... Daily Do from last class Homework Answers 10 7 These are similar: What does y =? x =?

What is a tessellation???? Give an example... Daily Do from last class Homework Answers 10 7 These are similar: What does y =? x =? Daily Do from last class Homework Answers 10 7 These are similar: What does y =? x =? 36 74 0 78 0 154 o 44 48 54 o y x 154 o 78 0 12 74 0 9 1. 8 ft 2. 21m 3. 21 ft 4. 30cm 5. 6mm 6. 16 in 7. yes 9 = 7

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

Planar graphs. Chapter 8

Planar graphs. Chapter 8 Chapter 8 Planar graphs Definition 8.1. A graph is called planar if it can be drawn in the plane so that edges intersect only at vertices to which they are incident. Example 8.2. Different representations

More information

Surface Topology ReebGraph

Surface Topology ReebGraph Sub-Topics Compute bounding box Compute Euler Characteristic Estimate surface curvature Line description for conveying surface shape Extract skeletal representation of shapes Morse function and surface

More information

Simultaneously flippable edges in triangulations

Simultaneously flippable edges in triangulations Simultaneously flippable edges in triangulations Diane L. Souvaine 1, Csaba D. Tóth 2, and Andrew Winslow 1 1 Tufts University, Medford MA 02155, USA, {dls,awinslow}@cs.tufts.edu 2 University of Calgary,

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

Spirale Reversi: Reverse decoding of the Edgebreaker encoding

Spirale Reversi: Reverse decoding of the Edgebreaker encoding Spirale Reversi: Reverse decoding of the Edgebreaker encoding Martin Isenburg Jack Snoeyink University of North Carolina at Chapel Hill fisenburg j snoeyinkg@cs.unc.edu Abstract We present a simple linear

More information

Algorithms for GIS. Spatial data: Models and representation (part I) Laura Toma. Bowdoin College

Algorithms for GIS. Spatial data: Models and representation (part I) Laura Toma. Bowdoin College Algorithms for GIS Spatial data: Models and representation (part I) Laura Toma Bowdoin College Outline Spatial data in GIS applications Point data Networks Terrains Planar maps and meshes Data structures

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

Polygon Meshes and Implicit Surfaces

Polygon Meshes and Implicit Surfaces CSCI 420 Computer Graphics Lecture 9 Polygon Meshes and Implicit Surfaces Polygon Meshes Implicit Surfaces Constructive Solid Geometry [Angel Ch. 10] Jernej Barbic University of Southern California 1 Modeling

More information

Polygon Meshes and Implicit Surfaces

Polygon Meshes and Implicit Surfaces CSCI 420 Computer Graphics Lecture 9 and Constructive Solid Geometry [Angel Ch. 10] Jernej Barbic University of Southern California Modeling Complex Shapes An equation for a sphere is possible, but how

More information

Matching and Planarity

Matching and Planarity Matching and Planarity Po-Shen Loh June 010 1 Warm-up 1. (Bondy 1.5.9.) There are n points in the plane such that every pair of points has distance 1. Show that there are at most n (unordered) pairs of

More information

Lesson Plan #39. 2) Students will be able to find the sum of the measures of the exterior angles of a triangle.

Lesson Plan #39. 2) Students will be able to find the sum of the measures of the exterior angles of a triangle. Lesson Plan #39 Class: Geometry Date: Tuesday December 11 th, 2018 Topic: Sum of the measures of the interior angles of a polygon Objectives: Aim: What is the sum of the measures of the interior angles

More information

Basics of Combinatorial Topology

Basics of Combinatorial Topology Chapter 7 Basics of Combinatorial Topology 7.1 Simplicial and Polyhedral Complexes In order to study and manipulate complex shapes it is convenient to discretize these shapes and to view them as the union

More information

The Game of Criss-Cross

The Game of Criss-Cross Chapter 5 The Game of Criss-Cross Euler Characteristic ( ) Overview. The regions on a map and the faces of a cube both illustrate a very natural sort of situation: they are each examples of regions that

More information

Approximating Polygonal Objects by Deformable Smooth Surfaces

Approximating Polygonal Objects by Deformable Smooth Surfaces Approximating Polygonal Objects by Deformable Smooth Surfaces Ho-lun Cheng and Tony Tan School of Computing, National University of Singapore hcheng,tantony@comp.nus.edu.sg Abstract. We propose a method

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

Shape Modeling and Geometry Processing

Shape Modeling and Geometry Processing 252-0538-00L, Spring 2018 Shape Modeling and Geometry Processing Discrete Differential Geometry Differential Geometry Motivation Formalize geometric properties of shapes Roi Poranne # 2 Differential Geometry

More information