Mark Pauly
Outline
Differential Geometry
curvature fundamental forms Laplace-Beltrami operator
Mark Pauly
Differential Geometry
Continuous surface
x(u, v) x(u, v) = y(u, v) , (u, v) I 2 R z(u, v)
Normal vector
n = (xu xv )/ xu xv
Differential Geometry
Normal Curvature
xu xv n= xu x v
xv
p
xu
t
xv xu + sin t = cos xu xv
Mark Pauly
Differential Geometry
Normal Curvature
xu xv n= xu x v
c
p
n
t
xv xu + sin t = cos xu xv
Mark Pauly
Differential Geometry
Principal Curvatures
maximum curvature 1 = max n ()
Mean Curvature
1 1 + 2 = H= 2 2
n ()d
0
Gaussian Curvature K = 1 2
Mark Pauly 6
Differential Geometry
Normal curvature is dened as curvature of the normal curve c x(u, v) at a point p c Can be expressed in terms of fundamental forms as 2 2 T
II ea + 2f ab + gb t = t n (t) T I = Ea2 + 2F ab + Gb2 t t
n
t = axu + bxv
Mark Pauly
Differential Geometry
First fundamental form
I= E F F G := xT xu u xT xv u x T xv u x T xv v
Mark Pauly
Differential Geometry
I and II allow to measure
length, angles, area, curvature arc element
Mark Pauly
Differential Geometry
Intrinsic geometry: Properties of the surface that only depend on the rst fundamental form
length angles Gaussian curvature (Theorema Egregium)
6r 3C(r) K = lim r0 r3
Mark Pauly
10
Differential Geometry
A point x on the surface is called
elliptic, if K > 0 parabolic, if K = 0 hyperbolic, if K < 0 umbilical, if 1 = 2
Developable surface
K=0
Mark Pauly
11
Laplace Operator
Laplace operator gradient operator 2nd partial derivatives
f = div f =
i
2f x2 i
Cartesian coordinates
divergence operator
Mark Pauly
12
Laplace-Beltrami Operator
Extension of Laplace to functions on manifolds
LaplaceBeltrami gradient operator
S f = divS
Sf
function on manifold S
divergence operator
Mark Pauly
13
Laplace-Beltrami Operator
Extension of Laplace to functions on manifolds
LaplaceBeltrami gradient operator mean curvature
S x = divS
coordinate function
Sx
= 2Hn
surface normal
divergence operator
Mark Pauly
14
Outline
Differential Geometry
curvature fundamental forms Laplace-Beltrami operator
Mark Pauly
15
Mark Pauly
16
Discrete Laplace-Beltrami
Uniform discretization
1 uni f (v) := |N1 (v)| (f (vi ) f (v))
vi N1 (v)
depends only on connectivity simple and efcient bad approximation for irregular triangulations
Mark Pauly
17
Discrete Laplace-Beltrami
Cotangent formula
2 S f (v) := A(v)
v v
A(v)
vi
i
vi vi
Mark Pauly
18
Discrete Laplace-Beltrami
Cotangent formula
2 S f (v) := A(v)
Problems
negative weights depends on triangulation
Mark Pauly
19
Discrete Curvatures
Mean curvature
H = S x
Gaussian curvature
G = (2
j
A
j
j )/A
Principal curvatures
1 = H + H2 G
Mark Pauly
2 = H
H2 G
20
Wardetzky, Mathur, Kaelberer, Grinspun: Discrete Laplace Operators: No free lunch, SGP 2007
principal directions
Mark Pauly
21
Outline
Differential Geometry
curvature fundamental forms Laplace-Beltrami operator
Mark Pauly
22
Mesh Quality
Smoothness
continuous differentiability of a surface (Ck)
Fairness
aesthetic measure of well-shapedness principle of simplest shape fairness measures from physical models
2 + 2 dA 2 1
S 2 2
1 t1
2 t2
dA
strain energy
Mark Pauly
variation of curvature
23
Mesh Quality
2 + 2 dA 2 1
S
1 t1
2 t2
dA
strain energy
Mark Pauly
variation of curvature
24
Mesh Quality
Visual inspection of sensitive attributes
Specular shading
Mark Pauly
25
Mesh Quality
Visual inspection of sensitive attributes
Specular shading Reection lines
Mark Pauly
26
Mesh Quality
Visual inspection of sensitive attributes
Specular shading Reection lines
differentiability one order lower than surface can be efciently computed using graphics hardware
C0
C1
Mark Pauly
C2
27
Mesh Quality
Visual inspection of sensitive attributes
Specular shading Reection lines Curvature
Mean curvature
Mark Pauly
28
Mesh Quality
Visual inspection of sensitive attributes
Specular shading Reection lines Curvature
Mean curvature Gauss curvature
Mark Pauly
29
Mark Pauly
30
Adaptive tessellation
Low complexity
Mark Pauly
31
Adaptive tessellation
Low complexity
Triangle shape
Numerical robustness
Mark Pauly
32
e2
r2
Mark Pauly
33
Adaptive tessellation
Low complexity
Triangle shape
Numerical robustness
Feature preservation
Low normal noise
Mark Pauly 34
Mark Pauly
35
Mesh Optimization
Smoothness
Mesh smoothing
Adaptive tessellation
Mesh decimation
Triangle shape
Repair, remeshing
Mark Pauly
36