File tree Expand file tree Collapse file tree 1 file changed +3
-3
lines changed Expand file tree Collapse file tree 1 file changed +3
-3
lines changed Original file line number Diff line number Diff line change @@ -351,7 +351,7 @@ pmp_dual(
351351 // This information will be used to determine the adjacency between faces.
352352
353353 std::vector<typename boost::graph_traits<compas::Mesh>::face_descriptor> vertex_faces;
354- std::vector<std::vector<size_t >> faces_edges;
354+ std::vector<std::vector<typename boost::graph_traits<compas::Mesh>::edge_descriptor >> faces_edges;
355355
356356 for (auto h : CGAL::halfedges_around_target (v, mesh_a)) {
357357 auto f = face (h, mesh_a);
@@ -361,7 +361,7 @@ pmp_dual(
361361
362362 auto h = halfedge (f, mesh_a);
363363
364- std::vector<size_t > edges;
364+ std::vector<typename boost::graph_traits<compas::Mesh>::edge_descriptor > edges;
365365 for (auto h : CGAL::halfedges_around_face (h, mesh_a)) {
366366 auto e = edge (h, mesh_a);
367367 edges.push_back (e);
@@ -398,7 +398,7 @@ pmp_dual(
398398 auto & current_edges = faces_edges[current_face_idx];
399399
400400 for (auto edge1 : current_edges) {
401- if (CGAL::SM_Edge_index ( edge1) == e1 || CGAL::SM_Edge_index ( edge1) == e2 ) continue ; // Skip boundary edges
401+ if (edge1 == e1 || edge1 == e2 ) continue ; // Skip boundary edges
402402
403403 for (size_t j = 0 ; j < vertex_faces.size (); j++) {
404404 if (visited[j]) continue ;
You can’t perform that action at this time.
0 commit comments