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.


All slides


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

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

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

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

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

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

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

8. Mesh Interpolation
Reference: As-Rigid-As-Possible Shape Interpolation
Deadline: 23:59 2020/4/26

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

10. Cross Fields
Reference: Designing N-polyvector fields with complex polynomials
Deadline: 23:59 2020/5/17

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

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

13. Lloyd’s iteration algorithm
Reference: Variational shape approximation
Deadline: 23:59 2020/6/7

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