mirror of
https://github.com/NGSolve/netgen.git
synced 2024-12-24 21:10:33 +05:00
optimize CalcPartition() and PartitionBoundary()
This commit is contained in:
parent
1a051ec555
commit
95b7720efd
@ -18,10 +18,19 @@ namespace netgen
|
||||
{
|
||||
double fperel, oldf, f;
|
||||
|
||||
int n = 10000;
|
||||
int n = 1;
|
||||
NgArray<Point<2> > xi;
|
||||
NgArray<double> hi;
|
||||
|
||||
NgArray<Point<2> > xi(n);
|
||||
NgArray<double> hi(n);
|
||||
bool not_fine_enough = true;
|
||||
|
||||
while(not_fine_enough && n < 10000)
|
||||
{
|
||||
not_fine_enough = false;
|
||||
n*=2;
|
||||
|
||||
xi.SetSize(n);
|
||||
hi.SetSize(n);
|
||||
|
||||
for (int i = 0; i < n; i++)
|
||||
{
|
||||
@ -34,13 +43,18 @@ namespace netgen
|
||||
for (int i = 0; i < n-1; i++)
|
||||
{
|
||||
double hnext = hi[i] + gradh * (xi[i+1]-xi[i]).Length();
|
||||
if(hnext > 2*hi[i])
|
||||
not_fine_enough = true;
|
||||
hi[i+1] = min(hi[i+1], hnext);
|
||||
}
|
||||
for (int i = n-1; i > 1; i--)
|
||||
{
|
||||
double hnext = hi[i] + gradh * (xi[i-1]-xi[i]).Length();
|
||||
if(hnext > 2*hi[i])
|
||||
not_fine_enough = true;
|
||||
hi[i-1] = min(hi[i-1], hnext);
|
||||
}
|
||||
}
|
||||
|
||||
points.SetSize (0);
|
||||
|
||||
@ -227,6 +241,10 @@ namespace netgen
|
||||
mesh2d.RestrictLocalHLine (Point<3>(p1(0),p1(1),0),
|
||||
Point<3>(p2(0),p2(1),0), len/mp.segmentsperedge);
|
||||
|
||||
// skip curvature restrictions for straight lines
|
||||
if(spline.MaxCurvature()==0)
|
||||
continue;
|
||||
|
||||
double hcurve = min (spline.hmax, h/spline.reffak);
|
||||
double hl = GetDomainMaxh (spline.leftdom);
|
||||
if (hl > 0) hcurve = min2 (hcurve, hl);
|
||||
|
Loading…
Reference in New Issue
Block a user