Completed
Robustness as a subroutine build a better Laplace matrix
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Discrete Surface Geometry and Intrinsic Triangulations
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Surface meshes
- 3 Gradients and vector fields
- 4 There is no perfect mesh
- 5 Robust geometry processing
- 6 Gaussian curvature revisited
- 7 Basic idea intrinsic edge lengths
- 8 A brief history of intrinsic triangulations
- 9 Euclidean intrinsic triangles a larger space of triangulations
- 10 Intrinsic is enough
- 11 Perspective: cone metrics
- 12 A non-embeddable intrinsic triangulatio
- 13 Key idea: a larger space of triangulation
- 14 Intrinsic edge flips
- 15 Properties of intrinsic triangulations
- 16 Better intrinsic meshes
- 17 Delaunay edge flips
- 18 Proof sketch
- 19 Intrinsic Delaunay triangulations many characterizations & properties
- 20 Better basis functions
- 21 A-complex
- 22 Intrinsic Delaunay refinement
- 23 Applications
- 24 Nonmanifold intrinsic triangulations
- 25 Robustness as a subroutine build a better Laplace matrix
- 26 Nonmanifold meshes
- 27 Resolving nonmanifoldness assembling the tufted cover
- 28 The tufted cover vertex-nonmanifold almost everywhere
- 29 Improving algorithms
- 30 Properties bounded interpolation
- 31 Delaunay flipping distance a motivating example
