ForkMaster/netgen
1
0
Fork 0
mirror of https://github.com/NGSolve/netgen.git synced 2024-11-14 10:08:32 +05:00
Code Issues Packages Projects Releases Wiki Activity

occ - use search tree to identify points in parameter space

Browse Source
This commit is contained in:
mhochsteger@cerbsim.com 2021-12-01 11:36:28 +01:00
parent 92ade9d800
commit 8334d20c3a
1 changed files with 32 additions and 69 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

83
libsrc/occ/occgenmesh.cpp
View File

@ -325,84 +325,47 @@ namespace netgen
{ {
static Timer t("MeshSurface: Find edges and points - Parameter"); RegionTimer r(t); static Timer t("MeshSurface: Find edges and points - Parameter"); RegionTimer r(t);
int cntp = 0; Array<PointGeomInfo> gis(2*segments.Size());
/*
for (int i = 1; i <= mesh.GetNSeg(); i++)
if (mesh.LineSegment(i).si == k)
cntp+=2;
*/
cntp = 2*segments.Size();
//for (Segment & seg : mesh.LineSegments())
//if (seg.si == k)
//cntp += 2;
NgArray<PointGeomInfo> gis;
gis.SetAllocSize (cntp);
gis.SetSize (0); gis.SetSize (0);
//for (int i = 1; i <= mesh.GetNSeg(); i++) Box<2> uv_box(Box<2>::EMPTY_BOX);
for(auto & seg : segments)
for(auto i : Range(2))
uv_box.Add( {seg.epgeominfo[i].u, seg.epgeominfo[i].v } );
BoxTree<2> uv_tree(uv_box);
Array<int> found_points;
for(auto & seg : segments) for(auto & seg : segments)
{ {
//Segment & seg = mesh.LineSegment(i); PointGeomInfo gi[2];
//if (seg.si == k) gi[0].trignum = gi[1].trignum = k;
{ gi[0].u = seg.epgeominfo[0].u;
PointGeomInfo gi0, gi1; gi[0].v = seg.epgeominfo[0].v;
gi0.trignum = gi1.trignum = k; gi[1].u = seg.epgeominfo[1].u;
gi0.u = seg.epgeominfo[0].u; gi[1].v = seg.epgeominfo[1].v;
gi0.v = seg.epgeominfo[0].v;
gi1.u = seg.epgeominfo[1].u;
gi1.v = seg.epgeominfo[1].v;
int locpnum[2] = {0, 0}; int locpnum[2] = {0, 0};
for (int j = 0; j < 2; j++) for (int j = 0; j < 2; j++)
{ {
PointGeomInfo gi = (j == 0) ? gi0 : gi1; Point<2> uv = {gi[j].u, gi[j].v};
uv_tree.GetIntersecting(uv, uv, found_points);
/* if(found_points.Size())
int l; locpnum[j] = found_points[0];
for (l = 0; l < gis.Size() && locpnum[j] == 0; l++) else
{
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)
{ {
PointIndex pi = seg[j]; PointIndex pi = seg[j];
meshing.AddPoint (mesh.Point(pi), pi); meshing.AddPoint (mesh.Point(pi), pi);
gis.SetSize (gis.Size()+1); gis.Append (gi[j]);
gis[l] = gi;
locpnum[j] = l+1;
}
*/
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(); locpnum[j] = gis.Size();
uv_tree.Insert(uv, locpnum[j]);
} }
} }
meshing.AddBoundaryElement (locpnum[0], locpnum[1], gi0, gi1); meshing.AddBoundaryElement (locpnum[0], locpnum[1], gi[0], gi[1]);
}
} }
} }