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

PMP Corefinement: Replace containters to make it faster

This commit is contained in:
Andreas Fabri 2021-04-08 11:40:19 +01:00
parent c7fdd8f6df
commit e0985c4daf
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_impl.h
View File

@ -29,6 +29,7 @@
#include <boost/unordered_map.hpp>
#include <boost/unordered_set.hpp>
#include <boost/dynamic_bitset.hpp>
#include <boost/container/flat_set.hpp>
#include <stdexcept>
@ -192,7 +193,7 @@ class Intersection_of_triangle_meshes
// we use Face_pair_and_int and not Face_pair to handle coplanar case.
// Indeed the boundary of the intersection of two coplanar triangles
// may contain several segments.
typedef std::map< Face_pair_and_int, Node_id_set > Faces_to_nodes_map;
typedef boost::unordered_map< Face_pair_and_int, Node_id_set > Faces_to_nodes_map;
typedef Intersection_nodes<TriangleMesh,
VertexPointMap1, VertexPointMap2,
Predicates_on_constructions_needed> Node_vector;
@ -1051,7 +1052,7 @@ class Intersection_of_triangle_meshes
}
struct Graph_node{
std::set<Node_id> neighbors;
boost::container::flat_set<Node_id> neighbors;
unsigned degree;
Graph_node():degree(0){}