ForkMaster/netgen
1
0
Fork 0
mirror of https://github.com/NGSolve/netgen.git synced 2025-04-12 16:17:29 +05:00
Code Issues Packages Projects Releases Wiki Activity

find edges by searching for segments in both directions

Browse Source
This commit is contained in:
Christopher Lackner 2022-04-11 13:04:56 +02:00
parent a5ba7075e4
commit 0135559dd6
1 changed files with 12 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
libsrc/meshing/boundarylayer.cpp
View File

@ -818,12 +818,23 @@ namespace netgen
point_found = true; point_found = true;
break; break;
} }
else if(seg[1] == points.Last() &&
points[points.Size()-2] != seg[0])
{
edge_len += (mesh[points.Last()] - mesh[seg[0]]).Length();
points.Append(seg[0]);
point_found = true;
break;
}
} }
if(is_end_point(points.Last())) if(is_end_point(points.Last()))
break; break;
if(!point_found) if(!point_found)
{
cout << "points = " << points << endl;
throw Exception(string("Could not find connected list of line segments for edge ") + edgenr); throw Exception(string("Could not find connected list of line segments for edge ") + edgenr);
} }
}
// tangential part of growth vectors // tangential part of growth vectors
auto t1 = (mesh[points[1]]-mesh[points[0]]).Normalize(); auto t1 = (mesh[points[1]]-mesh[points[0]]).Normalize();