mirror of
https://github.com/NGSolve/netgen.git
synced 2025-01-13 06:30:34 +05:00
Merge branch 'parallel_swapimprove' into 'master'
Parallel SwapImprove() See merge request jschoeberl/netgen!236
This commit is contained in:
Joachim Schöberl
commit
2c172e46ee
@ -411,13 +411,66 @@ void MeshOptimize3d :: CombineImproveSequential (Mesh & mesh,
|
|||||||
multithread.task = savetask;
|
multithread.task = savetask;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
void MeshOptimize3d :: BuildEdgeList( const Mesh & mesh, const TABLE<ElementIndex, PointIndex::BASE> & elementsonnode, Array<std::tuple<PointIndex, PointIndex>> & edges )
|
||||||
|
{
|
||||||
|
static Timer tbuild_edges("Build edges"); RegionTimer reg(tbuild_edges);
|
||||||
|
|
||||||
|
static constexpr int tetedges[6][2] =
|
||||||
|
{ { 0, 1 }, { 0, 2 }, { 0, 3 },
|
||||||
|
{ 1, 2 }, { 1, 3 }, { 2, 3 } };
|
||||||
|
|
||||||
|
int ntasks = 2*ngcore::TaskManager::GetMaxThreads();
|
||||||
|
Array<Array<std::tuple<PointIndex,PointIndex>>> task_edges(ntasks);
|
||||||
|
|
||||||
|
ParallelFor(IntRange(ntasks), [&] (int ti)
|
||||||
|
{
|
||||||
|
auto myrange = mesh.Points().Range().Split(ti, ntasks);
|
||||||
|
ArrayMem<std::tuple<PointIndex,PointIndex>, 100> local_edges;
|
||||||
|
for (auto pi : myrange)
|
||||||
|
{
|
||||||
|
local_edges.SetSize(0);
|
||||||
|
|
||||||
|
for(auto ei : elementsonnode[pi])
|
||||||
|
{
|
||||||
|
const Element & elem = mesh[ei];
|
||||||
|
if (elem.IsDeleted()) continue;
|
||||||
|
|
||||||
|
for (int j = 0; j < 6; j++)
|
||||||
|
{
|
||||||
|
PointIndex pi0 = elem[tetedges[j][0]];
|
||||||
|
PointIndex pi1 = elem[tetedges[j][1]];
|
||||||
|
if (pi1 < pi0) Swap(pi0, pi1);
|
||||||
|
if(pi0==pi)
|
||||||
|
local_edges.Append(std::make_tuple(pi0, pi1));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
QuickSort(local_edges);
|
||||||
|
|
||||||
|
auto edge_prev = std::make_tuple<PointIndex, PointIndex>(-1,-1);
|
||||||
|
|
||||||
|
for(auto edge : local_edges)
|
||||||
|
if(edge != edge_prev)
|
||||||
|
{
|
||||||
|
task_edges[ti].Append(edge);
|
||||||
|
edge_prev = edge;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}, ntasks);
|
||||||
|
|
||||||
|
int num_edges = 0;
|
||||||
|
for (auto & edg : task_edges)
|
||||||
|
num_edges += edg.Size();
|
||||||
|
edges.SetAllocSize(num_edges);
|
||||||
|
for (auto & edg : task_edges)
|
||||||
|
edges.Append(edg);
|
||||||
|
}
|
||||||
|
|
||||||
void MeshOptimize3d :: CombineImprove (Mesh & mesh,
|
void MeshOptimize3d :: CombineImprove (Mesh & mesh,
|
||||||
OPTIMIZEGOAL goal)
|
OPTIMIZEGOAL goal)
|
||||||
{
|
{
|
||||||
static Timer t("MeshOptimize3d::CombineImprove"); RegionTimer reg(t);
|
static Timer t("MeshOptimize3d::CombineImprove"); RegionTimer reg(t);
|
||||||
static Timer topt("Optimize");
|
static Timer topt("Optimize");
|
||||||
static Timer tsearch("Search");
|
static Timer tsearch("Search");
|
||||||
static Timer tbuild_edges("Build edges");
|
|
||||||
static Timer tbuild_elements_table("Build elements table");
|
static Timer tbuild_elements_table("Build elements table");
|
||||||
static Timer tbad("CalcBad");
|
static Timer tbad("CalcBad");
|
||||||
|
|
||||||
@ -474,58 +527,8 @@ void MeshOptimize3d :: CombineImprove (Mesh & mesh,
|
|||||||
|
|
||||||
tbuild_elements_table.Stop();
|
tbuild_elements_table.Stop();
|
||||||
|
|
||||||
// Build list of all edges
|
Array<std::tuple<PointIndex,PointIndex>> edges;
|
||||||
Array<std::tuple<int,int>> edges;
|
BuildEdgeList(mesh, elementsonnode, edges);
|
||||||
Array<Array<std::tuple<int,int>>> thread_edges(ngcore::TaskManager::GetMaxThreads());
|
|
||||||
|
|
||||||
static constexpr int tetedges[6][2] =
|
|
||||||
{ { 0, 1 }, { 0, 2 }, { 0, 3 },
|
|
||||||
{ 1, 2 }, { 1, 3 }, { 2, 3 } };
|
|
||||||
|
|
||||||
tbuild_edges.Start();
|
|
||||||
ParallelForRange(mesh.Points().Range(), [&] (auto myrange)
|
|
||||||
{
|
|
||||||
ArrayMem<std::tuple<int,int>, 100> local_edges;
|
|
||||||
for (auto pi : myrange)
|
|
||||||
{
|
|
||||||
local_edges.SetSize(0);
|
|
||||||
|
|
||||||
for(auto ei : elementsonnode[pi])
|
|
||||||
{
|
|
||||||
Element & elem = mesh[ei];
|
|
||||||
if (elem.IsDeleted()) continue;
|
|
||||||
|
|
||||||
for (int j = 0; j < 6; j++)
|
|
||||||
{
|
|
||||||
PointIndex pi0 = elem[tetedges[j][0]];
|
|
||||||
PointIndex pi1 = elem[tetedges[j][1]];
|
|
||||||
if (pi1 < pi0) Swap(pi0, pi1);
|
|
||||||
if(pi0==pi)
|
|
||||||
local_edges.Append(std::make_tuple(pi0, pi1));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
QuickSort(local_edges);
|
|
||||||
|
|
||||||
auto edge_prev = std::make_tuple(-1,-1);
|
|
||||||
|
|
||||||
for(auto edge : local_edges)
|
|
||||||
if(edge != edge_prev)
|
|
||||||
{
|
|
||||||
// TODO: Check for CombineEdge improvement already here and only append edges with improvement
|
|
||||||
thread_edges[ngcore::TaskManager::GetThreadId()].Append(edge);
|
|
||||||
edge_prev = edge;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}, ntasks);
|
|
||||||
|
|
||||||
int num_edges = 0;
|
|
||||||
for (auto & edg : thread_edges)
|
|
||||||
num_edges += edg.Size();
|
|
||||||
edges.SetAllocSize(num_edges);
|
|
||||||
for (auto & edg : thread_edges)
|
|
||||||
edges.Append(edg);
|
|
||||||
|
|
||||||
tbuild_edges.Stop();
|
|
||||||
|
|
||||||
// Find edges with improvement
|
// Find edges with improvement
|
||||||
Array<std::tuple<double, int>> combine_candidate_edges(edges.Size());
|
Array<std::tuple<double, int>> combine_candidate_edges(edges.Size());
|
||||||
@ -890,127 +893,29 @@ void MeshOptimize3d :: SplitImprove (Mesh & mesh,
|
|||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
bool MeshOptimize3d :: SwapImproveEdge (Mesh & mesh, OPTIMIZEGOAL goal,
|
||||||
|
const NgBitArray * working_elements,
|
||||||
void MeshOptimize3d :: SwapImprove (Mesh & mesh, OPTIMIZEGOAL goal,
|
TABLE<ElementIndex,PointIndex::BASE> & elementsonnode,
|
||||||
const NgBitArray * working_elements)
|
INDEX_3_HASHTABLE<int> & faces,
|
||||||
|
PointIndex pi1, PointIndex pi2, bool check_only
|
||||||
|
)
|
||||||
{
|
{
|
||||||
static Timer t("MeshOptimize3d::SwapImprove"); RegionTimer reg(t);
|
|
||||||
static Timer tloop("MeshOptimize3d::SwapImprove loop");
|
|
||||||
|
|
||||||
PointIndex pi3(PointIndex::INVALID), pi4(PointIndex::INVALID),
|
PointIndex pi3(PointIndex::INVALID), pi4(PointIndex::INVALID),
|
||||||
pi5(PointIndex::INVALID), pi6(PointIndex::INVALID);
|
pi5(PointIndex::INVALID), pi6(PointIndex::INVALID);
|
||||||
int cnt = 0;
|
|
||||||
|
double bad1, bad2, bad3;
|
||||||
|
|
||||||
Element el21(TET), el22(TET), el31(TET), el32(TET), el33(TET);
|
Element el21(TET), el22(TET), el31(TET), el32(TET), el33(TET);
|
||||||
Element el1(TET), el2(TET), el3(TET), el4(TET);
|
Element el1(TET), el2(TET), el3(TET), el4(TET);
|
||||||
Element el1b(TET), el2b(TET), el3b(TET), el4b(TET);
|
Element el1b(TET), el2b(TET), el3b(TET), el4b(TET);
|
||||||
|
ArrayMem<ElementIndex, 20> hasbothpoints;
|
||||||
|
|
||||||
double bad1, bad2, bad3;
|
bool do_swap = false;
|
||||||
|
|
||||||
int np = mesh.GetNP();
|
|
||||||
int ne = mesh.GetNE();
|
|
||||||
|
|
||||||
// contains at least all elements at node
|
|
||||||
TABLE<ElementIndex,PointIndex::BASE> elementsonnode(np);
|
|
||||||
|
|
||||||
NgArray<ElementIndex> hasbothpoints;
|
|
||||||
|
|
||||||
PrintMessage (3, "SwapImprove ");
|
|
||||||
(*testout) << "\n" << "Start SwapImprove" << endl;
|
|
||||||
|
|
||||||
const char * savetask = multithread.task;
|
|
||||||
multithread.task = "Swap Improve";
|
|
||||||
|
|
||||||
// mesh.CalcSurfacesOfNode ();
|
|
||||||
|
|
||||||
INDEX_3_HASHTABLE<int> faces(mesh.GetNOpenElements()/3 + 2);
|
|
||||||
if (goal == OPT_CONFORM)
|
|
||||||
{
|
|
||||||
for (int i = 1; i <= mesh.GetNOpenElements(); i++)
|
|
||||||
{
|
|
||||||
const Element2d & hel = mesh.OpenElement(i);
|
|
||||||
INDEX_3 face(hel[0], hel[1], hel[2]);
|
|
||||||
face.Sort();
|
|
||||||
faces.Set (face, 1);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Calculate total badness
|
|
||||||
if (goal == OPT_QUALITY)
|
|
||||||
{
|
|
||||||
bad1 = CalcTotalBad (mesh.Points(), mesh.VolumeElements());
|
|
||||||
(*testout) << "Total badness = " << bad1 << endl;
|
|
||||||
}
|
|
||||||
|
|
||||||
// find elements on node
|
|
||||||
for (ElementIndex ei = 0; ei < ne; ei++)
|
|
||||||
for (PointIndex pi : mesh[ei].PNums())
|
|
||||||
elementsonnode.Add (pi, ei);
|
|
||||||
/*
|
|
||||||
for (int j = 0; j < mesh[ei].GetNP(); j++)
|
|
||||||
elementsonnode.Add (mesh[ei][j], ei);
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
// INDEX_2_HASHTABLE<int> edgeused(2 * ne + 5);
|
|
||||||
INDEX_2_CLOSED_HASHTABLE<int> edgeused(12 * ne + 5);
|
|
||||||
|
|
||||||
tloop.Start();
|
|
||||||
for (ElementIndex ei = 0; ei < ne; ei++)
|
|
||||||
{
|
|
||||||
if (multithread.terminate)
|
|
||||||
break;
|
|
||||||
|
|
||||||
if (mp.only3D_domain_nr && mp.only3D_domain_nr != mesh.VolumeElement(ei).GetIndex())
|
|
||||||
continue;
|
|
||||||
|
|
||||||
multithread.percent = 100.0 * (ei+1) / ne;
|
|
||||||
|
|
||||||
if ((mesh.ElementType(ei)) == FIXEDELEMENT)
|
|
||||||
continue;
|
|
||||||
|
|
||||||
if(working_elements &&
|
|
||||||
ei < working_elements->Size() &&
|
|
||||||
!working_elements->Test(ei))
|
|
||||||
continue;
|
|
||||||
|
|
||||||
if (mesh[ei].IsDeleted())
|
|
||||||
continue;
|
|
||||||
|
|
||||||
if ((goal == OPT_LEGAL) &&
|
|
||||||
mesh.LegalTet (mesh[ei]) &&
|
|
||||||
CalcBad (mesh.Points(), mesh[ei], 0) < 1e3)
|
|
||||||
continue;
|
|
||||||
|
|
||||||
// int onlybedges = 1;
|
|
||||||
|
|
||||||
for (int j = 0; j < 6; j++)
|
|
||||||
{
|
|
||||||
// loop over edges
|
|
||||||
|
|
||||||
const Element & elemi = mesh[ei];
|
|
||||||
if (elemi.IsDeleted()) continue;
|
|
||||||
|
|
||||||
int mattyp = elemi.GetIndex();
|
|
||||||
|
|
||||||
static const int tetedges[6][2] =
|
|
||||||
{ { 0, 1 }, { 0, 2 }, { 0, 3 },
|
|
||||||
{ 1, 2 }, { 1, 3 }, { 2, 3 } };
|
|
||||||
|
|
||||||
PointIndex pi1 = elemi[tetedges[j][0]];
|
|
||||||
PointIndex pi2 = elemi[tetedges[j][1]];
|
|
||||||
|
|
||||||
if (pi2 < pi1) Swap (pi1, pi2);
|
if (pi2 < pi1) Swap (pi1, pi2);
|
||||||
|
|
||||||
if (mesh.BoundaryEdge (pi1, pi2)) continue;
|
if (mesh.BoundaryEdge (pi1, pi2)) return false;
|
||||||
|
|
||||||
|
|
||||||
INDEX_2 i2 (pi1, pi2);
|
|
||||||
i2.Sort();
|
|
||||||
if (edgeused.Used(i2)) continue;
|
|
||||||
edgeused.Set (i2, 1);
|
|
||||||
|
|
||||||
hasbothpoints.SetSize (0);
|
hasbothpoints.SetSize (0);
|
||||||
for (int k = 0; k < elementsonnode[pi1].Size(); k++)
|
for (int k = 0; k < elementsonnode[pi1].Size(); k++)
|
||||||
{
|
{
|
||||||
@ -1018,7 +923,7 @@ void MeshOptimize3d :: SwapImprove (Mesh & mesh, OPTIMIZEGOAL goal,
|
|||||||
ElementIndex elnr = elementsonnode[pi1][k];
|
ElementIndex elnr = elementsonnode[pi1][k];
|
||||||
const Element & elem = mesh[elnr];
|
const Element & elem = mesh[elnr];
|
||||||
|
|
||||||
if (elem.IsDeleted()) continue;
|
if (elem.IsDeleted()) return false;
|
||||||
|
|
||||||
for (int l = 0; l < elem.GetNP(); l++)
|
for (int l = 0; l < elem.GetNP(); l++)
|
||||||
{
|
{
|
||||||
@ -1038,14 +943,34 @@ void MeshOptimize3d :: SwapImprove (Mesh & mesh, OPTIMIZEGOAL goal,
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
bool puretet = true;
|
|
||||||
for (ElementIndex ei : hasbothpoints)
|
for (ElementIndex ei : hasbothpoints)
|
||||||
|
{
|
||||||
if (mesh[ei].GetType () != TET)
|
if (mesh[ei].GetType () != TET)
|
||||||
puretet = false;
|
return false;
|
||||||
|
|
||||||
if (!puretet) continue;
|
if (mp.only3D_domain_nr && mp.only3D_domain_nr != mesh.VolumeElement(ei).GetIndex())
|
||||||
|
return false;
|
||||||
|
|
||||||
|
|
||||||
|
if ((mesh.ElementType(ei)) == FIXEDELEMENT)
|
||||||
|
return false;
|
||||||
|
|
||||||
|
if(working_elements &&
|
||||||
|
ei < working_elements->Size() &&
|
||||||
|
!working_elements->Test(ei))
|
||||||
|
return false;
|
||||||
|
|
||||||
|
if (mesh[ei].IsDeleted())
|
||||||
|
return false;
|
||||||
|
|
||||||
|
if ((goal == OPT_LEGAL) &&
|
||||||
|
mesh.LegalTet (mesh[ei]) &&
|
||||||
|
CalcBad (mesh.Points(), mesh[ei], 0) < 1e3)
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
int nsuround = hasbothpoints.Size();
|
int nsuround = hasbothpoints.Size();
|
||||||
|
int mattyp = mesh[hasbothpoints[0]].GetIndex();
|
||||||
|
|
||||||
if ( nsuround == 3 )
|
if ( nsuround == 3 )
|
||||||
{
|
{
|
||||||
@ -1102,9 +1027,6 @@ void MeshOptimize3d :: SwapImprove (Mesh & mesh, OPTIMIZEGOAL goal,
|
|||||||
el33[3] = pi3;
|
el33[3] = pi3;
|
||||||
el33.SetIndex (mattyp);
|
el33.SetIndex (mattyp);
|
||||||
|
|
||||||
elementsonnode.Add (pi4, hasbothpoints[1]);
|
|
||||||
elementsonnode.Add (pi3, hasbothpoints[2]);
|
|
||||||
|
|
||||||
bad1 = CalcBad (mesh.Points(), el31, 0) +
|
bad1 = CalcBad (mesh.Points(), el31, 0) +
|
||||||
CalcBad (mesh.Points(), el32, 0) +
|
CalcBad (mesh.Points(), el32, 0) +
|
||||||
CalcBad (mesh.Points(), el33, 0);
|
CalcBad (mesh.Points(), el33, 0);
|
||||||
@ -1174,7 +1096,8 @@ void MeshOptimize3d :: SwapImprove (Mesh & mesh, OPTIMIZEGOAL goal,
|
|||||||
{
|
{
|
||||||
// (*mycout) << "3->2 " << flush;
|
// (*mycout) << "3->2 " << flush;
|
||||||
// (*testout) << "3->2 conversion" << endl;
|
// (*testout) << "3->2 conversion" << endl;
|
||||||
cnt++;
|
do_swap = true;
|
||||||
|
if(check_only) return do_swap;
|
||||||
|
|
||||||
|
|
||||||
/*
|
/*
|
||||||
@ -1195,6 +1118,9 @@ void MeshOptimize3d :: SwapImprove (Mesh & mesh, OPTIMIZEGOAL goal,
|
|||||||
mesh[hasbothpoints[2]][l].Invalidate();
|
mesh[hasbothpoints[2]][l].Invalidate();
|
||||||
mesh[hasbothpoints[2]].Delete();
|
mesh[hasbothpoints[2]].Delete();
|
||||||
|
|
||||||
|
elementsonnode.Add (pi4, hasbothpoints[1]);
|
||||||
|
elementsonnode.Add (pi3, hasbothpoints[2]);
|
||||||
|
|
||||||
for (int k = 0; k < 2; k++)
|
for (int k = 0; k < 2; k++)
|
||||||
for (int l = 0; l < 4; l++)
|
for (int l = 0; l < 4; l++)
|
||||||
elementsonnode.Add (mesh[hasbothpoints[k]][l], hasbothpoints[k]);
|
elementsonnode.Add (mesh[hasbothpoints[k]][l], hasbothpoints[k]);
|
||||||
@ -1402,7 +1328,8 @@ void MeshOptimize3d :: SwapImprove (Mesh & mesh, OPTIMIZEGOAL goal,
|
|||||||
if (swap2 || swap3)
|
if (swap2 || swap3)
|
||||||
{
|
{
|
||||||
// (*mycout) << "4->4 " << flush;
|
// (*mycout) << "4->4 " << flush;
|
||||||
cnt++;
|
do_swap = true;
|
||||||
|
if(check_only) return do_swap;
|
||||||
// (*testout) << "4->4 conversion" << "\n";
|
// (*testout) << "4->4 conversion" << "\n";
|
||||||
/*
|
/*
|
||||||
(*testout) << "bad1 = " << bad1
|
(*testout) << "bad1 = " << bad1
|
||||||
@ -1664,7 +1591,8 @@ void MeshOptimize3d :: SwapImprove (Mesh & mesh, OPTIMIZEGOAL goal,
|
|||||||
if (bestl != -1)
|
if (bestl != -1)
|
||||||
{
|
{
|
||||||
// (*mycout) << nsuround << "->" << 2 * (nsuround-2) << " " << flush;
|
// (*mycout) << nsuround << "->" << 2 * (nsuround-2) << " " << flush;
|
||||||
cnt++;
|
do_swap = true;
|
||||||
|
if(check_only) return do_swap;
|
||||||
|
|
||||||
for (int k = bestl+1; k <= nsuround + bestl - 2; k++)
|
for (int k = bestl+1; k <= nsuround + bestl - 2; k++)
|
||||||
{
|
{
|
||||||
@ -1714,53 +1642,105 @@ void MeshOptimize3d :: SwapImprove (Mesh & mesh, OPTIMIZEGOAL goal,
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
return do_swap;
|
||||||
}
|
}
|
||||||
|
|
||||||
/*
|
void MeshOptimize3d :: SwapImprove (Mesh & mesh, OPTIMIZEGOAL goal,
|
||||||
if (onlybedges)
|
const NgBitArray * working_elements)
|
||||||
{
|
{
|
||||||
(*testout) << "bad tet: "
|
static Timer t("MeshOptimize3d::SwapImprove"); RegionTimer reg(t);
|
||||||
<< volelements.Get(i)[0]
|
static Timer tloop("MeshOptimize3d::SwapImprove loop");
|
||||||
<< volelements.Get(i)[1]
|
|
||||||
<< volelements.Get(i)[2]
|
|
||||||
<< volelements.Get(i)[3] << "\n";
|
|
||||||
|
|
||||||
if (!mesh.LegalTet (volelements.Get(i)))
|
int cnt = 0;
|
||||||
cerr << "Illegal tet" << "\n";
|
|
||||||
|
int np = mesh.GetNP();
|
||||||
|
int ne = mesh.GetNE();
|
||||||
|
|
||||||
|
mesh.BoundaryEdge (1,2); // ensure the boundary-elements table is built
|
||||||
|
|
||||||
|
// contains at least all elements at node
|
||||||
|
TABLE<ElementIndex,PointIndex::BASE> elementsonnode(np);
|
||||||
|
|
||||||
|
NgArray<ElementIndex> hasbothpoints;
|
||||||
|
|
||||||
|
PrintMessage (3, "SwapImprove ");
|
||||||
|
(*testout) << "\n" << "Start SwapImprove" << endl;
|
||||||
|
|
||||||
|
const char * savetask = multithread.task;
|
||||||
|
multithread.task = "Swap Improve";
|
||||||
|
|
||||||
|
INDEX_3_HASHTABLE<int> faces(mesh.GetNOpenElements()/3 + 2);
|
||||||
|
if (goal == OPT_CONFORM)
|
||||||
|
{
|
||||||
|
for (int i = 1; i <= mesh.GetNOpenElements(); i++)
|
||||||
|
{
|
||||||
|
const Element2d & hel = mesh.OpenElement(i);
|
||||||
|
INDEX_3 face(hel[0], hel[1], hel[2]);
|
||||||
|
face.Sort();
|
||||||
|
faces.Set (face, 1);
|
||||||
}
|
}
|
||||||
*/
|
|
||||||
}
|
}
|
||||||
// (*mycout) << endl;
|
|
||||||
tloop.Stop();
|
|
||||||
/*
|
|
||||||
cout << "edgeused: ";
|
|
||||||
edgeused.PrintMemInfo(cout);
|
|
||||||
*/
|
|
||||||
PrintMessage (5, cnt, " swaps performed");
|
|
||||||
|
|
||||||
|
// Calculate total badness
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
mesh.Compress ();
|
|
||||||
|
|
||||||
/*
|
|
||||||
if (goal == OPT_QUALITY)
|
if (goal == OPT_QUALITY)
|
||||||
{
|
{
|
||||||
bad1 = CalcTotalBad (mesh.Points(), mesh.VolumeElements());
|
double bad1 = CalcTotalBad (mesh.Points(), mesh.VolumeElements());
|
||||||
// (*testout) << "Total badness = " << bad1 << endl;
|
(*testout) << "Total badness = " << bad1 << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
// find elements on node
|
||||||
|
for (ElementIndex ei = 0; ei < ne; ei++)
|
||||||
|
for (PointIndex pi : mesh[ei].PNums())
|
||||||
|
elementsonnode.Add (pi, ei);
|
||||||
|
|
||||||
|
Array<std::tuple<PointIndex,PointIndex>> edges;
|
||||||
|
BuildEdgeList(mesh, elementsonnode, edges);
|
||||||
|
|
||||||
|
Array<int> candidate_edges(edges.Size());
|
||||||
|
std::atomic<int> improvement_counter(0);
|
||||||
|
|
||||||
|
tloop.Start();
|
||||||
|
|
||||||
|
ParallelForRange(Range(edges), [&] (auto myrange)
|
||||||
|
{
|
||||||
|
for(auto i : myrange)
|
||||||
|
{
|
||||||
|
if (multithread.terminate)
|
||||||
|
break;
|
||||||
|
|
||||||
|
auto [pi0, pi1] = edges[i];
|
||||||
|
if(SwapImproveEdge (mesh, goal, working_elements, elementsonnode, faces, pi0, pi1, true))
|
||||||
|
candidate_edges[improvement_counter++] = i;
|
||||||
|
}
|
||||||
|
});
|
||||||
|
// Sequential version:
|
||||||
|
/*
|
||||||
|
for(auto i : edges.Range())
|
||||||
|
{
|
||||||
|
if (multithread.terminate)
|
||||||
|
break;
|
||||||
|
|
||||||
|
auto [pi0, pi1] = edges[i];
|
||||||
|
if(SwapImproveEdge (mesh, goal, working_elements, elementsonnode, faces, pi0, pi1, true))
|
||||||
|
candidate_edges[improvement_counter++] = i;
|
||||||
}
|
}
|
||||||
*/
|
*/
|
||||||
|
|
||||||
/*
|
auto edges_with_improvement = candidate_edges.Part(0, improvement_counter.load());
|
||||||
for (i = 1; i <= GetNE(); i++)
|
QuickSort(edges_with_improvement);
|
||||||
if (volelements.Get(i)[0])
|
|
||||||
if (!mesh.LegalTet (volelements.Get(i)))
|
for(auto ei : edges_with_improvement)
|
||||||
{
|
{
|
||||||
cout << "detected illegal tet, 2" << endl;
|
auto [pi0,pi1] = edges[ei];
|
||||||
(*testout) << "detected illegal tet1: " << i << endl;
|
if(SwapImproveEdge (mesh, goal, working_elements, elementsonnode, faces, pi0, pi1, false))
|
||||||
|
cnt++;
|
||||||
}
|
}
|
||||||
*/
|
|
||||||
|
tloop.Stop();
|
||||||
|
|
||||||
|
PrintMessage (5, cnt, " swaps performed");
|
||||||
|
|
||||||
|
mesh.Compress ();
|
||||||
|
|
||||||
multithread.task = savetask;
|
multithread.task = savetask;
|
||||||
}
|
}
|
||||||
|
|||||||
@ -11,6 +11,9 @@ extern double CalcTotalBad (const Mesh::T_POINTS & points,
|
|||||||
class MeshOptimize3d
|
class MeshOptimize3d
|
||||||
{
|
{
|
||||||
const MeshingParameters & mp;
|
const MeshingParameters & mp;
|
||||||
|
|
||||||
|
void BuildEdgeList( const Mesh & mesh, const TABLE<ElementIndex, PointIndex::BASE> & elementsonnode, Array<std::tuple<PointIndex, PointIndex>> & edges );
|
||||||
|
|
||||||
public:
|
public:
|
||||||
MeshOptimize3d (const MeshingParameters & amp) : mp(amp) { ; }
|
MeshOptimize3d (const MeshingParameters & amp) : mp(amp) { ; }
|
||||||
|
|
||||||
@ -23,6 +26,8 @@ public:
|
|||||||
void CombineImproveSequential (Mesh & mesh, OPTIMIZEGOAL goal = OPT_QUALITY);
|
void CombineImproveSequential (Mesh & mesh, OPTIMIZEGOAL goal = OPT_QUALITY);
|
||||||
|
|
||||||
void SplitImprove (Mesh & mesh, OPTIMIZEGOAL goal = OPT_QUALITY);
|
void SplitImprove (Mesh & mesh, OPTIMIZEGOAL goal = OPT_QUALITY);
|
||||||
|
|
||||||
|
bool SwapImproveEdge (Mesh & mesh, OPTIMIZEGOAL goal, const NgBitArray * working_elements, TABLE<ElementIndex,PointIndex::BASE> & elementsonnode, INDEX_3_HASHTABLE<int> & faces, PointIndex pi1, PointIndex pi2, bool check_only=false);
|
||||||
void SwapImprove (Mesh & mesh, OPTIMIZEGOAL goal = OPT_QUALITY,
|
void SwapImprove (Mesh & mesh, OPTIMIZEGOAL goal = OPT_QUALITY,
|
||||||
const NgBitArray * working_elements = NULL);
|
const NgBitArray * working_elements = NULL);
|
||||||
void SwapImproveSurface (Mesh & mesh, OPTIMIZEGOAL goal = OPT_QUALITY,
|
void SwapImproveSurface (Mesh & mesh, OPTIMIZEGOAL goal = OPT_QUALITY,
|
||||||
|
|||||||
Loading…
Reference in New Issue
Block a user