You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
70 lines
2.0 KiB
70 lines
2.0 KiB
1 year ago
|
#include <test_common.h>
|
||
|
|
#include <igl/intrinsic_delaunay_cotmatrix.h>
|
||
|
|
#include <igl/EPS.h>
|
||
|
|
#include <igl/triangulated_grid.h>
|
||
|
|
#include <igl/is_border_vertex.h>
|
||
|
|
|
||
|
|
TEST_CASE("intrinsic_delaunay_cotmatrix: skewed_grid", "[igl]")
|
||
|
|
{
|
||
|
|
Eigen::MatrixXd V;
|
||
|
|
Eigen::MatrixXi F;
|
||
|
|
const int s = 7;
|
||
|
|
igl::triangulated_grid(s,s,V,F);
|
||
|
|
// Skew against diagonal direction
|
||
|
|
V.col(0) -= 1.1*V.col(1);
|
||
|
|
Eigen::SparseMatrix<double> L;
|
||
|
|
Eigen::MatrixXi F_intrinsic;
|
||
|
|
Eigen::MatrixXd l_intrinsic;
|
||
|
|
igl::intrinsic_delaunay_cotmatrix(V,F,L,l_intrinsic,F_intrinsic);
|
||
|
|
Eigen::VectorXi LI,LJ;
|
||
|
|
Eigen::VectorXd LV;
|
||
|
|
igl::find(L,LI,LJ,LV);
|
||
|
|
const auto is_boundary_edge = [](const int i, const int j, const int s)->bool
|
||
|
|
{
|
||
|
|
const auto is_boundary_vertex = [](const int i, const int s)->bool
|
||
|
|
{
|
||
|
|
return (i<s) || (i>=s*s-s) || (i%s == 0) || (i%s == s-1);
|
||
|
|
};
|
||
|
|
return is_boundary_vertex(i,s) && is_boundary_vertex(j,s);
|
||
|
|
};
|
||
|
|
// Off diagonals should be all non-positive
|
||
|
|
for(int k = 0;k<LI.size();k++)
|
||
|
|
{
|
||
|
|
if(LI(k) != LJ(k) && !is_boundary_edge(LI(k),LJ(k),s))
|
||
|
|
{
|
||
|
|
REQUIRE (-igl::EPS<double>() < LV(k));
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
TEST_CASE("intrinsic_delaunay_cotmatrix: manifold_meshes", "[igl]" "[slow]")
|
||
|
|
{
|
||
|
|
auto test_case = [](const std::string ¶m)
|
||
|
|
{
|
||
|
|
Eigen::MatrixXd V;
|
||
|
|
Eigen::MatrixXi F;
|
||
|
|
igl::read_triangle_mesh(test_common::data_path(param), V, F);
|
||
|
|
Eigen::SparseMatrix<double> L;
|
||
|
|
Eigen::MatrixXi F_intrinsic;
|
||
|
|
Eigen::MatrixXd l_intrinsic;
|
||
|
|
igl::intrinsic_delaunay_cotmatrix(V,F,L,l_intrinsic,F_intrinsic);
|
||
|
|
Eigen::VectorXi LI,LJ;
|
||
|
|
Eigen::VectorXd LV;
|
||
|
|
igl::find(L,LI,LJ,LV);
|
||
|
|
|
||
|
|
const std::vector<bool> is_boundary_vertex = igl::is_border_vertex(F);
|
||
|
|
// Off diagonals should be all non-positive
|
||
|
|
for(int k = 0;k<LI.size();k++)
|
||
|
|
{
|
||
|
|
if(LI(k) != LJ(k) &&
|
||
|
|
!(is_boundary_vertex[LI(k)] && is_boundary_vertex[LJ(k)]))
|
||
|
|
{
|
||
|
|
REQUIRE (-igl::EPS<double>() < LV(k));
|
||
|
|
}
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
test_common::run_test_cases(test_common::manifold_meshes(), test_case);
|
||
|
|
}
|
||
|
|
|