Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion main.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@ int main(int argc, char *argv[])
Eigen::MatrixXi F;
double lambda = 1e-5;
igl::read_triangle_mesh(
(argc>1?argv[1]:"../shared/data/bunny.off"),OV,F);
(argc>1?argv[1]:"../shared/data/decimated-knight.off"),OV,F);
// Load data into MatrixXd rather than VectorXd for simpler `smooth` API
// Just use y-coordinates as data to be smoothed
Eigen::MatrixXd G = OV.col(1);
Expand Down
25 changes: 24 additions & 1 deletion src/cotmatrix.cpp
Original file line number Diff line number Diff line change
@@ -1,10 +1,33 @@
#include "cotmatrix.h"
#include "math.h"

double cot(double a,double b,double c){
double s=(a+b+c)/2;
double area=sqrt(s*(s-a)*(s-b)*(s-c));
double sin=area*2/b/c;
double cos=(b*b+c*c-a*a)/2/b/c;
return cos/sin;
}

void cotmatrix(
const Eigen::MatrixXd & l,
const Eigen::MatrixXi & F,
Eigen::SparseMatrix<double> & L)
{
// Add your code here
L.resize(F.maxCoeff()+1,F.maxCoeff()+1);
int f=F.rows();
double c;
typedef Eigen::Triplet<double> T;
std::vector<T> list;
for (int i=0; i<f; i++){
for (int j=0; j<3; j++){
c=cot(l(i,j),l(i,(j+1)%3),l(i,(j+2)%3))/2;
list.push_back(T(F(i,(j+1)%3),F(i,(j+2)%3),c));
list.push_back(T(F(i,(j+2)%3),F(i,(j+1)%3),c));
list.push_back(T(F(i,(j+1)%3),F(i,(j+1)%3),-c));
list.push_back(T(F(i,(j+2)%3),F(i,(j+2)%3),-c));
}
}
L.setFromTriplets(list.begin(), list.end());
}

14 changes: 13 additions & 1 deletion src/massmatrix.cpp
Original file line number Diff line number Diff line change
@@ -1,10 +1,22 @@
#include "massmatrix.h"
#include "math.h"

void massmatrix(
const Eigen::MatrixXd & l,
const Eigen::MatrixXi & F,
Eigen::DiagonalMatrix<double,Eigen::Dynamic> & M)
{
// Add your code here
int f=F.rows();
M.resize(F.maxCoeff()+1);
Eigen::VectorXd area=Eigen::VectorXd::Zero(F.maxCoeff()+1);
double s,a;
for (int i=0; i<f; i++){
s=(l(i,0)+l(i,1)+l(i,2))/2;
a=sqrt(s*(s-l(i,0))*(s-l(i,1))*(s-l(i,2)));
for (int j=0; j<3; j++){
area(F(i,j))+=a;
}
}
M=1.0/3*area.asDiagonal();
}

24 changes: 22 additions & 2 deletions src/smooth.cpp
Original file line number Diff line number Diff line change
@@ -1,4 +1,8 @@
#include "smooth.h"
#include <Eigen/Cholesky>
#include <igl/edge_lengths.h>
#include "massmatrix.h"
#include "cotmatrix.h"

void smooth(
const Eigen::MatrixXd & V,
Expand All @@ -7,6 +11,22 @@ void smooth(
double lambda,
Eigen::MatrixXd & U)
{
// Replace with your code
U = G;
Eigen::MatrixXd l;
Eigen::SparseMatrix<double> L,A;
Eigen::DiagonalMatrix<double,Eigen::Dynamic> M;
igl::edge_lengths(V, F, l);
cotmatrix(l,F,L);
massmatrix(l,F,M);
Eigen::MatrixXd b=M*G;
typedef Eigen::Triplet<double> T;
std::vector<T> list;
Eigen::VectorXd M1=M.diagonal();
for (int i=0; i<M1.size(); i++)
list.push_back(T(i,i,M1(i)));
A.resize(M.rows(),M.rows());
A.setFromTriplets(list.begin(), list.end());
A-=lambda*L;
Eigen::SimplicialLDLT<Eigen::SparseMatrix<double>> solver;
solver.compute(A);
U=solver.solve(b);
}