Sort halfedge of coplanar faces intersecting in autorefinement case
Since the faces are coming from the same mesh...
This commit is contained in:
+2
@@ -353,6 +353,8 @@ class Intersection_of_triangle_meshes
|
||||
}
|
||||
|
||||
Key key(ipt.type_1, ipt.type_2, h1, h2);
|
||||
if (&tm1==&tm2 && h1>h2)
|
||||
key=Key(ipt.type_2, ipt.type_1, h2, h1);
|
||||
|
||||
std::pair<typename std::map<Key,Node_id>::iterator,bool> res=
|
||||
coplanar_node_map.insert(std::make_pair(key,current_node+1));
|
||||
|
||||
Reference in New Issue
Block a user