mirror of
https://github.com/NGSolve/netgen.git
synced 2024-11-12 00:59:16 +05:00
d33d38f113
don't consider quads with fixed points as "mixed mesh" (will be skipped during optimization anyway)
1045 lines
26 KiB
C++
1045 lines
26 KiB
C++
#include <mystdlib.h>
|
|
|
|
#include "meshing.hpp"
|
|
#include <opti.hpp>
|
|
|
|
namespace netgen
|
|
{
|
|
|
|
static const double c_trig = 0.14433756; // sqrt(3.0) / 12
|
|
static const double c_trig4 = 0.57735026; // sqrt(3.0) / 3
|
|
|
|
|
|
inline double CalcTriangleBadness (double x2, double x3, double y3,
|
|
double metricweight, double h)
|
|
{
|
|
// badness = sqrt(3.0) / 12 * (\sum l_i^2) / area - 1
|
|
// p1 = (0, 0), p2 = (x2, 0), p3 = (x3, y3);
|
|
|
|
double cir_2 = (x2*x2 + x3*x3 + y3*y3 - x2*x3);
|
|
double area = x2 * y3;
|
|
|
|
if (area <= 1e-24 * cir_2)
|
|
return 1e10;
|
|
|
|
double badness = c_trig4 * cir_2 / area - 1;
|
|
|
|
if (metricweight > 0)
|
|
{
|
|
// add: metricweight * (area / h^2 + h^2 / area - 2)
|
|
|
|
double areahh = area / (h * h);
|
|
badness += metricweight * (areahh + 1 / areahh - 2);
|
|
}
|
|
return badness;
|
|
}
|
|
|
|
inline void CalcTriangleBadness (double x2, double x3, double y3, double metricweight,
|
|
double h, double & badness, double & g1x, double & g1y)
|
|
{
|
|
// old: badness = sqrt(3.0) /36 * circumference^2 / area - 1
|
|
// badness = sqrt(3.0) / 12 * (\sum l_i^2) / area - 1
|
|
// p1 = (0, 0), p2 = (x2, 0), p3 = (x3, y3);
|
|
|
|
|
|
double cir_2 = 2* (x2*x2 + x3*x3 + y3*y3 - x2*x3);
|
|
double area = 0.5 * x2 * y3;
|
|
|
|
if (area <= 1e-24 * cir_2)
|
|
{
|
|
g1x = 0;
|
|
g1y = 0;
|
|
badness = 1e10;
|
|
return;
|
|
}
|
|
|
|
badness = c_trig * cir_2 / area - 1;
|
|
|
|
double c1 = -2 * c_trig / area;
|
|
double c2 = 0.5 * c_trig * cir_2 / (area * area);
|
|
g1x = c1 * (x2 + x3) + c2 * y3;
|
|
g1y = c1 * (y3) + c2 * (x2-x3);
|
|
|
|
if (metricweight > 0)
|
|
{
|
|
// area = (x2 - x1) * (y3 - y1) - (x3 - x1) * (y2 - y1);
|
|
// add: metricweight * (area / h^2 + h^2 / area - 2)
|
|
|
|
area = x2 * y3;
|
|
double dareax1 = -y3;
|
|
double dareay1 = x3 - x2;
|
|
|
|
double areahh = area / (h * h);
|
|
double fac = metricweight * (areahh - 1 / areahh) / area;
|
|
|
|
badness += metricweight * (areahh + 1 / areahh - 2);
|
|
g1x += fac * dareax1;
|
|
g1y += fac * dareay1;
|
|
}
|
|
}
|
|
|
|
|
|
|
|
double CalcTriangleBadness (const Point<3> & p1,
|
|
const Point<3> & p2,
|
|
const Point<3> & p3,
|
|
double metricweight,
|
|
double h)
|
|
{
|
|
// badness = sqrt(3.0) / 12 * (\sum l_i^2) / area - 1
|
|
|
|
Vec<3> e12 = p2-p1;
|
|
Vec<3> e13 = p3-p1;
|
|
Vec<3> e23 = p3-p2;
|
|
|
|
double cir_2 = e12.Length2() + e13.Length2() + e23.Length2();
|
|
double area = 0.5 * Cross (e12, e13).Length();
|
|
|
|
if (area <= 1e-24 * cir_2)
|
|
return 1e10;
|
|
|
|
double badness = c_trig * cir_2 / area - 1;
|
|
|
|
if (metricweight > 0)
|
|
{
|
|
// add: metricweight * (area / h^2 + h^2 / area - 2)
|
|
area *= 2; // optimum for (2 area) is h^2
|
|
double areahh = area / (h * h);
|
|
badness += metricweight * (areahh + 1 / areahh - 2);
|
|
}
|
|
|
|
return badness;
|
|
}
|
|
|
|
double CalcTriangleBadnessGrad (const Point<3> & p1,
|
|
const Point<3> & p2,
|
|
const Point<3> & p3,
|
|
Vec<3> & gradp1,
|
|
double metricweight,
|
|
double h)
|
|
{
|
|
// badness = sqrt(3.0) / 12 * (\sum l_i^2) / area - 1
|
|
|
|
Vec<3> e12 = p2-p1;
|
|
Vec<3> e13 = p3-p1;
|
|
Vec<3> e23 = p3-p2;
|
|
|
|
double cir_2 = e12.Length2() + e13.Length2() + e23.Length2();
|
|
Vec<3> varea = Cross(e12, e13);
|
|
double area = 0.5 * varea.Length();
|
|
|
|
Vec<3> dcir_2 = (-2) * (e12+e13);
|
|
Vec<3> darea = (0.25/area) * Cross (p2-p3, varea);
|
|
|
|
if (area <= 1e-24 * cir_2)
|
|
{
|
|
gradp1 = 0;
|
|
return 1e10;
|
|
}
|
|
|
|
double badness = c_trig * cir_2 / area - 1;
|
|
gradp1 = c_trig * (1.0/area * dcir_2 - cir_2 / (area*area) * darea);
|
|
|
|
if (metricweight > 0)
|
|
{
|
|
// add: metricweight * (area / h^2 + h^2 / area - 2)
|
|
area *= 2; // optimum for (2 area) is h^2
|
|
|
|
double areahh = area / (h * h);
|
|
badness += metricweight * (areahh + 1 / areahh - 2);
|
|
|
|
gradp1 += (2*metricweight * (1/(h*h) - (h*h)/(area*area))) * darea;
|
|
}
|
|
|
|
return badness;
|
|
}
|
|
|
|
|
|
|
|
|
|
double CalcTriangleBadness (const Point<3> & p1,
|
|
const Point<3> & p2,
|
|
const Point<3> & p3,
|
|
const Vec<3> & n,
|
|
double metricweight,
|
|
double h)
|
|
{
|
|
Vec<3> v1 = p2-p1;
|
|
Vec<3> v2 = p3-p1;
|
|
|
|
Vec<3> e1 = v1;
|
|
Vec<3> e2 = v2;
|
|
|
|
e1 -= (e1 * n) * n;
|
|
e1 /= (e1.Length() + 1e-24);
|
|
e2 = Cross (n, e1);
|
|
|
|
return CalcTriangleBadness ( (e1 * v1), (e1 * v2), (e2 * v2),
|
|
metricweight, h);
|
|
}
|
|
|
|
|
|
class Opti2dLocalData
|
|
{
|
|
public:
|
|
const MeshOptimize2d * meshthis;
|
|
MeshPoint sp1;
|
|
PointGeomInfo gi1;
|
|
Vec<3> normal, t1, t2;
|
|
NgArray<SurfaceElementIndex> locelements;
|
|
NgArray<int> locrots;
|
|
NgArray<double> lochs;
|
|
NgArray<Point<3> > loc_pnts2, loc_pnts3;
|
|
// static int locerr2;
|
|
double locmetricweight;
|
|
double loch;
|
|
int surfi, surfi2;
|
|
int uselocalh;
|
|
public:
|
|
Opti2dLocalData ()
|
|
{
|
|
locmetricweight = 0;
|
|
}
|
|
};
|
|
|
|
|
|
class Opti2SurfaceMinFunction : public MinFunction
|
|
{
|
|
Opti2dLocalData & ld;
|
|
const NetgenGeometry& geo;
|
|
public:
|
|
Opti2SurfaceMinFunction (const Mesh & amesh,
|
|
Opti2dLocalData & ald)
|
|
: ld(ald), geo(*amesh.GetGeometry())
|
|
{ } ;
|
|
|
|
|
|
virtual double Func (const Vector & x) const
|
|
{
|
|
double badness = 0;
|
|
|
|
auto n = geo.GetNormal(ld.surfi, ld.sp1, &ld.gi1);
|
|
Point<3> pp1 = ld.sp1 + x(0) * ld.t1 + x(1) * ld.t2;
|
|
|
|
for (int j = 0; j < ld.locelements.Size(); j++)
|
|
{
|
|
Vec<3> e1 = ld.loc_pnts2[j] - pp1;
|
|
Vec<3> e2 = ld.loc_pnts3[j] - pp1;
|
|
|
|
if (ld.uselocalh) ld.loch = ld.lochs[j];
|
|
|
|
if (Determinant(e1, e2, n) > 1e-8 * ld.loch * ld.loch)
|
|
{
|
|
badness += CalcTriangleBadness (pp1, ld.loc_pnts2[j], ld.loc_pnts3[j],
|
|
ld.locmetricweight, ld.loch);
|
|
}
|
|
else
|
|
{
|
|
badness += 1e8;
|
|
}
|
|
}
|
|
|
|
return badness;
|
|
}
|
|
|
|
|
|
virtual double FuncGrad (const Vector & x, Vector & g) const
|
|
{
|
|
Vec<3> vgrad;
|
|
Point<3> pp1;
|
|
|
|
vgrad = 0;
|
|
double badness = 0;
|
|
|
|
pp1 = ld.sp1 + x(0) * ld.t1 + x(1) * ld.t2;
|
|
|
|
for (int j = 0; j < ld.locelements.Size(); j++)
|
|
{
|
|
Vec<3> e1 = ld.loc_pnts2[j] - pp1;
|
|
Vec<3> e2 = ld.loc_pnts3[j] - pp1;
|
|
|
|
if (ld.uselocalh) ld.loch = ld.lochs[j];
|
|
|
|
if (Determinant(e1, e2, ld.normal) > 1e-8 * ld.loch * ld.loch)
|
|
{
|
|
Vec<3> hgrad;
|
|
badness +=
|
|
CalcTriangleBadnessGrad (pp1, ld.loc_pnts2[j], ld.loc_pnts3[j], hgrad,
|
|
ld.locmetricweight, ld.loch);
|
|
vgrad += hgrad;
|
|
}
|
|
else
|
|
{
|
|
badness += 1e8;
|
|
}
|
|
}
|
|
g(0) = ld.t1 * vgrad;
|
|
g(1) = ld.t2 * vgrad;
|
|
return badness;
|
|
}
|
|
|
|
virtual double FuncDeriv (const Vector & x, const Vector & dir, double & deriv) const
|
|
{
|
|
deriv = 0;
|
|
double badness = 0;
|
|
|
|
Point<3> pp1 = ld.sp1 + x(0) * ld.t1 + x(1) * ld.t2;
|
|
Vec<3> dir3d = dir(0) * ld.t1 + dir(1) * ld.t2;
|
|
|
|
for (int j = 0; j < ld.locelements.Size(); j++)
|
|
{
|
|
Vec<3> e1 = ld.loc_pnts2[j] - pp1;
|
|
Vec<3> e2 = ld.loc_pnts3[j] - pp1;
|
|
|
|
if (ld.uselocalh) ld.loch = ld.lochs[j];
|
|
|
|
if (Determinant(e1, e2, ld.normal) > 1e-8 * ld.loch * ld.loch)
|
|
{
|
|
Vec<3> hgrad;
|
|
badness +=
|
|
CalcTriangleBadnessGrad (pp1, ld.loc_pnts2[j], ld.loc_pnts3[j], hgrad,
|
|
ld.locmetricweight, ld.loch);
|
|
deriv += dir3d * hgrad;
|
|
}
|
|
else
|
|
{
|
|
badness += 1e8;
|
|
}
|
|
}
|
|
|
|
// cout << "deriv = " << deriv << " =?= ";
|
|
return badness;
|
|
/*
|
|
static int timer = NgProfiler::CreateTimer ("opti2surface - deriv");
|
|
NgProfiler::RegionTimer reg (timer);
|
|
|
|
double eps = 1e-6;
|
|
Vector xr(2), xl(2);
|
|
xr = x; xl = x;
|
|
for (int i = 0; i < 2; i++)
|
|
{
|
|
xr(i) = x(i) + eps * dir(i);
|
|
xl(i) = x(i) - eps * dir(i);
|
|
}
|
|
deriv = (Func (xr) - Func(xl) ) / (2*eps);
|
|
cout << deriv << endl;
|
|
return Func(x);
|
|
*/
|
|
}
|
|
|
|
|
|
|
|
virtual double XXFuncGrad (const Vector & x, Vector & g) const;
|
|
virtual double XXFuncDeriv (const Vector & x, const Vector & dir, double & deriv) const;
|
|
|
|
};
|
|
|
|
|
|
/*
|
|
double Opti2SurfaceMinFunction ::
|
|
Func (const Vector & x) const
|
|
{
|
|
static int timer = NgProfiler::CreateTimer ("opti2surface - func");
|
|
NgProfiler::RegionTimer reg (timer);
|
|
|
|
Vector g(x.Size());
|
|
return FuncGrad (x, g);
|
|
}
|
|
*/
|
|
|
|
double Opti2SurfaceMinFunction ::
|
|
XXFuncGrad (const Vector & x, Vector & grad) const
|
|
{
|
|
// static int timer = NgProfiler::CreateTimer ("opti2surface - funcgrad");
|
|
// NgProfiler::RegionTimer reg (timer);
|
|
|
|
Vec<3> vgrad;
|
|
Point<3> pp1;
|
|
|
|
vgrad = 0;
|
|
double badness = 0;
|
|
|
|
auto n = geo.GetNormal(ld.surfi, ld.sp1, &ld.gi1);
|
|
pp1 = ld.sp1 + x(0) * ld.t1 + x(1) * ld.t2;
|
|
|
|
// meshthis -> ProjectPoint (surfi, pp1);
|
|
// meshthis -> GetNormalVector (surfi, pp1, n);
|
|
|
|
for (int j = 0; j < ld.locelements.Size(); j++)
|
|
{
|
|
double g1x, g1y, hbadness;
|
|
|
|
Vec<3> e1 = ld.loc_pnts2[j] - pp1;
|
|
Vec<3> e2 = ld.loc_pnts3[j] - pp1;
|
|
|
|
if (ld.uselocalh) ld.loch = ld.lochs[j];
|
|
|
|
double e1l = e1.Length();
|
|
if (Determinant(e1, e2, n) > 1e-8 * e1l * e2.Length())
|
|
{
|
|
e1 /= e1l;
|
|
double e1e2 = e1 * e2;
|
|
e2 -= e1e2 * e1;
|
|
double e2l = e2.Length();
|
|
|
|
CalcTriangleBadness ( e1l, e1e2, e2l, ld.locmetricweight, ld.loch,
|
|
hbadness, g1x, g1y);
|
|
|
|
badness += hbadness;
|
|
vgrad += g1x * e1 + (g1y/e2l) * e2;
|
|
}
|
|
else
|
|
{
|
|
// (*testout) << "very very bad badness" << endl;
|
|
badness += 1e8;
|
|
}
|
|
}
|
|
|
|
// vgrad -= (vgrad * n) * n;
|
|
grad(0) = vgrad * ld.t1;
|
|
grad(1) = vgrad * ld.t2;
|
|
return badness;
|
|
}
|
|
|
|
|
|
double Opti2SurfaceMinFunction ::
|
|
XXFuncDeriv (const Vector & x, const Vector & dir, double & deriv) const
|
|
{
|
|
// static int timer = NgProfiler::CreateTimer ("opti2surface - funcderiv");
|
|
// NgProfiler::RegionTimer reg (timer);
|
|
|
|
Vec<3> vgrad;
|
|
Point<3> pp1;
|
|
|
|
vgrad = 0;
|
|
double badness = 0;
|
|
|
|
auto n = geo.GetNormal(ld.surfi, ld.sp1, &ld.gi1);
|
|
pp1 = ld.sp1 + x(0) * ld.t1 + x(1) * ld.t2;
|
|
|
|
for (int j = 0; j < ld.locelements.Size(); j++)
|
|
{
|
|
double g1x, g1y, hbadness;
|
|
|
|
/*
|
|
int roti = ld.locrots[j];
|
|
const Element2d & bel = mesh[ld.locelements[j]];
|
|
Vec<3> e1 = mesh[bel.PNumMod(roti + 1)] - pp1;
|
|
Vec<3> e2 = mesh[bel.PNumMod(roti + 2)] - pp1;
|
|
*/
|
|
Vec<3> e1 = ld.loc_pnts2[j] - pp1;
|
|
Vec<3> e2 = ld.loc_pnts3[j] - pp1;
|
|
if (ld.uselocalh) ld.loch = ld.lochs[j];
|
|
|
|
double e1l = e1.Length();
|
|
if (Determinant(e1, e2, n) > 1e-8 * e1l * e2.Length())
|
|
{
|
|
e1 /= e1l;
|
|
double e1e2 = e1 * e2;
|
|
e2 -= e1e2 * e1;
|
|
double e2l = e2.Length();
|
|
CalcTriangleBadness ( e1l, e1e2, e2l, ld.locmetricweight, ld.loch,
|
|
hbadness, g1x, g1y);
|
|
|
|
badness += hbadness;
|
|
vgrad += g1x * e1 + (g1y / e2l) * e2;
|
|
}
|
|
else
|
|
{
|
|
// (*testout) << "very very bad badness" << endl;
|
|
badness += 1e8;
|
|
}
|
|
}
|
|
|
|
// vgrad -= (vgrad * n) * n;
|
|
deriv = dir(0) * (vgrad*ld.t1) + dir(1) * (vgrad*ld.t2);
|
|
|
|
return badness;
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
class Opti2EdgeMinFunction : public MinFunction
|
|
{
|
|
const Mesh & mesh;
|
|
Opti2dLocalData & ld;
|
|
const NetgenGeometry& geo;
|
|
|
|
public:
|
|
Opti2EdgeMinFunction (const Mesh & amesh,
|
|
Opti2dLocalData & ald)
|
|
: mesh(amesh), ld(ald), geo(*amesh.GetGeometry()) { } ;
|
|
|
|
virtual double FuncGrad (const Vector & x, Vector & g) const;
|
|
virtual double Func (const Vector & x) const;
|
|
};
|
|
|
|
double Opti2EdgeMinFunction :: Func (const Vector & x) const
|
|
{
|
|
Vector g(x.Size());
|
|
return FuncGrad (x, g);
|
|
}
|
|
|
|
double Opti2EdgeMinFunction :: FuncGrad (const Vector & x, Vector & grad) const
|
|
{
|
|
int j, rot;
|
|
Vec<3> v1, v2, e1, e2, vgrad;
|
|
Point<3> pp1;
|
|
Vec<2> g1;
|
|
double badness, hbadness;
|
|
|
|
vgrad = 0.0;
|
|
badness = 0;
|
|
|
|
pp1 = ld.sp1 + x(0) * ld.t1;
|
|
geo.ProjectPointEdge(ld.surfi, ld.surfi2, pp1);
|
|
|
|
for (j = 0; j < ld.locelements.Size(); j++)
|
|
{
|
|
rot = ld.locrots[j];
|
|
const Element2d & bel = mesh[ld.locelements[j]];
|
|
|
|
v1 = mesh[bel.PNumMod(rot + 1)] - pp1;
|
|
v2 = mesh[bel.PNumMod(rot + 2)] - pp1;
|
|
|
|
e1 = v1;
|
|
e2 = v2;
|
|
e1 /= e1.Length();
|
|
e2 -= (e1 * e2) * e1;
|
|
e2 /= e2.Length();
|
|
|
|
if (ld.uselocalh) ld.loch = ld.lochs[j];
|
|
CalcTriangleBadness ( (e1 * v1), (e1 * v2), (e2 * v2), ld.locmetricweight, ld.loch,
|
|
hbadness, g1(0), g1(1));
|
|
|
|
badness += hbadness;
|
|
vgrad += g1(0) * e1 + g1(1) * e2;
|
|
}
|
|
|
|
auto n1 = geo.GetNormal(ld.surfi, pp1);
|
|
auto n2 = geo.GetNormal(ld.surfi2, pp1);
|
|
|
|
v1 = Cross (n1, n2);
|
|
v1.Normalize();
|
|
|
|
grad(0) = (vgrad * v1) * (ld.t1 * v1);
|
|
|
|
return badness;
|
|
}
|
|
|
|
|
|
|
|
|
|
class Opti2SurfaceMinFunctionJacobian : public MinFunction
|
|
{
|
|
const Mesh & mesh;
|
|
Opti2dLocalData & ld;
|
|
const NetgenGeometry& geo;
|
|
|
|
public:
|
|
Opti2SurfaceMinFunctionJacobian (const Mesh & amesh,
|
|
Opti2dLocalData & ald)
|
|
: mesh(amesh), ld(ald), geo(*amesh.GetGeometry())
|
|
{ } ;
|
|
virtual double FuncGrad (const Vector & x, Vector & g) const;
|
|
virtual double FuncDeriv (const Vector & x, const Vector & dir, double & deriv) const;
|
|
virtual double Func (const Vector & x) const;
|
|
};
|
|
|
|
double Opti2SurfaceMinFunctionJacobian ::
|
|
Func (const Vector & x) const
|
|
{
|
|
Vector g(x.Size());
|
|
return FuncGrad (x, g);
|
|
}
|
|
|
|
|
|
double Opti2SurfaceMinFunctionJacobian ::
|
|
FuncGrad (const Vector & x, Vector & grad) const
|
|
{
|
|
// from 2d:
|
|
|
|
int lpi, gpi;
|
|
Vec<3> vgrad;
|
|
Point<3> pp1;
|
|
Vec<2> g1, vdir;
|
|
double badness, hbad, hderiv;
|
|
|
|
vgrad = 0;
|
|
badness = 0;
|
|
|
|
// auto n = geo.GetNormal(ld.surfi, ld.sp1, &ld.gi1);
|
|
|
|
pp1 = ld.sp1 + x(0) * ld.t1 + x(1) * ld.t2;
|
|
|
|
// meshthis -> ProjectPoint (surfi, pp1);
|
|
// meshthis -> GetNormalVector (surfi, pp1, n);
|
|
|
|
static NgArray<Point<2>> pts2d;
|
|
pts2d.SetSize(mesh.GetNP());
|
|
|
|
grad = 0;
|
|
|
|
for (int j = 1; j <= ld.locelements.Size(); j++)
|
|
{
|
|
lpi = ld.locrots.Get(j);
|
|
const Element2d & bel =
|
|
mesh[ld.locelements.Get(j)];
|
|
|
|
gpi = bel.PNum(lpi);
|
|
|
|
for (int k = 1; k <= bel.GetNP(); k++)
|
|
{
|
|
PointIndex pi = bel.PNum(k);
|
|
pts2d.Elem(pi) = Point2d (ld.t1 * (mesh.Point(pi) - ld.sp1),
|
|
ld.t2 * (mesh.Point(pi) - ld.sp1));
|
|
}
|
|
pts2d.Elem(gpi) = { x(0), x(1) };
|
|
|
|
|
|
for (int k = 1; k <= 2; k++)
|
|
{
|
|
if (k == 1)
|
|
vdir = {1., 0.};
|
|
else
|
|
vdir = {0., 1.};
|
|
|
|
hbad = bel.
|
|
CalcJacobianBadnessDirDeriv (pts2d, lpi, vdir, hderiv);
|
|
|
|
grad(k-1) += hderiv;
|
|
if (k == 1)
|
|
badness += hbad;
|
|
}
|
|
}
|
|
|
|
|
|
/*
|
|
vgrad.Add (-(vgrad * n), n);
|
|
|
|
grad.Elem(1) = vgrad * t1;
|
|
grad.Elem(2) = vgrad * t2;
|
|
*/
|
|
return badness;
|
|
}
|
|
|
|
|
|
|
|
|
|
double Opti2SurfaceMinFunctionJacobian ::
|
|
FuncDeriv (const Vector & x, const Vector & dir, double & deriv) const
|
|
{
|
|
// from 2d:
|
|
|
|
int j, k, lpi, gpi;
|
|
Vec<3> vgrad;
|
|
Point<3> pp1;
|
|
Vec<2> g1, vdir;
|
|
double badness, hbad, hderiv;
|
|
|
|
vgrad = 0;
|
|
badness = 0;
|
|
|
|
// pp1 = sp1;
|
|
// pp1.Add2 (x.Get(1), t1, x.Get(2), t2);
|
|
pp1 = ld.sp1 + x(0) * ld.t1 + x(1) * ld.t2;
|
|
|
|
static NgArray<Point<2>> pts2d;
|
|
pts2d.SetSize(mesh.GetNP());
|
|
|
|
deriv = 0;
|
|
|
|
for (j = 1; j <= ld.locelements.Size(); j++)
|
|
{
|
|
lpi = ld.locrots.Get(j);
|
|
const Element2d & bel =
|
|
mesh[ld.locelements.Get(j)];
|
|
|
|
gpi = bel.PNum(lpi);
|
|
|
|
for (k = 1; k <= bel.GetNP(); k++)
|
|
{
|
|
PointIndex pi = bel.PNum(k);
|
|
pts2d.Elem(pi) = Point2d (ld.t1 * (mesh.Point(pi) - ld.sp1),
|
|
ld.t2 * (mesh.Point(pi) - ld.sp1));
|
|
}
|
|
pts2d.Elem(gpi) = Point2d (x(0), x(1));
|
|
|
|
|
|
vdir = { dir(0), dir(1) };
|
|
|
|
hbad = bel.
|
|
CalcJacobianBadnessDirDeriv (pts2d, lpi, vdir, hderiv);
|
|
|
|
deriv += hderiv;
|
|
badness += hbad;
|
|
}
|
|
|
|
|
|
return badness;
|
|
}
|
|
|
|
void MeshOptimize2d :: ImproveMesh (const MeshingParameters & mp)
|
|
{
|
|
static Timer timer("MeshSmoothing 2D"); RegionTimer reg (timer);
|
|
|
|
PrintMessage (3, "Smoothing");
|
|
|
|
CheckMeshApproximation (mesh);
|
|
|
|
int ncolors;
|
|
Array<int> colors;
|
|
bool mixed = false;
|
|
auto elementsonpoint = mesh.CreatePoint2SurfaceElementTable( faceindex );
|
|
NgArray<MeshPoint, PointIndex::BASE> savepoints(mesh.GetNP());
|
|
|
|
Table<PointIndex> color_table;
|
|
if(faceindex)
|
|
{
|
|
Array<SurfaceElementIndex> seia;
|
|
mesh.GetSurfaceElementsOfFace (faceindex, seia);
|
|
for (auto sei : seia)
|
|
if (mesh[sei].GetNP() != 3)
|
|
{
|
|
mixed = true;
|
|
break;
|
|
}
|
|
|
|
Array<int, PointIndex> compress(mesh.GetNP());
|
|
NgArray<PointIndex> icompress;
|
|
for (int i = 0; i < seia.Size(); i++)
|
|
{
|
|
const Element2d & el = mesh[seia[i]];
|
|
for (int j = 0; j < el.GetNP(); j++)
|
|
compress[el[j]] = -1;
|
|
}
|
|
for (int i = 0; i < seia.Size(); i++)
|
|
{
|
|
const Element2d & el = mesh[seia[i]];
|
|
for (int j = 0; j < el.GetNP(); j++)
|
|
if (compress[el[j]] == -1)
|
|
{
|
|
compress[el[j]] = icompress.Size();
|
|
icompress.Append(el[j]);
|
|
}
|
|
}
|
|
|
|
const auto & getDofs = [&] (int i)
|
|
{
|
|
return elementsonpoint[icompress[i]];
|
|
};
|
|
|
|
colors.SetSize(icompress.Size());
|
|
|
|
ncolors = ngcore::ComputeColoring( colors, mesh.GetNSE(), getDofs );
|
|
|
|
TableCreator<PointIndex> creator(ncolors);
|
|
for ( ; !creator.Done(); creator++)
|
|
ParallelForRange( Range(colors), [&](auto myrange)
|
|
{
|
|
for(auto i : myrange)
|
|
creator.Add(colors[i], icompress[i]);
|
|
});
|
|
|
|
color_table = creator.MoveTable();
|
|
}
|
|
else
|
|
{
|
|
for (auto & se : mesh.SurfaceElements())
|
|
if (se.GetNP() != 3)
|
|
{
|
|
for(auto pi : se.PNums())
|
|
if(mesh[pi].Type() == SURFACEPOINT)
|
|
{
|
|
mixed = true;
|
|
break;
|
|
}
|
|
if(mixed)
|
|
break;
|
|
}
|
|
|
|
const auto & getDofs = [&] (int i)
|
|
{
|
|
return elementsonpoint[i+PointIndex::BASE];
|
|
};
|
|
|
|
colors.SetSize(mesh.GetNP());
|
|
ncolors = ngcore::ComputeColoring( colors, mesh.GetNSE(), getDofs );
|
|
|
|
TableCreator<PointIndex> creator(ncolors);
|
|
for ( ; !creator.Done(); creator++)
|
|
ParallelForRange( Range(colors), [&](auto myrange)
|
|
{
|
|
for(auto i : myrange)
|
|
creator.Add(colors[i], PointIndex(i+PointIndex::BASE));
|
|
});
|
|
|
|
color_table = creator.MoveTable();
|
|
}
|
|
|
|
/*
|
|
int i, j, k;
|
|
Vector xedge(1);
|
|
if (improveedges)
|
|
for (i = 1; i <= mesh.GetNP(); i++)
|
|
if (mesh.PointType(i) == EDGEPOINT)
|
|
{
|
|
continue;
|
|
PrintDot ();
|
|
sp1 = mesh.Point(i);
|
|
|
|
locelements.SetSize(0);
|
|
locrots.SetSize (0);
|
|
lochs.SetSize (0);
|
|
surfi = surfi2 = surfi3 = 0;
|
|
|
|
for (j = 0; j < elementsonpoint[i].Size(); j++)
|
|
{
|
|
sei = elementsonpoint[i][j];
|
|
const Element2d * bel = &mesh[sei];
|
|
|
|
if (!surfi)
|
|
surfi = mesh.GetFaceDescriptor(bel->GetIndex()).SurfNr();
|
|
else if (surfi != mesh.GetFaceDescriptor(bel->GetIndex()).SurfNr())
|
|
{
|
|
if (surfi2 != 0 && surfi2 !=
|
|
mesh.GetFaceDescriptor(bel->GetIndex()).SurfNr())
|
|
surfi3 = mesh.GetFaceDescriptor(bel->GetIndex()).SurfNr();
|
|
else
|
|
surfi2 = mesh.GetFaceDescriptor(bel->GetIndex()).SurfNr();
|
|
}
|
|
|
|
locelements.Append (sei);
|
|
|
|
if (bel->PNum(1) == i)
|
|
locrots.Append (1);
|
|
else if (bel->PNum(2) == i)
|
|
locrots.Append (2);
|
|
else
|
|
locrots.Append (3);
|
|
|
|
if (uselocalh)
|
|
{
|
|
Point3d pmid = Center (mesh.Point(bel->PNum(1)),
|
|
mesh.Point(bel->PNum(2)),
|
|
mesh.Point(bel->PNum(3)));
|
|
lochs.Append (mesh.GetH(pmid));
|
|
}
|
|
}
|
|
|
|
if (surfi2 && !surfi3)
|
|
{
|
|
Vec3d n1, n2;
|
|
GetNormalVector (surfi, sp1, n1);
|
|
GetNormalVector (surfi2, sp1, n2);
|
|
t1 = Cross (n1, n2);
|
|
|
|
xedge = 0;
|
|
BFGS (xedge, edgeminf, par, 1e-6);
|
|
|
|
mesh.Point(i).X() += xedge.Get(1) * t1.X();
|
|
mesh.Point(i).Y() += xedge.Get(1) * t1.Y();
|
|
mesh.Point(i).Z() += xedge.Get(1) * t1.Z();
|
|
ProjectPoint2 (surfi, surfi2, mesh.Point(i));
|
|
}
|
|
}
|
|
*/
|
|
|
|
|
|
// NgProfiler::StopTimer (timer1);
|
|
|
|
/*
|
|
for (PointIndex pi = PointIndex::BASE; pi < mesh.GetNP()+PointIndex::BASE; pi++)
|
|
if (mesh[pi].Type() == SURFACEPOINT)
|
|
*/
|
|
|
|
static Timer tloop("MeshSmooting 2D - loop");
|
|
tloop.Start();
|
|
for (auto icolor : Range(color_table))
|
|
{
|
|
if (multithread.terminate)
|
|
break;
|
|
ParallelForRange( Range(color_table[icolor].Size()), [&](auto myrange)
|
|
{
|
|
Opti2dLocalData ld;
|
|
ld.uselocalh = mp.uselocalh;
|
|
ld.loch = mp.maxh;
|
|
ld.locmetricweight = metricweight;
|
|
ld.meshthis = this;
|
|
|
|
Opti2SurfaceMinFunction surfminf(mesh, ld);
|
|
Opti2SurfaceMinFunctionJacobian surfminfj(mesh, ld);
|
|
|
|
MinFunction & minfunc = mixed ? static_cast<MinFunction&>(surfminfj) : surfminf;
|
|
|
|
OptiParameters par;
|
|
par.maxit_linsearch = 8;
|
|
par.maxit_bfgs = 5;
|
|
for (auto i : myrange)
|
|
{
|
|
PointIndex pi = color_table[icolor][i];
|
|
if (mesh[pi].Type() == SURFACEPOINT)
|
|
{
|
|
if (multithread.terminate)
|
|
return;
|
|
|
|
if (elementsonpoint[pi].Size() == 0) continue;
|
|
|
|
ld.sp1 = mesh[pi];
|
|
|
|
Element2d & hel = mesh[elementsonpoint[pi][0]];
|
|
|
|
int hpi = 0;
|
|
for (int j = 1; j <= hel.GetNP(); j++)
|
|
if (hel.PNum(j) == pi)
|
|
{
|
|
hpi = j;
|
|
break;
|
|
}
|
|
|
|
ld.gi1 = hel.GeomInfoPi(hpi);
|
|
// SelectSurfaceOfPoint (ld.sp1, ld.gi1);
|
|
|
|
ld.locelements.SetSize(0);
|
|
ld.locrots.SetSize (0);
|
|
ld.lochs.SetSize (0);
|
|
ld.loc_pnts2.SetSize (0);
|
|
ld.loc_pnts3.SetSize (0);
|
|
|
|
for (int j = 0; j < elementsonpoint[pi].Size(); j++)
|
|
{
|
|
SurfaceElementIndex sei = elementsonpoint[pi][j];
|
|
const Element2d & bel = mesh[sei];
|
|
ld.surfi = mesh.GetFaceDescriptor(bel.GetIndex()).SurfNr();
|
|
|
|
ld.locelements.Append (sei);
|
|
|
|
for (int k = 1; k <= bel.GetNP(); k++)
|
|
if (bel.PNum(k) == pi)
|
|
{
|
|
ld.locrots.Append (k);
|
|
ld.loc_pnts2.Append (mesh[bel.PNumMod(k + 1)]);
|
|
ld.loc_pnts3.Append (mesh[bel.PNumMod(k + 2)]);
|
|
break;
|
|
}
|
|
|
|
if (ld.uselocalh)
|
|
{
|
|
Point3d pmid = Center (mesh[bel[0]], mesh[bel[1]], mesh[bel[2]]);
|
|
ld.lochs.Append (mesh.GetH(pmid));
|
|
}
|
|
}
|
|
|
|
|
|
ld.normal = geo.GetNormal(ld.surfi, ld.sp1, &ld.gi1);
|
|
ld.t1 = ld.normal.GetNormal ();
|
|
ld.t2 = Cross (ld.normal, ld.t1);
|
|
|
|
if(mixed)
|
|
{
|
|
// save points, and project to tangential plane (only for optimization with Opti2SurfaceMinFunctionJacobian in mixed element meshes)
|
|
for (int j = 0; j < ld.locelements.Size(); j++)
|
|
{
|
|
const Element2d & el = mesh[ld.locelements[j]];
|
|
for (int k = 0; k < el.GetNP(); k++)
|
|
savepoints[el[k]] = mesh[el[k]];
|
|
}
|
|
|
|
for (int j = 0; j < ld.locelements.Size(); j++)
|
|
{
|
|
const Element2d & el = mesh[ld.locelements[j]];
|
|
for (int k = 0; k < el.GetNP(); k++)
|
|
{
|
|
PointIndex hhpi = el[k];
|
|
double lam = ld.normal * (mesh[hhpi] - ld.sp1);
|
|
mesh[hhpi] -= lam * ld.normal;
|
|
}
|
|
}
|
|
}
|
|
|
|
Vector x(2);
|
|
x = 0;
|
|
par.typx = 0.3*ld.lochs[0];
|
|
|
|
// NgProfiler::StartTimer (timer2);
|
|
|
|
BFGS (x, minfunc, par, 1e-6);
|
|
|
|
// NgProfiler::StopTimer (timer2);
|
|
|
|
auto origp = mesh[pi];
|
|
int loci = 1;
|
|
double fact = 1;
|
|
int moveisok = 0;
|
|
|
|
if(mixed)
|
|
{
|
|
// restore other points
|
|
for (int j = 0; j < ld.locelements.Size(); j++)
|
|
{
|
|
const Element2d & el = mesh[ld.locelements[j]];
|
|
for (int k = 0; k < el.GetNP(); k++)
|
|
{
|
|
PointIndex hhpi = el[k];
|
|
if (hhpi != pi) mesh[hhpi] = savepoints[hhpi];
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
//optimizer loop (if whole distance is not possible, move only a bit!!!!)
|
|
while (loci <= 5 && !moveisok)
|
|
{
|
|
loci ++;
|
|
/*
|
|
mesh[pi].X() = origp.X() + (x.Get(1) * t1.X() + x.Get(2) * t2.X())*fact;
|
|
mesh[pi].Y() = origp.Y() + (x.Get(1) * t1.Y() + x.Get(2) * t2.Y())*fact;
|
|
mesh[pi].Z() = origp.Z() + (x.Get(1) * t1.Z() + x.Get(2) * t2.Z())*fact;
|
|
*/
|
|
Vec<3> hv = x(0) * ld.t1 + x(1) * ld.t2;
|
|
Point3d hnp = origp + Vec3d (hv);
|
|
mesh[pi](0) = hnp.X();
|
|
mesh[pi](1) = hnp.Y();
|
|
mesh[pi](2) = hnp.Z();
|
|
|
|
fact = fact/2.;
|
|
|
|
// ProjectPoint (surfi, mesh[pi]);
|
|
// moveisok = CalcPointGeomInfo(surfi, ngi, mesh[pi]);
|
|
|
|
PointGeomInfo ngi;
|
|
ngi = ld.gi1;
|
|
moveisok = geo.ProjectPointGI(ld.surfi, mesh[pi], ngi);
|
|
// point lies on same chart in stlsurface
|
|
|
|
if (moveisok)
|
|
{
|
|
for (int j = 0; j < ld.locelements.Size(); j++)
|
|
mesh[ld.locelements[j]].GeomInfoPi(ld.locrots[j]) = ngi;
|
|
}
|
|
else
|
|
{
|
|
mesh[pi] = origp;
|
|
}
|
|
|
|
}
|
|
}
|
|
}
|
|
}, mixed ? 1 : ngcore::TasksPerThread(4)); // mixed element smoothing not parallel yet
|
|
}
|
|
|
|
tloop.Stop();
|
|
CheckMeshApproximation (mesh);
|
|
mesh.SetNextTimeStamp();
|
|
}
|
|
}
|