songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

add triangle soup specific tests

This commit is contained in:
Sébastien Loriot 2023-04-12 16:59:05 +02:00
parent b123ccf125
commit 2393258370
1 changed files with 44 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

44
Polygon_mesh_processing/test/Polygon_mesh_processing/self_intersection_triangle_soup_test.cpp
View File

@ -186,5 +186,49 @@ int main(int argc, char** argv)
std::cout << "Test with maximum_number (EPECK):" << std::endl;
r += test_limited_self_intersections<EPECK>(filename);
// extra hand written tests
{
// shared edge with same point: no self-intersection
typedef EPICK::Point_3 Point_3;
std::vector<EPICK::Point_3> points = {Point_3(0,0,0), Point_3(1,0,0), Point_3(0,1,0), Point_3(0,-1,0)};
std::vector< std::array<std::size_t, 3> > triangles={{0,1,2}, {0,1,3}};
assert(!PMP::does_triangle_soup_self_intersect(points, triangles));
}
{
// shared edge with duplicated points: self-intersection
typedef EPICK::Point_3 Point_3;
std::vector<EPICK::Point_3> points = {Point_3(0,0,0), Point_3(1,0,0), Point_3(0,1,0),Point_3(0,0,0), Point_3(1,0,0), Point_3(0,-1,0)};
std::vector< std::array<std::size_t, 3> > triangles={{0,1,2}, {3,4,5}};
assert(PMP::does_triangle_soup_self_intersect(points, triangles));
}
{
// shared vertex with same point: no self-intersection
typedef EPICK::Point_3 Point_3;
std::vector<EPICK::Point_3> points = {Point_3(0,0,0), Point_3(1,0,0), Point_3(0,1,0), Point_3(0,2,0), Point_3(1,2,0)};
std::vector< std::array<std::size_t, 3> > triangles={{0,1,2}, {3,4,2}};
assert(!PMP::does_triangle_soup_self_intersect(points, triangles));
}
{
// shared vertex with duplicated points: self-intersection
typedef EPICK::Point_3 Point_3;
std::vector<EPICK::Point_3> points = {Point_3(0,0,0), Point_3(1,0,0), Point_3(0,1,0), Point_3(0,2,0), Point_3(1,2,0), Point_3(0,1,0)};
std::vector< std::array<std::size_t, 3> > triangles={{0,1,2}, {3,4,5}};
assert(PMP::does_triangle_soup_self_intersect(points, triangles));
}
{
// 4 triangles around a shared edge: no self-intersection
typedef EPICK::Point_3 Point_3;
std::vector<EPICK::Point_3> points = {Point_3(0,0,0), Point_3(1,0,0), Point_3(0,1,0), Point_3(0,-1,0), Point_3(0,0,1), Point_3(0,0,-1)};
std::vector< std::array<std::size_t, 3> > triangles={{0,1,2},{0,1,3},{0,1,4},{0,1,5}};
assert(!PMP::does_triangle_soup_self_intersect(points, triangles));
}
{
// 4 triangles around a shared edge but two triangles intersecting: self-intersection
typedef EPICK::Point_3 Point_3;
std::vector<EPICK::Point_3> points = {Point_3(0,0,0), Point_3(1,0,0), Point_3(0,1,0), Point_3(0,0.5,0), Point_3(0,0,1), Point_3(0,0,-1)};
std::vector< std::array<std::size_t, 3> > triangles={{0,1,2},{0,1,3},{0,1,4},{0,1,5}};
assert(PMP::does_triangle_soup_self_intersect(points, triangles));
}
return r;
}