Some elementary algorithms on discrete differential geometry(DDGSpring2016 Demos)

I studied the on-line course(http://brickisland.net/DDGSpring2016/) by myself, and here are the screenshots of my implements(https://github.com/yaoyansi/DDGSpring2016) on some algorithms.

equally-weighted normal

area-weighted normals

angle-weighted normals

mean curvature normal

sphere-inscribed normal

Pick some vertexes and set the values, then construct the discrete Laplacian operator and solve the Poisson equation.

Perform one step of your mean curvature flow on the mesh to smooth the mesh

step size = 0.01

step size = 0.02

step size = 0.05

Decompose a vector field into 3 components: exact(curl-free), coexact(div-free), harmonic(curl-free&div-free)

top left, top right, down left, down right:  vector field, exact, coexact, harmonic