netgen/libsrc/occ/occgenmesh.cpp

1476 lines
48 KiB
C++
Raw Normal View History

#ifdef OCCGEOMETRY
#include <mystdlib.h>
#include <occgeom.hpp>
#include <meshing.hpp>
namespace netgen
{
#include "occmeshsurf.hpp"
#define TCL_OK 0
#define TCL_ERROR 1
#define DIVIDEEDGESECTIONS 1000
#define IGNORECURVELENGTH 1e-4
#define VSMALL 1e-10
2019-07-28 23:22:48 +05:00
DLL_HEADER bool merge_solids = 1;
// can you please explain what you intend to compute here (JS) !!!
2019-07-28 23:22:48 +05:00
double Line :: Dist (Line l)
{
Vec<3> n = p1-p0;
Vec<3> q = l.p1-l.p0;
double nq = n*q;
2019-07-28 23:22:48 +05:00
Point<3> p = p0 + 0.5*n;
double lambda = (p-l.p0)*n / (nq + VSMALL);
2019-07-28 23:22:48 +05:00
if (lambda >= 0 && lambda <= 1)
{
2019-07-28 23:22:48 +05:00
double d = (p-l.p0-lambda*q).Length();
// if (d < 1e-3) d = 1e99;
return d;
}
2019-07-28 23:22:48 +05:00
else
return 1e99;
}
2019-07-28 23:22:48 +05:00
inline Point<3> occ2ng (const gp_Pnt & p)
{
return Point<3> (p.X(), p.Y(), p.Z());
}
2019-07-27 22:05:43 +05:00
double ComputeH (double kappa, const MeshingParameters & mparam)
2019-07-28 23:22:48 +05:00
{
kappa *= mparam.curvaturesafety;
2019-07-28 23:22:48 +05:00
/*
double hret;
2019-07-28 23:22:48 +05:00
if (mparam.maxh * kappa < 1)
hret = mparam.maxh;
else
hret = 1 / (kappa + VSMALL);
2019-07-28 23:22:48 +05:00
if (mparam.maxh < hret)
hret = mparam.maxh;
2019-07-28 23:22:48 +05:00
return hret;
*/
// return min(mparam.maxh, 1/kappa);
return (mparam.maxh*kappa < 1) ? mparam.maxh : 1/kappa;
}
2019-07-28 23:22:48 +05:00
void RestrictHTriangle (gp_Pnt2d & par0, gp_Pnt2d & par1, gp_Pnt2d & par2,
BRepLProp_SLProps * prop, BRepLProp_SLProps * prop2, Mesh & mesh, int depth, double h,
2019-07-28 23:22:48 +05:00
const MeshingParameters & mparam)
{
int ls = -1;
2019-07-28 23:22:48 +05:00
gp_Pnt pnt0,pnt1,pnt2;
2019-07-28 23:22:48 +05:00
prop->SetParameters (par0.X(), par0.Y());
pnt0 = prop->Value();
2019-07-28 23:22:48 +05:00
prop->SetParameters (par1.X(), par1.Y());
pnt1 = prop->Value();
2019-07-28 23:22:48 +05:00
prop->SetParameters (par2.X(), par2.Y());
pnt2 = prop->Value();
2019-07-28 23:22:48 +05:00
double aux;
double maxside = pnt0.Distance(pnt1);
ls = 2;
aux = pnt1.Distance(pnt2);
if(aux > maxside)
{
2019-07-28 23:22:48 +05:00
maxside = aux;
ls = 0;
}
2019-07-28 23:22:48 +05:00
aux = pnt2.Distance(pnt0);
if(aux > maxside)
{
2019-07-28 23:22:48 +05:00
maxside = aux;
ls = 1;
}
2019-07-28 23:22:48 +05:00
gp_Pnt2d parmid;
2019-07-28 23:22:48 +05:00
parmid.SetX( (par0.X()+par1.X()+par2.X()) / 3 );
parmid.SetY( (par0.Y()+par1.Y()+par2.Y()) / 3 );
2019-07-28 23:22:48 +05:00
if (depth%3 == 0)
{
2019-07-28 23:22:48 +05:00
double curvature = 0;
prop2->SetParameters (parmid.X(), parmid.Y());
if (!prop2->IsCurvatureDefined())
2019-07-28 23:22:48 +05:00
{
(*testout) << "curvature not defined!" << endl;
return;
2019-07-28 23:22:48 +05:00
}
curvature = max(fabs(prop2->MinCurvature()),
fabs(prop2->MaxCurvature()));
prop2->SetParameters (par0.X(), par0.Y());
if (!prop2->IsCurvatureDefined())
2019-07-28 23:22:48 +05:00
{
(*testout) << "curvature not defined!" << endl;
return;
2019-07-28 23:22:48 +05:00
}
curvature = max(curvature,max(fabs(prop2->MinCurvature()),
fabs(prop2->MaxCurvature())));
prop2->SetParameters (par1.X(), par1.Y());
if (!prop2->IsCurvatureDefined())
2019-07-28 23:22:48 +05:00
{
(*testout) << "curvature not defined!" << endl;
return;
2019-07-28 23:22:48 +05:00
}
curvature = max(curvature,max(fabs(prop2->MinCurvature()),
fabs(prop2->MaxCurvature())));
prop2->SetParameters (par2.X(), par2.Y());
if (!prop2->IsCurvatureDefined())
2019-07-28 23:22:48 +05:00
{
(*testout) << "curvature not defined!" << endl;
return;
2019-07-28 23:22:48 +05:00
}
curvature = max(curvature,max(fabs(prop2->MinCurvature()),
fabs(prop2->MaxCurvature())));
2019-07-28 23:22:48 +05:00
//(*testout) << "curvature " << curvature << endl;
2019-07-28 23:22:48 +05:00
if (curvature < 1e-3)
{
//(*testout) << "curvature too small (" << curvature << ")!" << endl;
return;
// return war bis 10.2.05 auskommentiert
2019-07-28 23:22:48 +05:00
}
2019-07-28 23:22:48 +05:00
h = ComputeH (curvature+1e-10, mparam);
2019-07-28 23:22:48 +05:00
if(h < 1e-4*maxside)
return;
// if (h > 30) return;
}
2019-07-28 23:22:48 +05:00
if (h < maxside && depth < 10)
{
2019-07-28 23:22:48 +05:00
//cout << "\r h " << h << flush;
gp_Pnt2d pm;
2019-07-28 23:22:48 +05:00
//cout << "h " << h << " maxside " << maxside << " depth " << depth << endl;
//cout << "par0 " << par0.X() << " " << par0.Y()
//<< " par1 " << par1.X() << " " << par1.Y()
// << " par2 " << par2.X() << " " << par2.Y()<< endl;
2019-07-28 23:22:48 +05:00
if(ls == 0)
{
pm.SetX(0.5*(par1.X()+par2.X())); pm.SetY(0.5*(par1.Y()+par2.Y()));
RestrictHTriangle(pm, par2, par0, prop, prop2, mesh, depth+1, h, mparam);
RestrictHTriangle(pm, par0, par1, prop, prop2, mesh, depth+1, h, mparam);
2019-07-28 23:22:48 +05:00
}
else if(ls == 1)
{
pm.SetX(0.5*(par0.X()+par2.X())); pm.SetY(0.5*(par0.Y()+par2.Y()));
RestrictHTriangle(pm, par1, par2, prop, prop2, mesh, depth+1, h, mparam);
RestrictHTriangle(pm, par0, par1, prop, prop2, mesh, depth+1, h, mparam);
2019-07-28 23:22:48 +05:00
}
else if(ls == 2)
{
pm.SetX(0.5*(par0.X()+par1.X())); pm.SetY(0.5*(par0.Y()+par1.Y()));
RestrictHTriangle(pm, par1, par2, prop, prop2, mesh, depth+1, h, mparam);
RestrictHTriangle(pm, par2, par0, prop, prop2, mesh, depth+1, h, mparam);
2019-07-28 23:22:48 +05:00
}
}
2019-07-28 23:22:48 +05:00
else
{
2019-07-28 23:22:48 +05:00
gp_Pnt pnt;
Point3d p3d;
2019-07-28 23:22:48 +05:00
prop->SetParameters (parmid.X(), parmid.Y());
pnt = prop->Value();
p3d = Point3d(pnt.X(), pnt.Y(), pnt.Z());
mesh.RestrictLocalH (p3d, h);
2019-07-28 23:22:48 +05:00
p3d = Point3d(pnt0.X(), pnt0.Y(), pnt0.Z());
mesh.RestrictLocalH (p3d, h);
2019-07-28 23:22:48 +05:00
p3d = Point3d(pnt1.X(), pnt1.Y(), pnt1.Z());
mesh.RestrictLocalH (p3d, h);
2019-07-28 23:22:48 +05:00
p3d = Point3d(pnt2.X(), pnt2.Y(), pnt2.Z());
mesh.RestrictLocalH (p3d, h);
2019-07-28 23:22:48 +05:00
//(*testout) << "p = " << p3d << ", h = " << h << ", maxside = " << maxside << endl;
}
2019-07-28 23:22:48 +05:00
}
2019-07-28 23:22:48 +05:00
void DivideEdge (TopoDS_Edge & edge, NgArray<MeshPoint> & ps,
NgArray<double> & params, Mesh & mesh,
const MeshingParameters & mparam)
{
double s0, s1;
double maxh = mparam.maxh;
int nsubedges = 1;
gp_Pnt pnt, oldpnt;
double svalue[DIVIDEEDGESECTIONS];
2019-07-28 23:22:48 +05:00
GProp_GProps system;
BRepGProp::LinearProperties(edge, system);
double L = system.Mass();
2019-07-28 23:22:48 +05:00
Handle(Geom_Curve) c = BRep_Tool::Curve(edge, s0, s1);
2019-07-28 23:22:48 +05:00
double hvalue[DIVIDEEDGESECTIONS+1];
hvalue[0] = 0;
pnt = c->Value(s0);
2019-07-28 23:22:48 +05:00
double olddist = 0;
double dist = 0;
2019-07-28 23:22:48 +05:00
int tmpVal = (int)(DIVIDEEDGESECTIONS);
2019-07-28 23:22:48 +05:00
for (int i = 1; i <= tmpVal; i++)
{
2019-07-28 23:22:48 +05:00
oldpnt = pnt;
pnt = c->Value(s0+(i/double(DIVIDEEDGESECTIONS))*(s1-s0));
hvalue[i] = hvalue[i-1] +
1.0/mesh.GetH(Point3d(pnt.X(), pnt.Y(), pnt.Z()))*
pnt.Distance(oldpnt);
2019-07-28 23:22:48 +05:00
//(*testout) << "mesh.GetH(Point3d(pnt.X(), pnt.Y(), pnt.Z())) " << mesh.GetH(Point3d(pnt.X(), pnt.Y(), pnt.Z()))
// << " pnt.Distance(oldpnt) " << pnt.Distance(oldpnt) << endl;
2019-07-28 23:22:48 +05:00
olddist = dist;
dist = pnt.Distance(oldpnt);
}
2019-07-28 23:22:48 +05:00
// nsubedges = int(ceil(hvalue[DIVIDEEDGESECTIONS]));
nsubedges = max (1, int(floor(hvalue[DIVIDEEDGESECTIONS]+0.5)));
2019-07-28 23:22:48 +05:00
ps.SetSize(nsubedges-1);
params.SetSize(nsubedges+1);
2019-07-28 23:22:48 +05:00
int i = 1;
int i1 = 0;
do
{
2019-07-28 23:22:48 +05:00
if (hvalue[i1]/hvalue[DIVIDEEDGESECTIONS]*nsubedges >= i)
{
params[i] = s0+(i1/double(DIVIDEEDGESECTIONS))*(s1-s0);
pnt = c->Value(params[i]);
ps[i-1] = MeshPoint (Point3d(pnt.X(), pnt.Y(), pnt.Z()));
i++;
2019-07-28 23:22:48 +05:00
}
i1++;
if (i1 > DIVIDEEDGESECTIONS)
{
nsubedges = i;
ps.SetSize(nsubedges-1);
params.SetSize(nsubedges+1);
cout << "divide edge: local h too small" << endl;
2019-07-28 23:22:48 +05:00
}
} while (i < nsubedges);
2019-07-28 23:22:48 +05:00
params[0] = s0;
params[nsubedges] = s1;
2019-07-28 23:22:48 +05:00
if (params[nsubedges] <= params[nsubedges-1])
{
2019-07-28 23:22:48 +05:00
cout << "CORRECTED" << endl;
ps.SetSize (nsubedges-2);
params.SetSize (nsubedges);
params[nsubedges] = s1;
}
2019-07-28 23:22:48 +05:00
}
2019-07-27 22:05:43 +05:00
void OCCFindEdges (OCCGeometry & geom, Mesh & mesh, const MeshingParameters & mparam)
2019-07-28 23:22:48 +05:00
{
static Timer t("OCCFindEdges"); RegionTimer r(t);
static Timer tsearch("OCCFindEdges - search point");
const char * savetask = multithread.task;
multithread.task = "Edge meshing";
2019-07-28 23:22:48 +05:00
(*testout) << "edge meshing" << endl;
2019-07-28 23:22:48 +05:00
int nvertices = geom.vmap.Extent();
int nedges = geom.emap.Extent();
2019-07-28 23:22:48 +05:00
(*testout) << "nvertices = " << nvertices << endl;
(*testout) << "nedges = " << nedges << endl;
2019-07-28 23:22:48 +05:00
double eps = 1e-6 * geom.GetBoundingBox().Diam();
2019-07-28 23:22:48 +05:00
tsearch.Start();
for (int i = 1; i <= nvertices; i++)
{
2019-07-28 23:22:48 +05:00
gp_Pnt pnt = BRep_Tool::Pnt (TopoDS::Vertex(geom.vmap(i)));
MeshPoint mp( Point<3>(pnt.X(), pnt.Y(), pnt.Z()) );
2019-07-28 23:22:48 +05:00
bool exists = 0;
if (merge_solids)
2019-08-08 03:17:53 +05:00
for (PointIndex pi : mesh.Points().Range())
if (Dist2 (mesh[pi], Point<3>(mp)) < eps*eps)
2019-07-28 23:22:48 +05:00
{
2019-08-08 03:17:53 +05:00
exists = true;
2019-07-28 23:22:48 +05:00
break;
}
if (!exists)
mesh.AddPoint (mp);
}
tsearch.Stop();
(*testout) << "different vertices = " << mesh.GetNP() << endl;
2019-08-08 02:32:14 +05:00
// int first_ep = mesh.GetNP()+1;
// PointIndex first_ep = mesh.Points().End();
PointIndex first_ep = *mesh.Points().Range().end();
2019-08-08 02:32:14 +05:00
auto vertexrange = mesh.Points().Range();
2019-07-28 23:22:48 +05:00
NgArray<int> face2solid[2];
2019-08-08 03:17:53 +05:00
for (int i = 0; i < 2; i++)
{
2019-07-28 23:22:48 +05:00
face2solid[i].SetSize (geom.fmap.Extent());
face2solid[i] = 0;
}
2019-07-28 23:22:48 +05:00
int solidnr = 0;
for (TopExp_Explorer exp0(geom.shape, TopAbs_SOLID); exp0.More(); exp0.Next())
{
2019-07-28 23:22:48 +05:00
solidnr++;
for (TopExp_Explorer exp1(exp0.Current(), TopAbs_FACE); exp1.More(); exp1.Next())
{
TopoDS_Face face = TopoDS::Face(exp1.Current());
int facenr = geom.fmap.FindIndex(face);
if (face2solid[0][facenr-1] == 0)
2019-07-28 23:22:48 +05:00
face2solid[0][facenr-1] = solidnr;
else
2019-07-28 23:22:48 +05:00
face2solid[1][facenr-1] = solidnr;
}
}
2019-07-28 23:22:48 +05:00
int total = 0;
for (int i3 = 1; i3 <= geom.fmap.Extent(); i3++)
for (TopExp_Explorer exp2(geom.fmap(i3), TopAbs_WIRE); exp2.More(); exp2.Next())
for (TopExp_Explorer exp3(exp2.Current(), TopAbs_EDGE); exp3.More(); exp3.Next())
total++;
2019-07-28 23:22:48 +05:00
int facenr = 0;
int edgenr = 0;
2019-07-28 23:22:48 +05:00
(*testout) << "faces = " << geom.fmap.Extent() << endl;
int curr = 0;
2019-07-28 23:22:48 +05:00
for (int i3 = 1; i3 <= geom.fmap.Extent(); i3++)
{
2019-07-28 23:22:48 +05:00
TopoDS_Face face = TopoDS::Face(geom.fmap(i3));
facenr = geom.fmap.FindIndex (face); // sollte doch immer == i3 sein ??? JS
int solidnr0 = face2solid[0][i3-1];
int solidnr1 = face2solid[1][i3-1];
/* auskommentiert am 3.3.05 von robert
for (exp2.Init (geom.somap(solidnr0), TopAbs_FACE); exp2.More(); exp2.Next())
{
TopoDS_Face face2 = TopoDS::Face(exp2.Current());
if (geom.fmap.FindIndex(face2) == facenr)
{
// if (face.Orientation() != face2.Orientation()) swap (solidnr0, solidnr1);
}
}
*/
mesh.AddFaceDescriptor (FaceDescriptor(facenr, solidnr0, solidnr1, 0));
// Philippose - 06/07/2009
// Add the face colour to the mesh data
Quantity_Color face_colour;
if(!(geom.face_colours.IsNull())
&& (geom.face_colours->GetColor(face,XCAFDoc_ColorSurf,face_colour)))
{
mesh.GetFaceDescriptor(facenr).SetSurfColour(Vec3d(face_colour.Red(),face_colour.Green(),face_colour.Blue()));
2019-07-28 23:22:48 +05:00
}
else
{
mesh.GetFaceDescriptor(facenr).SetSurfColour(Vec3d(0.0,1.0,0.0));
2019-07-28 23:22:48 +05:00
}
2019-07-28 23:22:48 +05:00
if(geom.fnames.Size()>=facenr)
mesh.GetFaceDescriptor(facenr).SetBCName(&geom.fnames[facenr-1]);
mesh.GetFaceDescriptor(facenr).SetBCProperty(facenr);
// ACHTUNG! STIMMT NICHT ALLGEMEIN (RG)
2019-07-28 23:22:48 +05:00
Handle(Geom_Surface) occface = BRep_Tool::Surface(face);
2019-07-28 23:22:48 +05:00
for (TopExp_Explorer exp2 (face, TopAbs_WIRE); exp2.More(); exp2.Next())
{
TopoDS_Shape wire = exp2.Current();
for (TopExp_Explorer exp3 (wire, TopAbs_EDGE); exp3.More(); exp3.Next())
2019-07-28 23:22:48 +05:00
{
curr++;
(*testout) << "edge nr " << curr << endl;
multithread.percent = 100 * curr / double (total);
if (multithread.terminate) return;
2019-07-28 23:22:48 +05:00
TopoDS_Edge edge = TopoDS::Edge (exp3.Current());
if (BRep_Tool::Degenerated(edge))
{
//(*testout) << "ignoring degenerated edge" << endl;
continue;
}
2019-07-28 23:22:48 +05:00
if (geom.vmap.FindIndex(TopExp::FirstVertex (edge)) ==
geom.vmap.FindIndex(TopExp::LastVertex (edge)))
{
2019-07-28 23:22:48 +05:00
GProp_GProps system;
BRepGProp::LinearProperties(edge, system);
if (system.Mass() < eps)
{
cout << "ignoring edge " << geom.emap.FindIndex (edge)
<< ". closed edge with length < " << eps << endl;
continue;
}
}
2019-07-28 23:22:48 +05:00
Handle(Geom2d_Curve) cof;
double s0, s1;
cof = BRep_Tool::CurveOnSurface (edge, face, s0, s1);
2019-07-28 23:22:48 +05:00
int geomedgenr = geom.emap.FindIndex(edge);
2019-07-28 23:22:48 +05:00
NgArray <MeshPoint> mp;
NgArray <double> params;
2019-07-28 23:22:48 +05:00
DivideEdge (edge, mp, params, mesh, mparam);
2019-08-08 02:32:14 +05:00
2019-08-08 03:17:53 +05:00
NgArray<PointIndex> pnums(mp.Size()+2);
2019-07-28 23:22:48 +05:00
if (!merge_solids)
{
2019-08-08 02:32:14 +05:00
pnums[0] = geom.vmap.FindIndex (TopExp::FirstVertex (edge)) + PointIndex::BASE-1;
2019-08-08 03:17:53 +05:00
pnums.Last() = geom.vmap.FindIndex (TopExp::LastVertex (edge)) + PointIndex::BASE-1;
}
2019-07-28 23:22:48 +05:00
else
{
2019-07-28 23:22:48 +05:00
Point<3> fp = occ2ng (BRep_Tool::Pnt (TopExp::FirstVertex (edge)));
Point<3> lp = occ2ng (BRep_Tool::Pnt (TopExp::LastVertex (edge)));
2019-08-08 02:32:14 +05:00
pnums[0] = PointIndex::INVALID;
pnums.Last() = PointIndex::INVALID;
for (PointIndex pi : vertexrange)
2019-07-28 23:22:48 +05:00
{
if (Dist2 (mesh[pi], fp) < eps*eps) pnums[0] = pi;
if (Dist2 (mesh[pi], lp) < eps*eps) pnums.Last() = pi;
}
}
2019-08-08 03:17:53 +05:00
for (size_t i = 1; i <= mp.Size(); i++)
{
2019-07-28 23:22:48 +05:00
bool exists = 0;
tsearch.Start();
2019-08-08 03:17:53 +05:00
// for (PointIndex j = first_ep; j < mesh.Points().End(); j++)
for (PointIndex j = first_ep; j < *mesh.Points().Range().end(); j++)
2019-08-08 02:32:14 +05:00
if ((mesh.Point(j)-Point<3>(mp[i-1])).Length() < eps)
{
2019-08-08 03:17:53 +05:00
exists = true;
pnums[i] = j;
2019-08-08 02:32:14 +05:00
break;
}
2019-07-28 23:22:48 +05:00
tsearch.Stop();
2019-08-08 03:17:53 +05:00
if (!exists)
pnums[i] = mesh.AddPoint (mp[i-1]);
}
2019-07-28 23:22:48 +05:00
(*testout) << "NP = " << mesh.GetNP() << endl;
//(*testout) << pnums[pnums.Size()-1] << endl;
2019-08-08 03:17:53 +05:00
for (size_t i = 1; i <= mp.Size()+1; i++)
2019-07-28 23:22:48 +05:00
{
edgenr++;
Segment seg;
seg[0] = pnums[i-1];
seg[1] = pnums[i];
seg.edgenr = edgenr;
seg.si = facenr;
seg.epgeominfo[0].dist = params[i-1];
seg.epgeominfo[1].dist = params[i];
seg.epgeominfo[0].edgenr = geomedgenr;
seg.epgeominfo[1].edgenr = geomedgenr;
gp_Pnt2d p2d;
p2d = cof->Value(params[i-1]);
// if (i == 1) p2d = cof->Value(s0);
seg.epgeominfo[0].u = p2d.X();
seg.epgeominfo[0].v = p2d.Y();
p2d = cof->Value(params[i]);
// if (i == mp.Size()+1) p2d = cof -> Value(s1);
seg.epgeominfo[1].u = p2d.X();
seg.epgeominfo[1].v = p2d.Y();
/*
if (occface->IsUPeriodic())
{
cout << "U Periodic" << endl;
if (fabs(seg.epgeominfo[1].u-seg.epgeominfo[0].u) >
fabs(seg.epgeominfo[1].u-
(seg.epgeominfo[0].u-occface->UPeriod())))
seg.epgeominfo[0].u = p2d.X()+occface->UPeriod();
if (fabs(seg.epgeominfo[1].u-seg.epgeominfo[0].u) >
fabs(seg.epgeominfo[1].u-
(seg.epgeominfo[0].u+occface->UPeriod())))
seg.epgeominfo[0].u = p2d.X()-occface->UPeriod();
}
if (occface->IsVPeriodic())
{
cout << "V Periodic" << endl;
if (fabs(seg.epgeominfo[1].v-seg.epgeominfo[0].v) >
fabs(seg.epgeominfo[1].v-
(seg.epgeominfo[0].v-occface->VPeriod())))
seg.epgeominfo[0].v = p2d.Y()+occface->VPeriod();
if (fabs(seg.epgeominfo[1].v-seg.epgeominfo[0].v) >
fabs(seg.epgeominfo[1].v-
(seg.epgeominfo[0].v+occface->VPeriod())))
seg.epgeominfo[0].v = p2d.Y()-occface->VPeriod();
}
*/
if (edge.Orientation() == TopAbs_REVERSED)
{
swap (seg[0], seg[1]);
swap (seg.epgeominfo[0].dist, seg.epgeominfo[1].dist);
swap (seg.epgeominfo[0].u, seg.epgeominfo[1].u);
swap (seg.epgeominfo[0].v, seg.epgeominfo[1].v);
}
mesh.AddSegment (seg);
//edgesegments[geomedgenr-1]->Append(mesh.GetNSeg());
2019-07-28 23:22:48 +05:00
}
}
}
}
2019-07-28 23:22:48 +05:00
// for(i=1; i<=mesh.GetNSeg(); i++)
// (*testout) << "edge " << mesh.LineSegment(i).edgenr << " face " << mesh.LineSegment(i).si
// << " p1 " << mesh.LineSegment(i)[0] << " p2 " << mesh.LineSegment(i)[1] << endl;
// exit(10);
2019-07-28 23:22:48 +05:00
mesh.CalcSurfacesOfNode();
multithread.task = savetask;
}
void OCCMeshSurface (OCCGeometry & geom, Mesh & mesh,
2019-07-27 22:05:43 +05:00
MeshingParameters & mparam)
2019-07-28 23:22:48 +05:00
{
static Timer t("OCCMeshSurface"); RegionTimer r(t);
// int i, j, k;
// int changed;
2019-07-28 23:22:48 +05:00
const char * savetask = multithread.task;
multithread.task = "Surface meshing";
2019-07-28 23:22:48 +05:00
geom.facemeshstatus = 0;
2019-07-28 23:22:48 +05:00
int noldp = mesh.GetNP();
2019-07-28 23:22:48 +05:00
double starttime = GetTime();
2019-08-08 02:32:14 +05:00
NgArray<int, PointIndex::BASE> glob2loc(noldp);
2019-07-28 23:22:48 +05:00
//int projecttype = PARAMETERSPACE;
2019-07-28 23:22:48 +05:00
int projecttype = PARAMETERSPACE;
2019-07-28 23:22:48 +05:00
int notrys = 1;
2019-07-28 23:22:48 +05:00
int surfmesherror = 0;
2019-07-28 23:22:48 +05:00
for (int k = 1; k <= mesh.GetNFD(); k++)
{
2019-07-28 23:22:48 +05:00
if(1==0 && !geom.fvispar[k-1].IsDrawable())
{
(*testout) << "ignoring face " << k << endl;
cout << "ignoring face " << k << endl;
continue;
2019-07-28 23:22:48 +05:00
}
2019-07-28 23:22:48 +05:00
(*testout) << "mesh face " << k << endl;
multithread.percent = 100 * k / (mesh.GetNFD() + VSMALL);
geom.facemeshstatus[k-1] = -1;
2019-07-28 23:22:48 +05:00
FaceDescriptor & fd = mesh.GetFaceDescriptor(k);
2019-07-28 23:22:48 +05:00
int oldnf = mesh.GetNSE();
2019-07-28 23:22:48 +05:00
Box<3> bb = geom.GetBoundingBox();
int projecttype = PLANESPACE;
2019-07-28 23:22:48 +05:00
static Timer tinit("init");
tinit.Start();
Meshing2OCCSurfaces meshing(TopoDS::Face(geom.fmap(k)), bb, projecttype, mparam);
tinit.Stop();
2019-07-29 02:22:47 +05:00
static Timer tprint("print");
tprint.Start();
2019-07-28 23:22:48 +05:00
if (meshing.GetProjectionType() == PLANESPACE)
PrintMessage (2, "Face ", k, " / ", mesh.GetNFD(), " (plane space projection)");
else
PrintMessage (2, "Face ", k, " / ", mesh.GetNFD(), " (parameter space projection)");
2019-07-29 02:22:47 +05:00
tprint.Stop();
2019-07-28 23:22:48 +05:00
if (surfmesherror)
cout << "Surface meshing error occurred before (in " << surfmesherror << " faces)" << endl;
2019-07-28 23:22:48 +05:00
// Meshing2OCCSurfaces meshing(f2, bb);
meshing.SetStartTime (starttime);
//(*testout) << "Face " << k << endl << endl;
2019-07-28 23:22:48 +05:00
if (meshing.GetProjectionType() == PLANESPACE)
{
static Timer t("MeshSurface: Find edges and points - Physical"); RegionTimer r(t);
int cntp = 0;
glob2loc = 0;
2019-08-08 03:17:53 +05:00
for (Segment & seg : mesh.LineSegments())
if (seg.si == k)
for (int j = 0; j < 2; j++)
{
2019-08-08 03:17:53 +05:00
PointIndex pi = seg[j];
if (glob2loc[pi] == 0)
2019-07-28 23:22:48 +05:00
{
2019-08-08 03:17:53 +05:00
meshing.AddPoint (mesh.Point(pi), pi);
cntp++;
glob2loc[pi] = cntp;
2019-07-28 23:22:48 +05:00
}
}
2019-08-08 03:17:53 +05:00
/*
2019-07-28 23:22:48 +05:00
for (int i = 1; i <= mesh.GetNSeg(); i++)
{
Segment & seg = mesh.LineSegment(i);
2019-08-08 03:17:53 +05:00
*/
for (Segment & seg : mesh.LineSegments())
if (seg.si == k)
{
PointGeomInfo gi0, gi1;
gi0.trignum = gi1.trignum = k;
gi0.u = seg.epgeominfo[0].u;
gi0.v = seg.epgeominfo[0].v;
gi1.u = seg.epgeominfo[1].u;
gi1.v = seg.epgeominfo[1].v;
meshing.AddBoundaryElement (glob2loc[seg[0]], glob2loc[seg[1]], gi0, gi1);
}
2019-07-28 23:22:48 +05:00
}
else
{
static Timer t("MeshSurface: Find edges and points - Parameter"); RegionTimer r(t);
int cntp = 0;
2019-08-08 03:17:53 +05:00
/*
2019-07-28 23:22:48 +05:00
for (int i = 1; i <= mesh.GetNSeg(); i++)
if (mesh.LineSegment(i).si == k)
cntp+=2;
2019-08-08 03:17:53 +05:00
*/
for (Segment & seg : mesh.LineSegments())
if (seg.si == k)
cntp += 2;
2019-08-08 03:17:53 +05:00
NgArray<PointGeomInfo> gis;
gis.SetAllocSize (cntp);
gis.SetSize (0);
2019-07-28 23:22:48 +05:00
for (int i = 1; i <= mesh.GetNSeg(); i++)
{
Segment & seg = mesh.LineSegment(i);
if (seg.si == k)
{
2019-07-28 23:22:48 +05:00
PointGeomInfo gi0, gi1;
gi0.trignum = gi1.trignum = k;
gi0.u = seg.epgeominfo[0].u;
gi0.v = seg.epgeominfo[0].v;
gi1.u = seg.epgeominfo[1].u;
gi1.v = seg.epgeominfo[1].v;
int locpnum[2] = {0, 0};
for (int j = 0; j < 2; j++)
{
PointGeomInfo gi = (j == 0) ? gi0 : gi1;
2019-08-08 03:17:53 +05:00
/*
2019-07-28 23:22:48 +05:00
int l;
for (l = 0; l < gis.Size() && locpnum[j] == 0; l++)
{
double dist = sqr (gis[l].u-gi.u)+sqr(gis[l].v-gi.v);
if (dist < 1e-10)
locpnum[j] = l+1;
}
if (locpnum[j] == 0)
{
2019-08-08 03:17:53 +05:00
PointIndex pi = seg[j];
2019-07-28 23:22:48 +05:00
meshing.AddPoint (mesh.Point(pi), pi);
gis.SetSize (gis.Size()+1);
gis[l] = gi;
locpnum[j] = l+1;
}
2019-08-08 03:17:53 +05:00
*/
for (int l = 0; l < gis.Size(); l++)
{
double dist = sqr (gis[l].u-gi.u)+sqr(gis[l].v-gi.v);
if (dist < 1e-10)
{
locpnum[j] = l+1;
break;
}
}
if (locpnum[j] == 0)
{
PointIndex pi = seg[j];
meshing.AddPoint (mesh.Point(pi), pi);
gis.Append (gi);
locpnum[j] = gis.Size();
}
2019-07-28 23:22:48 +05:00
}
meshing.AddBoundaryElement (locpnum[0], locpnum[1], gi0, gi1);
}
}
}
2019-07-28 23:22:48 +05:00
// Philippose - 15/01/2009
double maxh = geom.face_maxh[k-1];
//double maxh = mparam.maxh;
mparam.checkoverlap = 0;
// int noldpoints = mesh->GetNP();
int noldsurfel = mesh.GetNSE();
2019-07-29 02:22:47 +05:00
static Timer tsurfprop("surfprop");
tsurfprop.Start();
2019-07-28 23:22:48 +05:00
GProp_GProps sprops;
BRepGProp::SurfaceProperties(TopoDS::Face(geom.fmap(k)),sprops);
2019-07-29 02:22:47 +05:00
tsurfprop.Stop();
2019-07-28 23:22:48 +05:00
meshing.SetMaxArea(2.*sprops.Mass());
2019-07-28 23:22:48 +05:00
MESHING2_RESULT res;
2019-07-28 23:22:48 +05:00
try {
static Timer t("GenerateMesh"); RegionTimer reg(t);
res = meshing.GenerateMesh (mesh, mparam, maxh, k);
}
2019-07-28 23:22:48 +05:00
catch (SingularMatrixException)
{
(*myerr) << "Singular Matrix" << endl;
res = MESHING2_GIVEUP;
2019-07-28 23:22:48 +05:00
}
2019-07-28 23:22:48 +05:00
catch (UVBoundsException)
{
(*myerr) << "UV bounds exceeded" << endl;
res = MESHING2_GIVEUP;
2019-07-28 23:22:48 +05:00
}
2019-07-28 23:22:48 +05:00
projecttype = PARAMETERSPACE;
static Timer t1("rest of loop"); RegionTimer reg1(t1);
if (res != MESHING2_OK)
{
if (notrys == 1)
2019-07-28 23:22:48 +05:00
{
for (SurfaceElementIndex sei = noldsurfel; sei < mesh.GetNSE(); sei++)
mesh.Delete(sei);
2019-07-28 23:22:48 +05:00
mesh.Compress();
2019-07-28 23:22:48 +05:00
cout << "retry Surface " << k << endl;
2019-07-28 23:22:48 +05:00
k--;
projecttype*=-1;
notrys++;
continue;
}
else
2019-07-28 23:22:48 +05:00
{
geom.facemeshstatus[k-1] = -1;
PrintError ("Problem in Surface mesh generation");
surfmesherror++;
// throw NgException ("Problem in Surface mesh generation");
}
}
else
{
geom.facemeshstatus[k-1] = 1;
2019-07-28 23:22:48 +05:00
}
2019-07-28 23:22:48 +05:00
notrys = 1;
2019-08-09 03:23:12 +05:00
for (SurfaceElementIndex sei = oldnf; sei < mesh.GetNSE(); sei++)
mesh[sei].SetIndex (k);
auto n_illegal_trigs = mesh.FindIllegalTrigs();
PrintMessage (3, n_illegal_trigs, " illegal triangles");
}
2019-07-28 23:22:48 +05:00
// ofstream problemfile("occmesh.rep");
2019-07-28 23:22:48 +05:00
// problemfile << "SURFACEMESHING" << endl << endl;
2019-07-28 23:22:48 +05:00
if (surfmesherror)
{
2019-07-28 23:22:48 +05:00
cout << "WARNING! NOT ALL FACES HAVE BEEN MESHED" << endl;
cout << "SURFACE MESHING ERROR OCCURRED IN " << surfmesherror << " FACES:" << endl;
for (int i = 1; i <= geom.fmap.Extent(); i++)
if (geom.facemeshstatus[i-1] == -1)
{
2019-07-28 23:22:48 +05:00
cout << "Face " << i << endl;
// problemfile << "problem with face " << i << endl;
// problemfile << "vertices: " << endl;
TopExp_Explorer exp0,exp1,exp2;
for ( exp0.Init(TopoDS::Face (geom.fmap(i)), TopAbs_WIRE); exp0.More(); exp0.Next() )
{
TopoDS_Wire wire = TopoDS::Wire(exp0.Current());
for ( exp1.Init(wire,TopAbs_EDGE); exp1.More(); exp1.Next() )
2019-07-28 23:22:48 +05:00
{
TopoDS_Edge edge = TopoDS::Edge(exp1.Current());
for ( exp2.Init(edge,TopAbs_VERTEX); exp2.More(); exp2.Next() )
{
TopoDS_Vertex vertex = TopoDS::Vertex(exp2.Current());
gp_Pnt point = BRep_Tool::Pnt(vertex);
// problemfile << point.X() << " " << point.Y() << " " << point.Z() << endl;
}
}
}
// problemfile << endl;
}
2019-07-28 23:22:48 +05:00
cout << endl << endl;
cout << "for more information open IGES/STEP Topology Explorer" << endl;
// problemfile.close();
throw NgException ("Problem in Surface mesh generation");
}
2019-07-28 23:22:48 +05:00
else
{
2019-07-28 23:22:48 +05:00
// problemfile << "OK" << endl << endl;
// problemfile.close();
}
for (int i = 0; i < mesh.GetNFD(); i++)
mesh.SetBCName (i, mesh.GetFaceDescriptor(i+1).GetBCName());
multithread.task = savetask;
}
void OCCOptimizeSurface(OCCGeometry & geom, Mesh & mesh,
MeshingParameters & mparam)
{
const char * savetask = multithread.task;
2019-07-28 23:22:48 +05:00
multithread.task = "Optimizing surface";
2019-07-28 23:22:48 +05:00
static Timer timer_opt2d("Optimization 2D");
timer_opt2d.Start();
2019-07-28 23:22:48 +05:00
for (int k = 1; k <= mesh.GetNFD(); k++)
{
2019-07-28 23:22:48 +05:00
// if (k != 42) continue;
// if (k != 36) continue;
2019-07-28 23:22:48 +05:00
// (*testout) << "optimize face " << k << endl;
multithread.percent = 100 * k / (mesh.GetNFD() + VSMALL);
2019-07-28 23:22:48 +05:00
FaceDescriptor & fd = mesh.GetFaceDescriptor(k);
2019-07-28 23:22:48 +05:00
PrintMessage (1, "Optimize Surface ", k);
for (int i = 1; i <= mparam.optsteps2d; i++)
{
// (*testout) << "optstep " << i << endl;
if (multithread.terminate) return;
{
2019-07-28 23:22:48 +05:00
MeshOptimize2dOCCSurfaces meshopt(geom);
meshopt.SetFaceIndex (k);
meshopt.SetImproveEdges (0);
meshopt.SetMetricWeight (mparam.elsizeweight);
meshopt.SetWriteStatus (0);
meshopt.EdgeSwapping (mesh, (i > mparam.optsteps2d/2));
}
if (multithread.terminate) return;
{
2019-07-28 23:22:48 +05:00
MeshOptimize2dOCCSurfaces meshopt(geom);
meshopt.SetFaceIndex (k);
meshopt.SetImproveEdges (0);
meshopt.SetMetricWeight (mparam.elsizeweight);
meshopt.SetWriteStatus (0);
meshopt.ImproveMesh (mesh, mparam);
}
{
2019-07-28 23:22:48 +05:00
MeshOptimize2dOCCSurfaces meshopt(geom);
meshopt.SetFaceIndex (k);
meshopt.SetImproveEdges (0);
meshopt.SetMetricWeight (mparam.elsizeweight);
meshopt.SetWriteStatus (0);
meshopt.CombineImprove (mesh);
}
if (multithread.terminate) return;
{
2019-07-28 23:22:48 +05:00
MeshOptimize2dOCCSurfaces meshopt(geom);
meshopt.SetFaceIndex (k);
meshopt.SetImproveEdges (0);
meshopt.SetMetricWeight (mparam.elsizeweight);
meshopt.SetWriteStatus (0);
meshopt.ImproveMesh (mesh, mparam);
}
2019-07-28 23:22:48 +05:00
}
}
2019-07-28 23:22:48 +05:00
mesh.CalcSurfacesOfNode();
mesh.Compress();
timer_opt2d.Stop();
2019-07-28 23:22:48 +05:00
multithread.task = savetask;
}
2019-07-27 22:05:43 +05:00
void OCCSetLocalMeshSize(OCCGeometry & geom, Mesh & mesh,
const MeshingParameters & mparam, const OCCParameters& occparam)
2019-07-28 23:22:48 +05:00
{
static Timer t1("OCCSetLocalMeshSize");
RegionTimer regt(t1);
2019-07-28 23:22:48 +05:00
mesh.SetGlobalH (mparam.maxh);
mesh.SetMinimalH (mparam.minh);
2019-07-28 23:22:48 +05:00
NgArray<double> maxhdom;
maxhdom.SetSize (geom.NrSolids());
maxhdom = mparam.maxh;
2019-07-28 23:22:48 +05:00
mesh.SetMaxHDomain (maxhdom);
2019-07-28 23:22:48 +05:00
Box<3> bb = geom.GetBoundingBox();
bb.Increase (bb.Diam()/10);
2019-07-28 23:22:48 +05:00
mesh.SetLocalH (bb.PMin(), bb.PMax(), 0.5);
2019-07-28 23:22:48 +05:00
if (mparam.uselocalh)
{
2019-07-28 23:22:48 +05:00
const char * savetask = multithread.task;
multithread.percent = 0;
2019-07-28 23:22:48 +05:00
mesh.SetLocalH (bb.PMin(), bb.PMax(), mparam.grading);
2019-07-28 23:22:48 +05:00
int nedges = geom.emap.Extent();
2019-07-28 23:22:48 +05:00
double mincurvelength = IGNORECURVELENGTH;
double maxedgelen = 0;
double minedgelen = 1e99;
2019-07-28 23:22:48 +05:00
if(occparam.resthminedgelenenable)
{
mincurvelength = occparam.resthminedgelen;
if(mincurvelength < IGNORECURVELENGTH) mincurvelength = IGNORECURVELENGTH;
}
2019-07-28 23:22:48 +05:00
multithread.task = "Setting local mesh size (elements per edge)";
// Philippose - 23/01/2009
// Find all the parent faces of a given edge
// and limit the mesh size of the edge based on the
// mesh size limit of the face
TopTools_IndexedDataMapOfShapeListOfShape edge_face_map;
edge_face_map.Clear();
TopExp::MapShapesAndAncestors(geom.shape, TopAbs_EDGE, TopAbs_FACE, edge_face_map);
// setting elements per edge
2019-07-28 23:22:48 +05:00
for (int i = 1; i <= nedges && !multithread.terminate; i++)
{
TopoDS_Edge e = TopoDS::Edge (geom.emap(i));
multithread.percent = 100 * (i-1)/double(nedges);
if (BRep_Tool::Degenerated(e)) continue;
GProp_GProps system;
BRepGProp::LinearProperties(e, system);
double len = system.Mass();
if (len < mincurvelength)
2019-07-28 23:22:48 +05:00
{
(*testout) << "ignored" << endl;
continue;
}
double localh = len/mparam.segmentsperedge;
double s0, s1;
const TopTools_ListOfShape& parent_faces = edge_face_map.FindFromKey(e);
TopTools_ListIteratorOfListOfShape parent_face_list;
for(parent_face_list.Initialize(parent_faces); parent_face_list.More(); parent_face_list.Next())
2019-07-28 23:22:48 +05:00
{
TopoDS_Face parent_face = TopoDS::Face(parent_face_list.Value());
2019-07-28 23:22:48 +05:00
int face_index = geom.fmap.FindIndex(parent_face);
2019-07-28 23:22:48 +05:00
if(face_index >= 1) localh = min(localh,geom.face_maxh[face_index - 1]);
}
Handle(Geom_Curve) c = BRep_Tool::Curve(e, s0, s1);
maxedgelen = max (maxedgelen, len);
minedgelen = min (minedgelen, len);
int maxj = max((int) ceil(len/localh), 2);
for (int j = 0; j <= maxj; j++)
2019-07-28 23:22:48 +05:00
{
gp_Pnt pnt = c->Value (s0+double(j)/maxj*(s1-s0));
mesh.RestrictLocalH (Point3d(pnt.X(), pnt.Y(), pnt.Z()), localh);
}
}
2019-07-28 23:22:48 +05:00
multithread.task = "Setting local mesh size (edge curvature)";
2019-07-28 23:22:48 +05:00
// setting edge curvature
2019-07-28 23:22:48 +05:00
int nsections = 20;
2019-07-28 23:22:48 +05:00
for (int i = 1; i <= nedges && !multithread.terminate; i++)
{
double maxcur = 0;
multithread.percent = 100 * (i-1)/double(nedges);
TopoDS_Edge edge = TopoDS::Edge (geom.emap(i));
if (BRep_Tool::Degenerated(edge)) continue;
double s0, s1;
Handle(Geom_Curve) c = BRep_Tool::Curve(edge, s0, s1);
BRepAdaptor_Curve brepc(edge);
BRepLProp_CLProps prop(brepc, 2, 1e-5);
for (int j = 1; j <= nsections; j++)
2019-07-28 23:22:48 +05:00
{
double s = s0 + j/(double) nsections * (s1-s0);
prop.SetParameter (s);
double curvature = prop.Curvature();
if(curvature> maxcur) maxcur = curvature;
2019-07-28 23:22:48 +05:00
if (curvature >= 1e99)
continue;
2019-07-28 23:22:48 +05:00
gp_Pnt pnt = c->Value (s);
2019-07-28 23:22:48 +05:00
mesh.RestrictLocalH (Point3d(pnt.X(), pnt.Y(), pnt.Z()), ComputeH (fabs(curvature), mparam));
}
}
2019-07-28 23:22:48 +05:00
multithread.task = "Setting local mesh size (face curvature)";
2019-07-28 23:22:48 +05:00
// setting face curvature
2019-07-28 23:22:48 +05:00
int nfaces = geom.fmap.Extent();
2019-07-28 23:22:48 +05:00
for (int i = 1; i <= nfaces && !multithread.terminate; i++)
{
multithread.percent = 100 * (i-1)/double(nfaces);
TopoDS_Face face = TopoDS::Face(geom.fmap(i));
TopLoc_Location loc;
Handle(Geom_Surface) surf = BRep_Tool::Surface (face);
Handle(Poly_Triangulation) triangulation = BRep_Tool::Triangulation (face, loc);
if (triangulation.IsNull())
{
BRepTools::Clean (geom.shape);
BRepMesh_IncrementalMesh (geom.shape, 0.01, true);
triangulation = BRep_Tool::Triangulation (face, loc);
}
BRepAdaptor_Surface sf(face, Standard_True);
// one prop for evaluating and one for derivatives
BRepLProp_SLProps prop(sf, 0, 1e-5);
BRepLProp_SLProps prop2(sf, 2, 1e-5);
int ntriangles = triangulation -> NbTriangles();
for (int j = 1; j <= ntriangles; j++)
2019-07-28 23:22:48 +05:00
{
gp_Pnt p[3];
gp_Pnt2d par[3];
2019-07-28 23:22:48 +05:00
for (int k = 1; k <=3; k++)
{
int n = triangulation->Triangles()(j)(k);
p[k-1] = triangulation->Nodes()(n).Transformed(loc);
par[k-1] = triangulation->UVNodes()(n);
}
2019-07-28 23:22:48 +05:00
//double maxside = 0;
//maxside = max (maxside, p[0].Distance(p[1]));
//maxside = max (maxside, p[0].Distance(p[2]));
//maxside = max (maxside, p[1].Distance(p[2]));
//cout << "\rFace " << i << " pos11 ntriangles " << ntriangles << " maxside " << maxside << flush;
RestrictHTriangle (par[0], par[1], par[2], &prop, &prop2, mesh, 0, 0, mparam);
2019-07-28 23:22:48 +05:00
//cout << "\rFace " << i << " pos12 ntriangles " << ntriangles << flush;
}
}
// setting close edges
if (occparam.resthcloseedgeenable)
{
multithread.task = "Setting local mesh size (close edges)";
int sections = 100;
2019-07-09 13:39:16 +05:00
NgArray<Line> lines(sections*nedges);
2019-08-08 03:17:53 +05:00
/*
BoxTree<3> * searchtree =
new BoxTree<3> (bb.PMin(), bb.PMax());
2019-08-08 03:17:53 +05:00
*/
BoxTree<3> searchtree(bb.PMin(), bb.PMax());
int nlines = 0;
for (int i = 1; i <= nedges && !multithread.terminate; i++)
2019-07-28 23:22:48 +05:00
{
TopoDS_Edge edge = TopoDS::Edge (geom.emap(i));
if (BRep_Tool::Degenerated(edge)) continue;
double s0, s1;
Handle(Geom_Curve) c = BRep_Tool::Curve(edge, s0, s1);
BRepAdaptor_Curve brepc(edge);
BRepLProp_CLProps prop(brepc, 1, 1e-5);
prop.SetParameter (s0);
gp_Vec d0 = prop.D1().Normalized();
double s_start = s0;
int count = 0;
for (int j = 1; j <= sections; j++)
{
2019-07-28 23:22:48 +05:00
double s = s0 + (s1-s0)*(double)j/(double)sections;
prop.SetParameter (s);
gp_Vec d1 = prop.D1().Normalized();
double cosalpha = fabs(d0*d1);
if ((j == sections) || (cosalpha < cos(10.0/180.0*M_PI)))
{
count++;
gp_Pnt p0 = c->Value (s_start);
gp_Pnt p1 = c->Value (s);
lines[nlines].p0 = Point<3> (p0.X(), p0.Y(), p0.Z());
lines[nlines].p1 = Point<3> (p1.X(), p1.Y(), p1.Z());
Box3d box;
box.SetPoint (Point3d(lines[nlines].p0));
box.AddPoint (Point3d(lines[nlines].p1));
2019-08-08 03:17:53 +05:00
searchtree.Insert (box.PMin(), box.PMax(), nlines+1);
2019-07-28 23:22:48 +05:00
nlines++;
s_start = s;
d0 = d1;
}
}
}
2019-07-28 23:22:48 +05:00
NgArray<int> linenums;
2019-07-28 23:22:48 +05:00
for (int i = 0; i < nlines; i++)
{
multithread.percent = (100*i)/double(nlines);
Line & line = lines[i];
2019-07-28 23:22:48 +05:00
Box3d box;
box.SetPoint (Point3d(line.p0));
box.AddPoint (Point3d(line.p1));
double maxhline = max (mesh.GetH(box.PMin()),
mesh.GetH(box.PMax()));
box.Increase(maxhline);
double mindist = 1e99;
linenums.SetSize(0);
2019-08-08 03:17:53 +05:00
searchtree.GetIntersecting(box.PMin(),box.PMax(),linenums);
2019-07-28 23:22:48 +05:00
for (int j = 0; j < linenums.Size(); j++)
{
int num = linenums[j]-1;
if (i == num) continue;
if ((line.p0-lines[num].p0).Length2() < 1e-15) continue;
if ((line.p0-lines[num].p1).Length2() < 1e-15) continue;
if ((line.p1-lines[num].p0).Length2() < 1e-15) continue;
if ((line.p1-lines[num].p1).Length2() < 1e-15) continue;
mindist = min (mindist, line.Dist(lines[num]));
}
2019-07-28 23:22:48 +05:00
mindist /= (occparam.resthcloseedgefac + VSMALL);
if (mindist < 1e-3 * bb.Diam())
2019-07-28 23:22:48 +05:00
{
(*testout) << "extremely small local h: " << mindist
<< " --> setting to " << 1e-3 * bb.Diam() << endl;
2019-07-28 23:22:48 +05:00
(*testout) << "somewhere near " << line.p0 << " - " << line.p1 << endl;
mindist = 1e-3 * bb.Diam();
2019-07-28 23:22:48 +05:00
}
2019-07-28 23:22:48 +05:00
mesh.RestrictLocalHLine(line.p0, line.p1, mindist);
}
}
2019-08-28 12:52:51 +05:00
for (auto mspnt : mparam.meshsize_points)
mesh.RestrictLocalH(mspnt.pnt, mspnt.h);
2019-07-28 23:22:48 +05:00
multithread.task = savetask;
}
2019-07-28 23:22:48 +05:00
mesh.LoadLocalMeshSize (mparam.meshsizefilename);
}
int OCCGenerateMesh (OCCGeometry & geom, shared_ptr<Mesh> & mesh, MeshingParameters & mparam,
const OCCParameters& occparam)
2019-07-28 23:22:48 +05:00
{
multithread.percent = 0;
2019-07-28 23:22:48 +05:00
if (mparam.perfstepsstart <= MESHCONST_ANALYSE)
{
2019-07-28 23:22:48 +05:00
if(mesh.get() == nullptr)
mesh = make_shared<Mesh>();
mesh->geomtype = Mesh::GEOM_OCC;
2015-01-20 22:41:16 +05:00
OCCSetLocalMeshSize(geom,*mesh, mparam, occparam);
}
2019-07-28 23:22:48 +05:00
if (multithread.terminate || mparam.perfstepsend <= MESHCONST_ANALYSE)
return TCL_OK;
2019-07-28 23:22:48 +05:00
if (mparam.perfstepsstart <= MESHCONST_MESHEDGES)
{
2019-07-27 22:05:43 +05:00
OCCFindEdges (geom, *mesh, mparam);
2019-07-28 23:22:48 +05:00
/*
cout << "Removing redundant points" << endl;
int i, j;
int np = mesh->GetNP();
NgArray<int> equalto;
equalto.SetSize (np);
equalto = 0;
for (i = 1; i <= np; i++)
{
for (j = i+1; j <= np; j++)
{
if (!equalto[j-1] && (Dist2 (mesh->Point(i), mesh->Point(j)) < 1e-12))
equalto[j-1] = i;
}
}
for (i = 1; i <= np; i++)
if (equalto[i-1])
{
cout << "Point " << i << " is equal to Point " << equalto[i-1] << endl;
for (j = 1; j <= mesh->GetNSeg(); j++)
{
Segment & seg = mesh->LineSegment(j);
if (seg[0] == i) seg[0] = equalto[i-1];
if (seg[1] == i) seg[1] = equalto[i-1];
}
}
cout << "Removing degenerated segments" << endl;
for (j = 1; j <= mesh->GetNSeg(); j++)
{
Segment & seg = mesh->LineSegment(j);
if (seg[0] == seg[1])
{
mesh->DeleteSegment(j);
cout << "Deleting Segment " << j << endl;
}
}
mesh->Compress();
*/
/*
for (int i = 1; i <= geom.fmap.Extent(); i++)
{
Handle(Geom_Surface) hf1 =
BRep_Tool::Surface(TopoDS::Face(geom.fmap(i)));
for (int j = i+1; j <= geom.fmap.Extent(); j++)
{
Handle(Geom_Surface) hf2 =
BRep_Tool::Surface(TopoDS::Face(geom.fmap(j)));
if (hf1 == hf2) cout << "face " << i << " and face " << j << " lie on same surface" << endl;
}
}
*/
#ifdef LOG_STREAM
2019-07-28 23:22:48 +05:00
(*logout) << "Edges meshed" << endl
<< "time = " << GetTime() << " sec" << endl
<< "points: " << mesh->GetNP() << endl;
#endif
}
2019-07-28 23:22:48 +05:00
if (multithread.terminate || mparam.perfstepsend <= MESHCONST_MESHEDGES)
return TCL_OK;
2019-07-28 23:22:48 +05:00
if (mparam.perfstepsstart <= MESHCONST_MESHSURFACE)
{
OCCMeshSurface (geom, *mesh, mparam);
2019-07-28 23:22:48 +05:00
if (multithread.terminate) return TCL_OK;
#ifdef LOG_STREAM
2019-07-28 23:22:48 +05:00
(*logout) << "Surfaces meshed" << endl
<< "time = " << GetTime() << " sec" << endl
<< "points: " << mesh->GetNP() << endl;
#endif
#ifdef STAT_STREAM
2019-07-28 23:22:48 +05:00
(*statout) << mesh->GetNSeg() << " & "
<< mesh->GetNSE() << " & - &"
<< GetTime() << " & " << endl;
#endif
2019-07-28 23:22:48 +05:00
// MeshQuality2d (*mesh);
mesh->CalcSurfacesOfNode();
}
if (multithread.terminate || mparam.perfstepsend <= MESHCONST_MESHSURFACE)
return TCL_OK;
if (mparam.perfstepsstart <= MESHCONST_OPTSURFACE)
{
OCCOptimizeSurface(geom, *mesh, mparam);
}
2019-07-28 23:22:48 +05:00
if (multithread.terminate || mparam.perfstepsend <= MESHCONST_OPTSURFACE)
return TCL_OK;
2019-07-28 23:22:48 +05:00
if (mparam.perfstepsstart <= MESHCONST_MESHVOLUME)
{
2019-07-28 23:22:48 +05:00
multithread.task = "Volume meshing";
2019-07-28 23:22:48 +05:00
MESHING3_RESULT res = MeshVolume (mparam, *mesh);
2019-07-28 23:22:48 +05:00
if (res != MESHING3_OK) return TCL_ERROR;
if (multithread.terminate) return TCL_OK;
2019-07-28 23:22:48 +05:00
RemoveIllegalElements (*mesh);
if (multithread.terminate) return TCL_OK;
2019-07-28 23:22:48 +05:00
MeshQuality3d (*mesh);
#ifdef STAT_STREAM
2019-07-28 23:22:48 +05:00
(*statout) << GetTime() << " & ";
#endif
#ifdef LOG_STREAM
2019-07-28 23:22:48 +05:00
(*logout) << "Volume meshed" << endl
<< "time = " << GetTime() << " sec" << endl
<< "points: " << mesh->GetNP() << endl;
#endif
}
2019-07-28 23:22:48 +05:00
if (multithread.terminate || mparam.perfstepsend <= MESHCONST_MESHVOLUME)
return TCL_OK;
2019-07-28 23:22:48 +05:00
if (mparam.perfstepsstart <= MESHCONST_OPTVOLUME)
{
2019-07-28 23:22:48 +05:00
multithread.task = "Volume optimization";
2019-07-28 23:22:48 +05:00
OptimizeVolume (mparam, *mesh);
if (multithread.terminate) return TCL_OK;
#ifdef STAT_STREAM
2019-07-28 23:22:48 +05:00
(*statout) << GetTime() << " & "
<< mesh->GetNE() << " & "
<< mesh->GetNP() << " " << '\\' << '\\' << " \\" << "hline" << endl;
#endif
#ifdef LOG_STREAM
2019-07-28 23:22:48 +05:00
(*logout) << "Volume optimized" << endl
<< "time = " << GetTime() << " sec" << endl
<< "points: " << mesh->GetNP() << endl;
#endif
2019-07-28 23:22:48 +05:00
// cout << "Optimization complete" << endl;
}
2019-08-08 03:17:53 +05:00
/*
2019-07-28 23:22:48 +05:00
(*testout) << "NP: " << mesh->GetNP() << endl;
for (int i = 1; i <= mesh->GetNP(); i++)
(*testout) << mesh->Point(i) << endl;
2019-07-28 23:22:48 +05:00
(*testout) << endl << "NSegments: " << mesh->GetNSeg() << endl;
for (int i = 1; i <= mesh->GetNSeg(); i++)
(*testout) << mesh->LineSegment(i) << endl;
2019-08-08 03:17:53 +05:00
*/
2019-07-28 23:22:48 +05:00
for (int i = 0; i < mesh->GetNDomains(); i++)
2019-08-08 03:17:53 +05:00
if (geom.snames.Size())
mesh->SetMaterial (i+1, geom.snames[i]);
2019-07-28 23:22:48 +05:00
return TCL_OK;
}
}
#endif