In the last lecture we introduced the Laplace operator from the smooth point of of view; in this lecture we talk about how to discretize it, and show that from computational point of view it really is the —Swiss army knife— of geometry processing algorithms—essentially playing the role of the discrete Fourier transform from classical signal processing.
You can find a video lecture for these slides, from a talk given by Etienne Vouga, here. (We’ll have our own lecture in-class! This one is just for reference/for anyone who is sick, etc.)
