songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

edges are not sorted and do not appear twice: do not skip them using indices

This commit is contained in:
Sébastien Loriot 2016-11-10 09:41:18 +01:00
parent 07359c1eb0
commit f68a2a4dff
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/Visitor.h
View File

@ -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<Node_id,CDT_Vertex_handle>
::iterator it_vh=id_to_CDT_vh.find(id_n);
// this condition ensures to consider only graph edges that are in