Skip to content

PMP Corefinement: Replace containers to make it faster #5592

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
sloriot merged 3 commits into from
Aug 30, 2021
Merged

PMP Corefinement: Replace containers to make it faster #5592

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
e0985c4
PMP Corefinement: Replace containters to make it faster
afabri Apr 8, 2021
05e4b56
group intersecting segment of planar faces into a unique Node_set_id
sloriot Apr 14, 2021
33a9553
rename variables
sloriot Apr 14, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 3 additions & 2 deletions ...processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_impl.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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>

Expand Down Expand Up @@ -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;
Expand Down Expand Up @@ -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){}
Expand Down