From f68a2a4dff7e10a72a3d40b681b6c371e742d099 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= Date: Thu, 10 Nov 2016 09:41:18 +0100 Subject: [PATCH] edges are not sorted and do not appear twice: do not skip them using indices --- .../Polygon_mesh_processing/internal/Corefinement/Visitor.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/Visitor.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/Visitor.h index 11baf066356..e89e28fa732 100644 --- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/Visitor.h +++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/Visitor.h @@ -543,7 +543,7 @@ public: CDT_Vertex_handle vh=id_to_CDT_vh.find(id)->second; BOOST_FOREACH(Node_id id_n,neighbors) { - if (id_n < id) continue; //no need to do it twice + // if (id_n < id) continue; //no need to do it twice typename std::map ::iterator it_vh=id_to_CDT_vh.find(id_n); // this condition ensures to consider only graph edges that are in