In this part, I use a sparse matrix to represent the laplacian matrix in the memory, and use the Directed Sparse Solver (DSS) Interface Routines from Intel Math Kernel Library to solve sparse linear system.
Here I demonstrate the result of mesh reconstruction. I anchored one vertex of the mesh, so the left hand side matrix is exactly full-rank, which can be solved perfectly.
