mirror of
https://github.com/NGSolve/netgen.git
synced 2024-12-24 21:10:33 +05:00
find edges by searching for segments in both directions
This commit is contained in:
parent
a5ba7075e4
commit
0135559dd6
@ -818,11 +818,22 @@ 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)
|
||||||
throw Exception(string("Could not find connected list of line segments for edge ") + edgenr);
|
{
|
||||||
|
cout << "points = " << points << endl;
|
||||||
|
throw Exception(string("Could not find connected list of line segments for edge ") + edgenr);
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// tangential part of growth vectors
|
// tangential part of growth vectors
|
||||||
|
Loading…
Reference in New Issue
Block a user