CSE 270 (FA 2025) Discrete Differential Geometry

Welcome to CSE 270 "Discrete Differential Geometry"

  • Lecture: Tue Thu 11:00am - 12:20pm
  • Classroom: CSE Building 4140.
  • Discussion session: Mon 3:00pm - 3:50pm at Ridge Walk Academic Complex (RWAC) 0103.
  • Instructor: Albert Chern (Office Hour: Thu 2:00pm – 3:00pm, CSE building 4112)
    • TA: Hang (Hesper) Yin (Office Hour: Tue 3:00pm – 4:00pm, CSE 4217)
  • Sites:
  • Lecture note: Discrete Differential Geometry

Syllabus

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
  • Slides (Curves)
  • Slides (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
  • Slides (additional topics)
  • Final 12/9: No class
    • HW5 due
    12/11: No class
    Winter break

    Overview

    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:

    • Houdini software: We will use the Houdini software for implementation. It is an industry standard in computer graphics. Most of the assignment in this course involves writing some shader code to manipulate the geometry, and occasionally Python code to solve linear equations.
    • Exterior Calculus: Exterior calculus is an approach to multivariable that is much more resilient to change of coordinates, making differential geometric problem formulation much more elegant.
    • Laplacian: You may have seen the Laplace operator in physics, image processing or other signal processing. It measures the second order derivative of a field. We will build a discrete Laplacian on a general triangulated surface. Many applications in geometry processing is based on solving a linear system with Laplacian.
    • Curves and Surfaces: Many simulation problems involve curves and surfaces. Given such a shape, what are the geometrically meaningful thing that we can measure?
    • Hodge Decomposition: Linear algebra of the differential operators. We can analyze the null space of these problems from the topology of the domain. An application of Hodge decomposition is fluid simulation.
    • Conformal flattening: Find a texture map from a given surface to the plane that preserves angles (no shearing distortion).
    • Vector field design: Find a smoothest tangent vector field on a given surface, and observe singularity nucleates at the optimal location on the surface. This utilizes the formalism of fiber bundles. The underlying theory has its origin in quantum field and condensed matter physics.

    Course Logistics

    Getting Started (make sure to follow it in Week 1)

    1. Sign up to Piazza and Gradescope. 

    Class Rules

    • Do the assignments individually. Discussion is strongly encouraged, since there are many challenging new mathematical concepts and part of the learning experience is to teach your classmates who didn't get it.
    • You can look up coding/math questions online. You are also welcomed to post questions (and answer others' questions) on Piazza.
    • Follow Academic Integrity (c.f. https://senate.ucsd.edu/Operating-Procedures/Senate-Manual/Appendices/2).

    Grades

    There is no quiz or exam. The grades are made of the following HWs:

    • HW1: 20%
    • HW2: 20%
    • HW3: 20%
    • HW4: 20%
    • HW5: 20%
    The final letter grade depends on the grade distribution.

    Late policy

    • HW1–5 late penalty: You have one quota of using a 24 hour extension.

    Homework