mirror of https://github.com/CGAL/cgal
update orient_polygon_soup testsuite
This commit is contained in:
parent
1a79edd840
commit
a6ea5c0b22
|
|
@ -73,6 +73,7 @@ create_single_source_cgal_program( "self_intersection_surface_mesh_test.cpp" )
|
||||||
create_single_source_cgal_program( "triangulate_hole_Polyhedron_3_test.cpp" )
|
create_single_source_cgal_program( "triangulate_hole_Polyhedron_3_test.cpp" )
|
||||||
create_single_source_cgal_program( "triangulate_hole_Polyhedron_3_no_delaunay_test.cpp" )
|
create_single_source_cgal_program( "triangulate_hole_Polyhedron_3_no_delaunay_test.cpp" )
|
||||||
create_single_source_cgal_program( "triangulate_hole_polyline_test.cpp" )
|
create_single_source_cgal_program( "triangulate_hole_polyline_test.cpp" )
|
||||||
|
create_single_source_cgal_program( "test_orient_polygon_soup.cpp")
|
||||||
|
|
||||||
else(EIGEN3_FOUND)
|
else(EIGEN3_FOUND)
|
||||||
message(STATUS "NOTICE: Some examples require Eigen 3.1 (or greater) and will not be compiled.")
|
message(STATUS "NOTICE: Some examples require Eigen 3.1 (or greater) and will not be compiled.")
|
||||||
|
|
|
||||||
|
|
@ -2,7 +2,7 @@
|
||||||
#include <CGAL/Simple_cartesian.h>
|
#include <CGAL/Simple_cartesian.h>
|
||||||
|
|
||||||
#include <CGAL/orient_polygon_soup.h>
|
#include <CGAL/orient_polygon_soup.h>
|
||||||
#include <CGAL/polygon_soup_to_polyhedron_3.h>
|
#include <CGAL/polygon_soup_to_polygon_mesh.h>
|
||||||
#include <CGAL/IO/OFF_reader.h>
|
#include <CGAL/IO/OFF_reader.h>
|
||||||
|
|
||||||
#include <string>
|
#include <string>
|
||||||
|
|
@ -30,12 +30,12 @@ void test(std::string fname, std::size_t expected_duplicated_vertices)
|
||||||
}
|
}
|
||||||
|
|
||||||
std::size_t initial_nb_points = points.size();
|
std::size_t initial_nb_points = points.size();
|
||||||
CGAL::orient_polygon_soup(points, polygons);
|
CGAL::Polygon_mesh_processing::orient_polygon_soup(points, polygons);
|
||||||
|
|
||||||
assert(expected_duplicated_vertices == points.size()-initial_nb_points);
|
assert(expected_duplicated_vertices == points.size()-initial_nb_points);
|
||||||
|
|
||||||
Polyhedron P;
|
Polyhedron P;
|
||||||
CGAL::polygon_soup_to_polyhedron_3(P, points, polygons);
|
CGAL::Polygon_mesh_processing::polygon_soup_to_polygon_mesh(points, polygons, P);
|
||||||
assert(P.is_valid());
|
assert(P.is_valid());
|
||||||
std::cout << fname << " OK\n";
|
std::cout << fname << " OK\n";
|
||||||
}
|
}
|
||||||
Loading…
Reference in New Issue