diff --git a/Mesh_3/include/CGAL/Mesh_3/tet_soup_to_c3t3.h b/Mesh_3/include/CGAL/Mesh_3/tet_soup_to_c3t3.h index 632d87a83d8..258962a1543 100644 --- a/Mesh_3/include/CGAL/Mesh_3/tet_soup_to_c3t3.h +++ b/Mesh_3/include/CGAL/Mesh_3/tet_soup_to_c3t3.h @@ -105,13 +105,14 @@ bool build_finite_cells(Tr& tr, const std::vector& vertex_handle_vector, boost::unordered_map, std::vector > >& incident_cells_map, - const std::map, int>& border_facets, + const std::map, typename Tr::Cell::Surface_patch_index>& border_facets, const bool verbose) { typedef std::array Tet_with_ref; // 4 ids + 1 reference typedef typename Tr::Vertex_handle Vertex_handle; typedef typename Tr::Cell_handle Cell_handle; + typedef typename Tr::Cell::Surface_patch_index Surface_patch_index; CGAL_assertion_code( typename Tr::Geom_traits::Construct_point_3 cp = @@ -171,7 +172,8 @@ bool build_finite_cells(Tr& tr, ++k; } while(f[0] != n0); - typename std::map, int>::const_iterator it = border_facets.find(f); + typename std::map, Surface_patch_index>::const_iterator + it = border_facets.find(f); if(it != border_facets.end()) { c->set_surface_patch_index(j, it->second); @@ -186,7 +188,7 @@ bool build_finite_cells(Tr& tr, if(it != border_facets.end()) c->set_surface_patch_index(j, it->second); else - c->set_surface_patch_index(j, 0); + c->set_surface_patch_index(j, Surface_patch_index()); } } } @@ -322,7 +324,7 @@ template bool build_triangulation(Tr& tr, const std::vector& points, const std::vector >& finite_cells, - const std::map, int>& border_facets, + const std::map, typename Tr::Cell::Surface_patch_index>& border_facets, std::vector& vertex_handle_vector, const bool verbose = false) { @@ -335,7 +337,7 @@ bool build_triangulation(Tr& tr, typedef boost::unordered_map > Incident_cells_map; Incident_cells_map incident_cells_map; - vertex_handle_vector.resize(points.size() + 1); // id to vertex_handle + vertex_handle_vector.resize(points.size() + 1); // id to vertex_handle //index 0 is for infinite vertex // 1 to n for points in `points` @@ -389,7 +391,7 @@ bool build_triangulation_from_file(std::istream& is, std::vector finite_cells; std::vector points; - std::map border_facets; + std::map border_facets; // grab the vertices int dim; @@ -420,7 +422,8 @@ bool build_triangulation_from_file(std::istream& is, is >> nf; for(int i=0; i> n1 >> n2 >> n3 >> surface_patch_id; Facet facet; facet[0] = n1 - 1; diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h index 4e163f07372..b77b2bcafa7 100644 --- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h +++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h @@ -115,7 +115,7 @@ public: // finished std::vector new_vertices; - std::map border_facets; + std::map border_facets; if (CGAL::build_triangulation(triangulation, points, finite_cells, border_facets, new_vertices, false/*verbose*/))