Welcome to CSE 270 "Discrete Differential Geometry"
| Week | Monday (Discussion) | Tuesday (Lecture) | Thursday (Lecture) |
|---|---|---|---|
| 0 | 9/23: | 9/25: Introduction
|
|
| 1 | 9/30: Calculus on Manifolds | 10/2: Calculus on Manifolds | |
| 2 | 10/7: Meshes, Euler Characteristics | 10/9: Euler Characteristics, Mesh data structure, Exterior calculus | |
| 3 | 10/14: Exterior calculus, Discrete Exterior Calculus | 10/16: Exterior calculus and DEC | |
| 4 | 10/21: Discrete exterior calculus | 10/23: Applications of Laplacian | |
| 5 |
Wave simulation houdini file (wave simulation) |
10/28: Curves | 10/30: (No class) Curves
|
| 6 |
Curve flow houdini file (curve flow) |
11/4: Space curves, Surface overview
|
11/6: Surfaces |
| 7 | 11/11: Veterans Day Holiday | 11/13: Surfaces | |
| 8 | minimal_surface.hipnc | 11/18: Conformal Maps | 11/20: Vector field design |
| 9 | 11/25: No class Hodge Decomposition
|
11/27: Thanksgiving | |
| 10 | Modified Mean Curvature Flow MMCF.zip |
12/2: Fiber Bundles
|
12/4: Geometric measure theory, Lie derivatives
|
| Final | 12/9: No class
|
12/11: No class | |
| Winter break | |||
Discrete Differential Geometry introduces the mathematics and algorithms for digital geometry processing and simulation problems. Think of it as applied differential geometry for computer graphics and computational mathematics.
What is discrete differential geometry? In the traditional approach for many computational and engineering problems, one (1) derives the governing equation with multivariable calculus on a coordinate system; (2) applies a generic discretization scheme (finite difference/finite element) to approximate the solution. This direction becomes extremely tedious as the domain of the problem becomes a more general shape (as often encountered in computer aided designs and computer graphics), where no natural coordinate system may fit the geometry featured in the problem. Also, discretization schemes based on approximation theory don't usually preserve the structures (e.g. conservation laws) of the underlying physical or geometric system.
Discrete differential geometry takes a different route. Starting from the modeling stage (deriving governing equation) all the way to algorithmic stage, we use the language of geometry. It bypasses any artificial coordinate systems, and only speaks about relationships between points, lines, surfaces, and the field defined on top of them. During discretization, we directly find the discrete analogs of these relation, preserving as many differential geometry theorems as possible.
Some highlights:
There is no quiz or exam. The grades are made of the following HWs: