Mark distribution: Assignments (33%), Paper Presentation (25%), Participation (2%), Final Project (40%)
Here lecture materials will appear as we proceed, with no guarantee we'll post everything. So do come to the lectures!
Topics for the future dates are subject to change with no warning, so do not rely on them.
|Thu||8||Sept||Background: Linear Algebra and Optimization||PDF | Notes|
|Tue||19||Sept||Differential Geometry: Curves||PDF | Notes|
|Thu||22||Sept||Differential Geometry: Surfaces||PDF | Notes|
|Thu||29||Sept||Applications of Curvature|
|Tue||4||Oct||Continuous Laplacian||PDF | Notes 1 | 2|
|Thu||13||Oct||Laplacian Applications||PDF | Notes|
|Tue||25||Oct||(no class, reading week)|
|Thu||27||Oct||(no class, reading week)|
|Tue||1||Nov||Applications of Vector Fields|
|Tue||8||Nov||Overview of Computational Geometry|
|Thu||17||Nov||Remeshing||PDF | Notes|
|Tue||22||Nov||Surface Reconstruction||PDF | Notes|
|Thu||24||Nov||Students' paper presentations|
|Tue||6||Dec||Clustering and Segmentation|
|Thu||8||Dec||Final project presentations|
|#||Date Released||Date due||Links|
|1||Sept, 14th||Oct, 4th||Link in Piazza|
|2||Oct, 6th||Oct, 21st||Link in Piazza|
|3||Nov, 3rd||Nov, 18th||Link in Piazza|
Each programming assignment is due 23:59:59 pm on the day specified, measured by Piazza. No late assignments accepted, except for the grace days:
Grace days: Each student may use up to 3 grace days per term. We will keep track of your grace days. Use these as you wish to help manage your time, but use them wisely. You can use all three on one assigment, or one day for each of three assignments. Grace days are counted as integers, i.e., if you are one hour late, that counts as one grace day. Once your grace days are all used, late assignments will receive a grade of zero.
Grading: We will use "face-to-face grading," i.e., you will be required to demonstrate that you understand why your program works. You must be able to explain every single line you wrote! You must get a passing grade in assignments to pass the course.
Each student should present a paper published at SIGGRAPH in the recent years. Every other (non-presenting) student should prepare, read the paper, and ask at least one question. Here's a list of papers to choose from, but feel free to suggest a different interesting paper, prior to my approval.
Please let me know which paper you choose to present by Oct 29th.
In-class paper presentation (10min + 4 min questions): Thu, Nov 24th
Choose any paper published in the recent 5 years in SIGGRAPH (see Ke-Sen Huang's website), propose a modification/improvement, implement, present. Your grade for the project will be 80% for implementation (marked at face-to-face grading), and 20% for the final presentation.
Project proposal: Oct 21st by midnight (1 page, Piazza private post)
Final presentation: Dec 8th, in class (20 min + questions)
Coding: Unless you chose a paper that can be easily done in Matlab or Python, I strongly recommend coding in C++ using libigl: it's easy to use and has a very nice set of tutorials. Clearly, if you're using libigl, you can't implement something that is already implemented in the library.
There is no official textbook for the course, but a lot of material is covered in Polygon Mesh Processing by Botsch et al. More reading materials will appear here as we go.