Overview
Syllabus
Intro
Surface meshes
Gradients and vector fields
There is no perfect mesh
Robust geometry processing
Gaussian curvature revisited
Basic idea intrinsic edge lengths
A brief history of intrinsic triangulations
Euclidean intrinsic triangles a larger space of triangulations
Intrinsic is enough
Perspective: cone metrics
A non-embeddable intrinsic triangulatio
Key idea: a larger space of triangulation
Intrinsic edge flips
Properties of intrinsic triangulations
Better intrinsic meshes
Delaunay edge flips
Proof sketch
Intrinsic Delaunay triangulations many characterizations & properties
Better basis functions
A-complex
Intrinsic Delaunay refinement
Applications
Nonmanifold intrinsic triangulations
Robustness as a subroutine build a better Laplace matrix
Nonmanifold meshes
Resolving nonmanifoldness assembling the tufted cover
The tufted cover vertex-nonmanifold almost everywhere
Improving algorithms
Properties bounded interpolation
Delaunay flipping distance a motivating example
Taught by
Fields Institute