ForkMaster/netgen
1
0
Fork 0
mirror of https://github.com/NGSolve/netgen.git synced 2025-04-15 19:11:23 +05:00
Code Issues Packages Projects Releases Wiki Activity

something

Browse Source
This commit is contained in:
Matthias Hochsteger 2023-12-14 15:18:57 +01:00
parent 95d5e868dd
commit be2d58ed33
1 changed files with 7 additions and 31 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

38
libsrc/meshing/boundarylayer.cpp
View File

@ -1677,7 +1677,7 @@ struct GrowthVectorLimiter {
auto igroup = 0; auto igroup = 0;
double distance = 1e99; double distance = 1e99;
for(auto j : Range(n)) { for(auto j : Range(n)) {
auto g = getGroups(pi, sel.GetIndex()); // auto g = getGroups(pi, sel.GetIndex());
auto vcenter = Center(mesh[sel[0]], mesh[sel[1]], mesh[sel[2]]); auto vcenter = Center(mesh[sel[0]], mesh[sel[1]], mesh[sel[2]]);
auto dist = (vcenter-(mesh[pi]+special_boundary_points[pi].growth_groups[j].growth_vector)).Length2(); auto dist = (vcenter-(mesh[pi]+special_boundary_points[pi].growth_groups[j].growth_vector)).Length2();
if(dist < distance) { if(dist < distance) {
@ -1685,7 +1685,7 @@ struct GrowthVectorLimiter {
igroup = j; igroup = j;
} }
} }
return igroup; return getGroups(pi, sel.GetIndex())[igroup];
}; };
BitArray fixed_points(np+1); BitArray fixed_points(np+1);
@ -1701,33 +1701,9 @@ struct GrowthVectorLimiter {
{ {
Array<PointIndex> points(sel.PNums()); Array<PointIndex> points(sel.PNums());
if(surfacefacs[sel.GetIndex()] > 0) Swap(points[0], points[2]); if(surfacefacs[sel.GetIndex()] > 0) Swap(points[0], points[2]);
Array<int> groups(points.Size()); ArrayMem<int, 4> groups(points.Size());
for(auto i : Range(points)) { for(auto i : Range(points))
auto n = numGroups(sel[i]); groups[i] = getClosestGroup(sel[i], si);
auto igroup = 0;
if(n > 1) {
double distance = 1e99;
for(auto j : Range(n)) {
auto g = getGroups(sel[i], sel.GetIndex());
auto vcenter = Center(mesh[sel[0]], mesh[sel[1]], mesh[sel[2]]);
auto dist = (vcenter-(mesh[sel[i]]+special_boundary_points[sel[i]].growth_groups[j].growth_vector)).Length2();
// cout << "check dist " << dist << ", " << distance << ", " << sel << endl;
if(dist < distance) {
distance = dist;
igroup = j;
// cout << "set igroup " << igroup << endl;
}
}
// if(g.Size()>1 && vcenter * special_boundary_points[sel[i]].growth_groups[0].growth_vector < 0)
// igroup = 1;
cout<< "have " << n << " groups, choose " << igroup << endl;
cout << getGroups(sel[i], sel.GetIndex()) << endl;
}
groups[i] = getGroups(sel[i], sel.GetIndex())[igroup];
// groups[i] = getClosestGroup(sel[i], sel.GetIndex());
}
bool add_volume_element = true; bool add_volume_element = true;
for(auto pi : sel.PNums()) for(auto pi : sel.PNums())
if(numGroups(pi)>1) if(numGroups(pi)>1)
@ -2137,8 +2113,8 @@ struct GrowthVectorLimiter {
// cout << "growthvectors before " << endl<< growthvectors << endl; // cout << "growthvectors before " << endl<< growthvectors << endl;
// cout << "growthvectors after " << endl << growthvectors << endl; // cout << "growthvectors after " << endl << growthvectors << endl;
if(params.limit_growth_vectors) // if(params.limit_growth_vectors)
LimitGrowthVectorLengths(); // LimitGrowthVectorLengths();
for (auto [pi, data] : growth_vector_map) { for (auto [pi, data] : growth_vector_map) {
auto [gw, height] = data; auto [gw, height] = data;