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

Add tests for split and split_plane.

This commit is contained in:
Maxime Gimeno 2020-03-18 11:49:21 +01:00
parent 72bfe2c96d
commit d7ea0de1af
1 changed files with 79 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

88
Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_clip.cpp
View File

@ -470,50 +470,120 @@ void test_split_plane()
{
// test with a clipper mesh
Mesh tm1;
std::ifstream input("data-coref/elephant.off");
input >> tm1;
if(!input)
{
std::cerr<<"File not found. Aborting."<<std::endl;
CGAL_assertion(false);
return ;
}
input.close();
PMP::split(tm1,K::Plane_3(0,0,1,0));
std::vector<Mesh> meshes;
PMP::split_connected_components(tm1,
meshes,
params::all_default());
//CGAL_assertion(meshes.size() == 3);
CGAL::clear(tm1);
std::vector<Mesh> meshes;
PMP::split_connected_components(tm1, meshes, params::all_default());
CGAL_assertion(meshes.size() == 3);
//if the order is not deterministc, put the num_vertices in a list and check
//if the list does contain all those numbers.
CGAL_assertion(num_vertices(meshes[2]) == 48);
CGAL_assertion(num_vertices(meshes[0]) == 1527);
CGAL_assertion(num_vertices(meshes[1]) == 1674);
CGAL::clear(tm1);
}
template <class TriangleMesh>
void test_split()
{
// test with a clipper mesh
TriangleMesh tm1, tm2;
//closed intersection curves
std::ifstream input("data-coref/elephant.off");
input >> tm1;
if(!input)
{
std::cerr<<"File not found. Aborting."<<std::endl;
CGAL_assertion(false);
return ;
}
input.close();
input.open("data-coref/sphere.off");
input >> tm2;
if(!input)
{
std::cerr<<"File not found. Aborting."<<std::endl;
CGAL_assertion(false);
return ;
}
input.close();
std::vector<TriangleMesh> meshes;
PMP::split(tm1, tm2);
PMP::split_connected_components(tm1,
meshes,
params::all_default());
CGAL_assertion(meshes.size() == 5);
//if the order is not deterministc, put the num_vertices in a list and check
//if the list does contain all those numbers.
CGAL_assertion(num_vertices(meshes[0]) == 2641);
CGAL_assertion(num_vertices(meshes[1]) == 159);
CGAL_assertion(num_vertices(meshes[2]) == 142);
CGAL_assertion(num_vertices(meshes[3]) == 83);
CGAL_assertion(num_vertices(meshes[4]) == 104);
CGAL::clear(tm1);
CGAL::clear(tm2);
meshes.clear();
// open intersection curve
input.open("data-clip/split_A.off");
input >> tm1;
if(!input)
{
std::cerr<<"File not found. Aborting."<<std::endl;
CGAL_assertion(false);
return ;
}
input.close();
input.open("data-clip/splitter.off");
input >> tm2;
if(!input)
{
std::cerr<<"File not found. Aborting."<<std::endl;
CGAL_assertion(false);
return ;
}
input.close();
PMP::split(tm1, tm2);
PMP::split_connected_components(tm1,
meshes,
params::all_default());
CGAL_assertion(meshes.size() == 2);
//if the order is not deterministc, put the num_vertices in a list and check
//if the list does contain all those numbers.
CGAL_assertion(num_vertices(meshes[0]) == 588);
CGAL_assertion(num_vertices(meshes[1]) == 50);
CGAL::clear(tm1);
CGAL::clear(tm2);
meshes.clear();
}
int main()