2D/3D Shape Manipulation, 3D Printing

Slides:



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

Mesh Parameterization: Theory and Practice Setting the Boundary Free Mesh Parameterization: Theory and Practice Setting the Boundary Free Bruno Lévy -
As-Rigid-As-Possible Surface Modeling
Chapter 9: Vector Differential Calculus Vector Functions of One Variable -- a vector, each component of which is a function of the same variable.
Developable Surface Fitting to Point Clouds Martin Peternell Computer Aided Geometric Design 21(2004) Reporter: Xingwang Zhang June 19, 2005.
Differential Geometry
Differential geometry I
Active Contours, Level Sets, and Image Segmentation
Surface normals and principal component analysis (PCA)
Discrete Differential Geometry Planar Curves 2D/3D Shape Manipulation, 3D Printing March 13, 2013 Slides from Olga Sorkine, Eitan Grinspun.
Application of Angle-Preserving Parameterization: Remeshing.
Spectral methods 1 © Alexander & Michael Bronstein,
Geometric Modeling Notes on Curve and Surface Continuity Parts of Mortenson, Farin, Angel, Hill and others.
Extended Gaussian Images
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 10 Ravi Ramamoorthi
Mesh Parameterization: Theory and Practice Differential Geometry Primer.
Siggraph Course Mesh Parameterization: Theory and Practice
Discrete Exterior Calculus. More Complete Introduction See Chapter 7 “Discrete Differential Forms for Computational Modeling” in the SIGGRAPH 2006 Discrete.
2D/3D Shape Manipulation, 3D Printing
Discrete Geometry Tutorial 2 1
3D Surface Parameterization Olga Sorkine, May 2005.
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Image Segmentation and Active Contour
Corp. Research Princeton, NJ Computing geodesics and minimal surfaces via graph cuts Yuri Boykov, Siemens Research, Princeton, NJ joint work with Vladimir.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl.
A Sketch-Based Interface for Detail-Preserving Mesh Editing Andrew Nealen Olga Sorkine Marc Alexa Daniel Cohen-Or.
CS CS 175 – Week 4 Triangle Mesh Smoothing Signal Processing, Diffusion, Curvature Flow.
Bounded-distortion Piecewise Mesh Parameterization
CS CS 175 – Week 2 Processing Point Clouds Local Surface Properties, Moving Least Squares.
Polygonal Mesh – Data Structure and Smoothing
Differential geometry II
FiberMesh: Designing Freeform Surfaces with 3D Curves
CS Subdivision I: The Univariate Setting Peter Schröder.
CS CS 175 – Week 4 Triangle Mesh Smoothing Discrete Differential Geometry.
Laplacian Surface Editing
Informatik VIII Computer Graphics & Multimedia Martin Marinov and Leif Kobbelt Direct Quad-Dominated Anisotropic Remeshing Martin Marinov and Leif Kobbelt.
Parameterization.
Intrinsic Parameterization for Surface Meshes Mathieu Desbrun, Mark Meyer, Pierre Alliez CS598MJG Presented by Wei-Wen Feng 2004/10/5.
Ch. 10 Vector Integral Calculus.
Paths, Smoothing, Least Squares Fit CS 551/651 Spring 2002.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
Mesh Deformation Based on Discrete Differential Geometry Reporter: Zhongping Ji
Scalable and Fully Distributed Localization With Mere Connectivity.
2D/3D Shape Manipulation, 3D Printing Shape Representations Slides from Olga Sorkine February 20, 2013 CS 6501.
Course 13 Curves and Surfaces. Course 13 Curves and Surface Surface Representation Representation Interpolation Approximation Surface Segmentation.
Computer Graphics Some slides courtesy of Pierre Alliez and Craig Gotsman Texture mapping and parameterization.
INFORMATIK Laplacian Surface Editing Olga Sorkine Daniel Cohen-Or Yaron Lipman Tel Aviv University Marc Alexa TU Darmstadt Christian Rössl Hans-Peter Seidel.
Surface Meshing Material tret de: S. J. Owen, "A Survey of Unstructured Mesh Generation Technology", Proceedings 7th International Meshing Roundtable,
Fundamentals of Differential Geometry ( Part 2 )
Andrew Nealen / Olga Sorkine / Mark Alexa / Daniel Cohen-Or SoHyeon Jeong 2007/03/02.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
Artistic Surface Rendering Using Layout Of Text Tatiana Surazhsky Gershon Elber Technion, Israel Institute of Technology.
Ship Computer Aided Design MR 422. Geometry of Curves 1.Introduction 2.Mathematical Curve Definitions 3.Analytic Properties of Curves 4.Fairness of Curves.
Geometric Modeling with Conical Meshes and Developable Surfaces SIGGRAPH 2006 Yang Liu, Helmut Pottmann, Johannes Wallner, Yong-Liang Yang and Wenping.
Construction of Navau and Garcia. Basic steps Construction has two parameters: smoothness k and n > k, defining how closely the surface follows the control.
ECCV Tutorial Mesh Processing Discrete Exterior Calculus
Ship Computer Aided Design
Data Visualization Fall The Data as a Quantity Quantities can be classified in two categories: Intrinsically continuous (scientific visualization,
Digital Image Processing Lecture 17: Segmentation: Canny Edge Detector & Hough Transform Prof. Charlene Tsai.
Recent Progress in Mesh Parameterization Speaker : ZhangLei.
Rongjie Lai University of Southern California Joint work with: Jian Liang, Alvin Wong, Hongkai Zhao 1 Geometric Understanding of Point Clouds using Laplace-Beltrami.
Variational Tetrahedral Meshing
Detection of discontinuity using
Advanced Computer Graphics
Plane and Space Curves Curvature-based Features
Morphing and Shape Processing
1st semester a.y. 2018/2019 – November 22, 2018
Presentation transcript:

2D/3D Shape Manipulation, 3D Printing CS 6501 2D/3D Shape Manipulation, 3D Printing Discrete Differential Geometry Surfaces Slides from Olga Sorkine, Eitan Grinspun

Surfaces, Parametric Form Continuous surface Tangent plane at point p(u,v) is spanned by n pu pv p(u,v) v u

Isoparametric Lines Lines on the surface when keeping one parameter fixed v u

Surface Normals Surface normal: n pv pu Assuming regular parameterization, i.e., n pu pv p(u,v) v u

Normal Curvature n pv pu p t Direction t in the tangent plane (if pu and pv are orthogonal): t  Tangent plane

Normal Curvature n() = ((p)) n pv pu p t  The curve  is the intersection of the surface with the plane through n and t. Normal curvature: n() = ((p)) Make video of the normal plane? t  Tangent plane

Surface Curvatures Principal curvatures Mean curvature Maximal curvature Minimal curvature Mean curvature Gaussian curvature

Principal Directions Principal directions: tangent vectors corresponding to max and min t2 t1  max min curvature max curvature tangent plane

Principal Directions תמונה Euler’s Theorem: Planes of principal curvature are orthogonal and independent of parameterization.

Principal Directions תמונה

Mean Curvature Intuition for mean curvature

Classification A point p on the surface is called Elliptic, if K > 0 Parabolic, if K = 0 Hyperbolic, if K < 0 Umbilical, if Developable surface iff K = 0

Local Surface Shape By Curvatures K > 0, 1= 2 K = 0 Isotropic: all directions are principal directions spherical (umbilical) planar 2 > 0, 1 > 0 2 = 0 1 > 0 2 < 0 K > 0 K = 0 K < 0 Anisotropic: 2 distinct principal directions elliptic parabolic hyperbolic

Gauss-Bonnet Theorem For a closed surface M:

Gauss-Bonnet Theorem For a closed surface M: Compare with planar curves:

Fundamental Forms First fundamental form Second fundamental form Together, they define a surface (given some compatibility conditions) Intuitive explanation for I and II!

Fundamental Forms I and II allow to measure length, angles, area, curvature arc element area element here is just I, maybe add things that II measures…

Intrinsic Geometry Properties of the surface that only depend on the first fundamental form length angles Gaussian curvature (Theorema Egregium)

Laplace Operator gradient operator 2nd partial derivatives function in Euclidean space Cartesian coordinates divergence operator

Laplace-Beltrami Operator Extension of Laplace to functions on manifolds gradient operator Laplace- Beltrami function on surface M divergence operator

Laplace-Beltrami Operator For coordinate functions: gradient operator mean curvature Laplace- Beltrami unit surface normal function on surface M divergence operator

Differential Geometry on Meshes Assumption: meshes are piecewise linear approximations of smooth surfaces Can try fitting a smooth surface locally (say, a polynomial) and find differential quantities analytically But: it is often too slow for interactive setting and error prone

Discrete Differential Operators Approach: approximate differential properties at point v as spatial average over local mesh neighborhood N(v) where typically v = mesh vertex Nk(v) = k-ring neighborhood

Discrete Laplace-Beltrami Uniform discretization: L(v) or ∆v Depends only on connectivity = simple and efficient Bad approximation for irregular triangulations vi vj

Discrete Laplace-Beltrami Intuition for uniform discretization

Discrete Laplace-Beltrami Intuition for uniform discretization vi-1 vi vi+1 

Discrete Laplace-Beltrami Intuition for uniform discretization vj1 vj2 vi vj6 vj3 vj5 vj4

Discrete Laplace-Beltrami Cotangent formula Ai vi vj ij ij

Voronoi Vertex Area Unfold the triangle flap onto the plane (without distortion) vi θ vj

Voronoi Vertex Area vi vj needs a better picture and definition! θ Flattened flap vi vi θ cj+1 cj vj needs a better picture and definition!

Discrete Laplace-Beltrami Cotangent formula Accounts for mesh geometry Potentially negative/ infinite weights

Discrete Laplace-Beltrami Cotangent formula Can be derived using linear Finite Elements Nice property: gives zero for planar 1-rings!

Discrete Laplace-Beltrami vi Uniform Laplacian Lu(vi) Cotangent Laplacian Lc(vi) Mean curvature normal b a vj

Discrete Laplace-Beltrami vi Uniform Laplacian Lu(vi) Cotangent Laplacian Lc(vi) Mean curvature normal For nearly equal edge lengths Uniform ≈ Cotangent b a vj

Discrete Laplace-Beltrami vi Uniform Laplacian Lu(vi) Cotangent Laplacian Lc(vi) Mean curvature normal For nearly equal edge lengths Uniform ≈ Cotangent b a vj Cotan Laplacian allows computing discrete normal

Discrete Curvatures Mean curvature (sign defined according to normal) Gaussian curvature Principal curvatures Ai j

Discrete Gauss-Bonnet Theorem Total Gaussian curvature is fixed for a given topology

Example: Discrete Mean Curvature

Links and Literature M. Meyer, M. Desbrun, P. Schroeder, A. Barr Discrete Differential-Geometry Operators for Triangulated 2-Manifolds, VisMath, 2002

Links and Literature P. Alliez, Estimating Curvature Tensors on Triangle Meshes, Source Code http://www-sop.inria.fr/geometrica/team/Pierre.Alliez/demos/curvature/ principal directions

Measuring Surface Smoothness

Links and Literature Grinspun et al.:Computing discrete shape operators on general meshes, Eurographics 2006

Reflection Lines as an Inspection Tool Shape optimization using reflection lines E. Tosun, Y. I. Gingold, J. Reisman, D. Zorin Symposium on Geometry Processing 2007

Reflection Lines as an Inspection Tool Shape optimization using reflection lines E. Tosun, Y. I. Gingold, J. Reisman, D. Zorin Symposium on Geometry Processing 2007

Thank You