Introduction Slides Coding

Digital Geometry Processing


Xiao-Ming Fu       University of Science and Technology of China


This course provides an introduction to digital geometry processing, a subfield of computer graphics. This course will cover basic mathematical foundations for studying 3D surfaces from a discrete differential geometric standpoint and present the full geometry processing pipeline, including mesh representation, mesh smoothing, parameterization, remeshing, decimation and surface deformation.


1. Representation
2. Discrete Differential Geometry
3. Smoothing
4. Parameterizations


1. Basic training
Reference: Shortest path (Dijkstra’s algorithm) and minimal spanning tree on the triangular mesh
Deadline: 23:59 2020/3/14

2. Curvature estimation and visualization
Deadline: 23:59 2020/3/21

3. Mesh Smoothing
Reference: Bilateral Normal Filtering for Mesh Denoising
Deadline: 23:59 2020/3/28

4. Mesh Parameterization 1
Reference: Tutte's embedding method
Deadline: 23:59 2020/4/4

5. Mesh Parameterization 2
Reference: A Local/Global Approach to Mesh Parameterization
Deadline: 23:59 2020/4/11

6. Mesh Deformation
Reference: As-Rigid-As-Possible Surface Modeling
Deadline: 23:59 2020/4/18

7. Barycentric Coordinates
Reference: Mean value coordinates
Deadline: 23:59 2020/4/25

8. Mesh Simplification
Reference: Surface Simplification Using Quadric Error Metrics
Deadline: 23:59 2020/5/2

9. Mesh Interpolation
Reference: As-Rigid-As-Possible Shape Interpolation
Deadline: 23:59 2020/5/9

10. Lloyd’s iteration algorithm
Reference: Variational shape approximation
Deadline: 23:59 2020/5/16

11. Remeshing
Reference: A Remeshing Approach to Multiresolution Modeling
Deadline: 23:59 2020/5/23

12. Optimal Delaunay triangulation
Reference: Optimal Delaunay triangulation
Deadline: 23:59 2020/5/30

13. Cross Fields
Reference: Designing N-polyvector fields with complex polynomials
Deadline: 23:59 2020/6/13

14. Geometric Optimization
Reference: Scalable Locally Injective Mappings
Deadline: 23:59 2020/6/27