Discrete Distortion for Surface Meshes Mohammed Mostefa Mesmoudi Leila De Floriani Paola Magillo Dept. of Computer Science, University of Genova, Italy.

Slides:



Advertisements
Similar presentations
Steady-state heat conduction on triangulated planar domain May, 2002
Advertisements

2D/3D Shape Manipulation, 3D Printing
Developable Surface Fitting to Point Clouds Martin Peternell Computer Aided Geometric Design 21(2004) Reporter: Xingwang Zhang June 19, 2005.
Extended Gaussian Images
Mean Value Coordinates for Closed Triangular Meshes
Using Properties of Polyhedra
 Mirrors that are not flat are called curved mirrors.  Depending on whether the reflective coating is on the inside or outside of the curve will decide.
Chapter 12: Surface Area and Volume of Solids
Two- and Three-Dimensional Figures
Computational Geometry & Collision detection
1 SIGGRAPH 2004, Los Angeles Carlo H. Séquin and Ling Xiao EECS Computer Science Division University of California, Berkeley Fair LVC Curves on Subdivision.
Smoothing 3D Meshes using Markov Random Fields
Shape from Contours and Multiple Stereo A Hierarchical, Mesh-Based Approach Hendrik Kück, Wolfgang Heidrich, Christian Vogelgsang.
Reflection Applets Plane Mirror Image Applets Double Mirror Images
Randomized Cuts for 3D Mesh Analysis
C F V Light In Side S > 0 Real Object Light Out Side S ’ > 0 Real Image C This Side, R > 0 S < 0 Virtual Object S ’ < 0 Virtual Image C This Side, R
Adaptive Marching Cubes Renben Shu Chen Zhou Mohan S. Kankanhalli.
CS CS 175 – Week 4 Triangle Mesh Smoothing Discrete Differential Geometry.
Multi-Scale Surface Descriptors Gregory Cipriano, George N. Phillips Jr., and Michael Gleicher.
Week 13 - Wednesday CS361.
Morphological Analysis of 3D Scalar Fields based on Morse Theory and Discrete Distortion Mohammed Mostefa Mesmoudi Leila De Floriani Paola Magillo Dept.
11/30/04© University of Wisconsin, CS559 Fall 2004 Last Time More modeling: –Hierarchical modeling –Instancing and Parametric Instancing –Constructive.
1 Three dimensional mosaics with variable- sized tiles Visual Comput 2008 報告者 : 丁琨桓.
Multi-Scale Dual Morse Complexes for Representing Terrain Morphology E. Danovaro Free University of Bolzano, Italy L. De Floriani University of Genova,
C O M P U T E R G R A P H I C S Stuff Jian Chen January 15, 2010 Transformations 1/10 Describing Shape By Andries van Dam.
Review of Geometric Shapes
Reviewing Properties of 3D figures
4/15/04© University of Wisconsin, CS559 Spring 2004 Last Time More modeling: –Hierarchical modeling –Instancing and Parametric Instancing –Constructive.
On-line Space Sculpturing for 3D Shape Manipulation
SIMPLICITY & COMPLETION Walter Gerbino University of Trieste, Italy VBM Montevideo.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
Vertex – A point at which two or more edges meet Edge – A line segment at which two faces intersect Face – A flat surface Vertices, Edges, Faces.
Extracting Terrain Morphology A New Algorithm and a Comparative Evaluation Paola Magillo, Emanuele Danovaro, Leila De Floriani, Laura Papaleo, Maria Vitali.
Section 8.4 Nack/Jones1 Section 8.4 Polyhedrons & Spheres.
Solid Geometry - Objectives Classify three-dimensional figures according to their properties. Use nets and cross sections to analyze three-dimensional.
Subdivision Schemes Basic idea: Start with something coarse, and refine it into smaller pieces for rendering –We have seen how subdivision may be used.
Chapter 12 Section 1 Exploring Solids Using Properties of Polyhedra Using Euler’s Theorem Richard Resseguie GOAL 1GOAL 2.
Week 24 - Vocabulary 3-Dimensional Figures.
1 Compressing Triangle Meshes Leila De Floriani, Paola Magillo University of Genova Genova (Italy) Enrico Puppo National Research Council Genova (Italy)
Managing the Level of Detail in 3D Shape Reconstruction and Representation Leila De Floriani, Paola Magillo Department of Computer and Information Sciences.
Computer Graphics Basic 3D Geometry CO2409 Computer Graphics Week 5-1.
By: David Samkutty and Viet Tran Blah ™. Objectives Identify Congruent or Similar Solids State the properties of similar solids.
Reconstruction of Solid Models from Oriented Point Sets Misha Kazhdan Johns Hopkins University.
Light Reflection and Mirrors.  The Law of Reflection  When a wave traveling in two dimensions encounters a barrier, the angle of incidence is equal.
SpaDaGIS Efficiency Issues in Multi-resolution Terrain Modeling Leila De FlorianiPaola Magillo Leila De Floriani * Paola Magillo Department of Computer.
1 Multi-resolution Tetrahedral Meshes Leila De Floriani Department of Computer and Information Sciences University of Genova, Genova (Italy)
12.1 Exploring Solids.
Solid Modeling 2002 A Multi-resolution Topological Representation for Non-manifold Meshes Leila De Floriani, Paola Magillo, Enrico Puppo, Davide Sobrero.
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
MINGLE Mid-Term Meeting (June 26, 2002)1 DISI - University of Genova Leila De Floriani MINGLE Mid-Term Meeting St. Malo, June 26, 2002.
Section 12-1 Exploring Solids. Polyhedron Three dimensional closed figure formed by joining three or more polygons at their side. Plural: polyhedra.
Exploring Solids and Shapes. Basic Definitions Face: A flat surface on a solid figure. Edge: A line segment where two faces meet Vertex: A point where.
ACM-GIS Morphology-Driven Simplification and Multiresolution Modeling of Terrains Emanuele Danovaro, Leila De Floriani, Paola Magillo, Mohammed.
Perpendicular and Angle Bisectors Perpendicular Bisector – A line, segment, or ray that passes through the midpoint of a side of a triangle and is perpendicular.
A Combined Geometrical and Topological Simplification Hierarchy for Terrain Analysis Leila De Floriani University of Genova Federico Iuricich University.
Illumination and Shading. Illumination (Lighting) Model the interaction of light with surface points to determine their final color and brightness OpenGL.
9-1B Surface Area of Pyramids
POLYGON MESH Advance Computer Graphics
CSC461: Lecture 23 Shading Computation
12.1 Exploring Solids.
Introduction to Computer Graphics with WebGL
12-1 Properties of Polyhedra
Lesson 10.3 Three-Dimensional Figures
Computing Vertex Normals from Arbitrary Meshes
Gaussian Curvature Mean Curvature
Objectives Classify three-dimensional figures according to their properties. Use nets and cross sections to analyze three-dimensional figures.
12.1-D Figures Objective: students will be able to identify the attributes of 3-d figures.
I have 4 faces. I have 6 edges. I have 4 vertices.
A polygon is a plane figure with three or more than three segments.
Presentation transcript:

