diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/self_intersection_surface_mesh_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/self_intersection_surface_mesh_test.cpp index 386e05de0f2..c69bc8716a1 100644 --- a/Polygon_mesh_processing/test/Polygon_mesh_processing/self_intersection_surface_mesh_test.cpp +++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/self_intersection_surface_mesh_test.cpp @@ -31,7 +31,7 @@ int main(int argc, char** argv) std::back_inserter(intersected_tris), CGAL::Polygon_mesh_processing::parameters::vertex_index_map(get(CGAL::vertex_point, m))); bool intersecting_1 = !intersected_tris.empty(); - CGAL_assertion(!intersecting_1); + assert(!intersecting_1); std::cerr << "self_intersections test took " << timer.time() << " sec." << std::endl; std::cerr << intersected_tris.size() << " pairs of triangles are intersecting." << std::endl; @@ -40,7 +40,7 @@ int main(int argc, char** argv) bool intersecting_2 = CGAL::Polygon_mesh_processing::does_self_intersect(m, CGAL::Polygon_mesh_processing::parameters::vertex_index_map(get(CGAL::vertex_point, m))); - CGAL_assertion(intersecting_1 == intersecting_2); + assert(intersecting_1 == intersecting_2); std::cerr << "does_self_intersect test took " << timer.time() << " sec." << std::endl; std::cerr diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_no_delaunay_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_no_delaunay_test.cpp index 6d4050f1408..705b44e5da4 100644 --- a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_no_delaunay_test.cpp +++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_no_delaunay_test.cpp @@ -58,7 +58,7 @@ void detect_borders(Polyhedron& poly, std::vector& border_reps) Halfedge_around_facet_circulator hf_around_facet(h,poly), done(hf_around_facet); do { bool insertion_ok = border_map.insert(*hf_around_facet).second; - CGAL_assertion(insertion_ok); + assert(insertion_ok); } while(++hf_around_facet != done); } } @@ -135,13 +135,13 @@ void test_triangulate_hole(const char* file_name) { CGAL::Polygon_mesh_processing::triangulate_hole(poly, *it, back_inserter(patch)); if(patch.empty()) { std::cerr << " Error: empty patch created." << std::endl; - CGAL_assertion(false); + assert(false); } } if(!poly.is_valid() || ! is_closed(poly)) { std::cerr << " Error: patched polyhedron is not valid or closed." << std::endl; - CGAL_assertion(false); + assert(false); } std::cout << " Done!" << std::endl; diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_test.cpp index a9b76d26efb..5240955b1d8 100644 --- a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_test.cpp +++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_test.cpp @@ -57,7 +57,7 @@ void detect_borders(Polyhedron& poly, std::vector& border_reps) Halfedge_around_facet_circulator hf_around_facet(h,poly), done(hf_around_facet); do { bool insertion_ok = border_map.insert(*hf_around_facet).second; - CGAL_assertion(insertion_ok); + assert(insertion_ok); } while(++hf_around_facet != done); } } @@ -146,13 +146,13 @@ void test_triangulate_hole(const char* file_name) { CGAL::Polygon_mesh_processing::triangulate_hole(poly, *it, back_inserter(patch)); if(patch.empty()) { std::cerr << " Error: empty patch created." << std::endl; - CGAL_assertion(false); + assert(false); } } if(!poly.is_valid() || ! is_closed(poly)) { std::cerr << " Error: patched polyhedron is not valid or closed." << std::endl; - CGAL_assertion(false); + assert(false); } std::cout << " Done!" << std::endl;