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

Update computation of paths for torus case.

This commit is contained in:
Guillaume Damiand 2019-02-06 10:50:06 +01:00
parent c01772f173
commit d8019e2b18
1 changed files with 3 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
Surface_mesh_topology/include/CGAL/Surface_mesh_curve_topology.h
View File

@ -372,8 +372,8 @@ namespace CGAL {
count_edges_of_path_on_torus(pt2, a2, b2);
res=(a1==a2 && b1==b2);
// std::cout<<"Path1: length="<<pt1.length()<<"; (#a,b)=("<<a1<<", "<<b1<<"); "<<std::endl
// <<"Path2: length="<<pt2.length()<<"; (#a,b)=("<<a2<<", "<<b2<<")."<<std::endl;
std::cout<<"Path1: length="<<pt1.length()<<"; (#a,b)=("<<a1<<", "<<b1<<"); "<<std::endl
<<"Path2: length="<<pt2.length()<<"; (#a,b)=("<<a2<<", "<<b2<<")."<<std::endl;
}
else
{
@ -487,12 +487,11 @@ namespace CGAL {
if (!m_original_map.is_marked(path[i], m_mark_T))
{
cur=get_first_dart_of_the_path(path[i]);
do
while(cur!=get_second_dart_of_the_path(path[i]))
{
res.push_back(cur, false);
cur=m_map.template beta<1>(cur);
}
while(cur!=get_second_dart_of_the_path(path[i]));
}
}
res.update_is_closed();