Discrete Distortion for Surface Meshes Mohammed Mostefa Mesmoudi Leila De Floriani Paola Magillo Dept. of Computer Science, University of Genova, Italy

Outline 1.Context, motivation, contribution… 2.Discrete distortion: idea 3.Definition and properties 4.Experimental results 5.Conclusions and future work

Outline 1.Context, motivation, contribution… 2.Discrete distortion: idea 3.Definition and properties 4.Experimental results 5.Conclusions and future work

C 2 -continuous surface Curvature at any point Discrete surface model: triangle mesh Approximation of curvature at mesh vertices Aim of the work

What is Curvature for? Gaussian curvature Mean curvature  Morphological shape analysis: classify points of the surface...

What is Curvature for? Sign of mean curvature + convex/ saddle - concave/ saddle Sign of Gaussian curvature + convex/concave - saddle convex saddle 0 flat 0 flat/saddle flat [imposs.] saddle concave saddleridge valley

Contribution C 2 -continuous surface Mean curvature at any point Discrete surface model: triangle mesh Approximation of mean curvature at mesh vertices Discrete distortion

Outline 1.Context, motivation, contribution… 2.Discrete distortion: idea 3.Definition and properties 4.Experimental results 5.Conclusions and future work

Distortion: Idea Triangle mesh (with orientation) p (internal) vertex triangles incident in p p

