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

Add comments

This commit is contained in:
Guillaume Damiand 2018-02-08 17:57:21 +01:00
parent 7694565cb0
commit f4239cf463
1 changed files with 11 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
Combinatorial_map/include/CGAL/Combinatorial_map_functionalities.h
View File

@ -260,6 +260,9 @@ protected:
return uftrees.find(mapdhtouf.find(dh)->second);
}
// Transform the 2-map into an equivalent surface having only one vertex.
// All edges removed during this step belong to the spanning tree L
// (spanning tree of the dual 2-map).
void surface_simplification_in_one_face()
{
UFTree uftrees; // uftree of faces; one tree for each face, contains one dart of the face
@ -308,7 +311,9 @@ protected:
m_map.set_automatic_attributes_management(true);
m_map.free_mark(treated);
}
// Transform the 2-map into an equivalent surface having only one vertex.
// All edges contracted during this step belong to the spanning tree T.
void surface_simplification_in_one_vertex()
{
UFTree uftrees; // uftree of vertices; one tree for each vertex, contains one dart of the vertex
@ -330,6 +335,11 @@ protected:
}
m_map.set_automatic_attributes_management(true);
// Now we compute each length two path associated with each edge that does
// not belong to the spanning tree (which are thus all the survival edges).
compute_length_two_paths();
}
void surface_quadrangulate()