Distortion: Idea Consider a local tetrahedralization extenderd below the surface p

Distortion: Idea Consider a local tetrahedralization extenderd below the surface p

Distortion: Idea Consider the trihedral angles of tetrahedra defined by each three faces incident in p p

Distortion: Idea Solid angle at p = sum of all such angles p

Distortion: Idea If the mesh is flat at p… p

Distortion: Idea Then the solid angle is 2  (equivalent to the area of half a sphere) p

Distortion: Idea Then the solid angle is 2  (equivalent to the area of half a sphere) p

Distortion: Idea If the mesh is not flat at p… p

Distortion: Idea If the mesh is not flat at p… p

Distortion: Idea If the mesh is not flat at p… p

Distortion: Idea Then we measure how much the solid angle is different from 2  p

Outline 1.Context, motivation, contribution… 2.Discrete distortion: idea 3.Definition and properties 4.Experimental results 5.Conclusions and future work

Distortion: Definition Triangle mesh (with orientation) p internal vertex Definition of vertex distortion: D(p) = 2  – (solid angle at p) 

Distortion: Definition Definition of vertex distortion: D(p) = 2  – (solid angle at p)  flat  convex  concave p p

Distortion: Definition Definition of vertex distortion: D(p) = 2  – (solid angle at p) But we compute it in a simpler way…

Distortion: Computation Definition of bond distortion for an edge e: D(e) =  – (dihedral angle at e) Theorem: D(p) =  D(e) over e incident edges in p e

Distortion and Mean Curvature We use the Connolly function to show the relation between : –Mean curvature –Discrete distortion

C 2 -smooth surface (with orientation) p vertex sphere with center in p and radius r r small enough Definition of Connolly function: C(p,r) = (area of sphere part lying under the surface) r 2 Connolly Function (continuous case) p

Connolly Function (discrete case) Triangle mesh (with orientation): p vertex sphere with center in p and radius r r smaller than edges incident in p Connolly function becomes : C(p,r) = solid angle at p  Discrete distortion D(p) = 2  - C(p,r) p

Distortion and Mean Curvature Lemma [from Cazals, Chazals and Lewiner, 2003]: C 2 -smooth surface p internal point H(p) mean curvature at p C(p,r) = 2  +  H(p) r + … other term more fastly tending to 0 with r

Distortion and Mean Curvature C(p,r) Connolly function… Mean curvature C(p,r) ≈ 2  +  H(p) r, for small r Discrete distortion D(p) = 2  - C(p,r)    D(p) ≈ -  H(p) r  For fixed r their behavior is almost the same (up to a constant factor)…

Outline 1.Context, motivation, contribution… 2.Discrete distortion: idea 3.Definition and properties 4.Experimental results 5.Conclusions and future work

Experiments Compare: –Discrete distortion –A commonly used estimator for mean curvature: Mean angle deficit Color scale: from blue (min) to red (max)

Mount Marcy Distortion Mean angle deficit

Kitten Distortion Mean angle deficit

Retinal molecule Distortion Mean angle deficit

Mechanical piece (used piece) Distortion Mean angle deficit

Results Discrete distortion better adapts to surface shape Less sensitive to noise More effective in enhancing convex / concave areas

Outline 1.Context, motivation, contribution… 2.Discrete distortion: idea 3.Definition and properties 4.Experimental results 5.Conclusions and future work

Conclusions Discrete distortion is a good estimate for mean curvature of triangle meshes Discrete distortion provides an easier way to evaluate the Connoly function

Future Work  Many applications fields: physics of particle, chemistry…  Optimization of triangle meshes based on distortion

Acnowledgements This work has been partially supported by: Italian National Science Foundation MIUR-FIRB Project Shalom

End of the talk Thank you! Question?

Related Work Analytic methods: approximate the triangle mesh with a smooth function and compute curvature in the continuum (problems: big meshes, which function) Discrete methods: Methods that divide by area Concentrated curvature (for Gaussian curvature) Other discrete methods…