1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006
|
/*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration |
\\ / A nd | Copyright (C) 2011-2016 OpenFOAM Foundation
\\/ M anipulation |
-------------------------------------------------------------------------------
License
This file is part of OpenFOAM.
OpenFOAM is free software: you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
OpenFOAM is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with OpenFOAM. If not, see <http://www.gnu.org/licenses/>.
Application
autoRefineMesh
Description
Utility to refine cells near to a surface.
\*---------------------------------------------------------------------------*/
#include "argList.H"
#include "Time.H"
#include "polyMesh.H"
#include "twoDPointCorrector.H"
#include "OFstream.H"
#include "multiDirRefinement.H"
#include "triSurface.H"
#include "triSurfaceSearch.H"
#include "cellSet.H"
#include "pointSet.H"
#include "surfaceToCell.H"
#include "surfaceToPoint.H"
#include "cellToPoint.H"
#include "pointToCell.H"
#include "cellToCell.H"
#include "surfaceSets.H"
#include "polyTopoChange.H"
#include "polyTopoChanger.H"
#include "mapPolyMesh.H"
#include "labelIOList.H"
#include "emptyPolyPatch.H"
#include "removeCells.H"
#include "meshSearch.H"
using namespace Foam;
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
// Max cos angle for edges to be considered aligned with axis.
static const scalar edgeTol = 1e-3;
void writeSet(const cellSet& cells, const string& msg)
{
Info<< "Writing " << msg << " (" << cells.size() << ") to cellSet "
<< cells.instance()/cells.local()/cells.name()
<< endl;
cells.write();
}
direction getNormalDir(const twoDPointCorrector* correct2DPtr)
{
direction dir = 3;
if (correct2DPtr)
{
const vector& normal = correct2DPtr->planeNormal();
if (mag(normal & vector(1, 0, 0)) > 1-edgeTol)
{
dir = 0;
}
else if (mag(normal & vector(0, 1, 0)) > 1-edgeTol)
{
dir = 1;
}
else if (mag(normal & vector(0, 0, 1)) > 1-edgeTol)
{
dir = 2;
}
}
return dir;
}
// Calculate some edge statistics on mesh. Return min. edge length over all
// directions but exclude component (0=x, 1=y, 2=z, other=none)
scalar getEdgeStats(const primitiveMesh& mesh, const direction excludeCmpt)
{
label nX = 0;
label nY = 0;
label nZ = 0;
scalar minX = GREAT;
scalar maxX = -GREAT;
vector x(1, 0, 0);
scalar minY = GREAT;
scalar maxY = -GREAT;
vector y(0, 1, 0);
scalar minZ = GREAT;
scalar maxZ = -GREAT;
vector z(0, 0, 1);
scalar minOther = GREAT;
scalar maxOther = -GREAT;
const edgeList& edges = mesh.edges();
forAll(edges, edgeI)
{
const edge& e = edges[edgeI];
vector eVec(e.vec(mesh.points()));
scalar eMag = mag(eVec);
eVec /= eMag;
if (mag(eVec & x) > 1-edgeTol)
{
minX = min(minX, eMag);
maxX = max(maxX, eMag);
nX++;
}
else if (mag(eVec & y) > 1-edgeTol)
{
minY = min(minY, eMag);
maxY = max(maxY, eMag);
nY++;
}
else if (mag(eVec & z) > 1-edgeTol)
{
minZ = min(minZ, eMag);
maxZ = max(maxZ, eMag);
nZ++;
}
else
{
minOther = min(minOther, eMag);
maxOther = max(maxOther, eMag);
}
}
Info<< "Mesh bounding box:" << boundBox(mesh.points()) << nl << nl
<< "Mesh edge statistics:" << nl
<< " x aligned : number:" << nX << "\tminLen:" << minX
<< "\tmaxLen:" << maxX << nl
<< " y aligned : number:" << nY << "\tminLen:" << minY
<< "\tmaxLen:" << maxY << nl
<< " z aligned : number:" << nZ << "\tminLen:" << minZ
<< "\tmaxLen:" << maxZ << nl
<< " other : number:" << mesh.nEdges() - nX - nY - nZ
<< "\tminLen:" << minOther
<< "\tmaxLen:" << maxOther << nl << endl;
if (excludeCmpt == 0)
{
return min(minY, min(minZ, minOther));
}
else if (excludeCmpt == 1)
{
return min(minX, min(minZ, minOther));
}
else if (excludeCmpt == 2)
{
return min(minX, min(minY, minOther));
}
else
{
return min(minX, min(minY, min(minZ, minOther)));
}
}
// Adds empty patch if not yet there. Returns patchID.
label addPatch(polyMesh& mesh, const word& patchName)
{
label patchi = mesh.boundaryMesh().findPatchID(patchName);
if (patchi == -1)
{
const polyBoundaryMesh& patches = mesh.boundaryMesh();
List<polyPatch*> newPatches(patches.size() + 1);
// Add empty patch as 0th entry (Note: only since subsetMesh wants this)
patchi = 0;
newPatches[patchi] =
new emptyPolyPatch
(
Foam::word(patchName),
0,
mesh.nInternalFaces(),
patchi,
patches,
emptyPolyPatch::typeName
);
forAll(patches, i)
{
const polyPatch& pp = patches[i];
newPatches[i+1] =
pp.clone
(
patches,
i+1,
pp.size(),
pp.start()
).ptr();
}
mesh.removeBoundary();
mesh.addPatches(newPatches);
Info<< "Created patch oldInternalFaces at " << patchi << endl;
}
else
{
Info<< "Reusing patch oldInternalFaces at " << patchi << endl;
}
return patchi;
}
// Take surface and select cells based on surface curvature.
void selectCurvatureCells
(
const polyMesh& mesh,
const fileName& surfName,
const triSurfaceSearch& querySurf,
const scalar nearDist,
const scalar curvature,
cellSet& cells
)
{
// Use surfaceToCell to do actual calculation.
// Since we're adding make sure set is on disk.
cells.write();
// Take centre of cell 0 as outside point since info not used.
surfaceToCell cutSource
(
mesh,
surfName,
querySurf.surface(),
querySurf,
pointField(1, mesh.cellCentres()[0]),
false, // includeCut
false, // includeInside
false, // includeOutside
false, // geometricOnly
nearDist,
curvature
);
cutSource.applyToSet(topoSetSource::ADD, cells);
}
// cutCells contains currently selected cells to be refined. Add neighbours
// on the inside or outside to them.
void addCutNeighbours
(
const polyMesh& mesh,
const bool selectInside,
const bool selectOutside,
const labelHashSet& inside,
const labelHashSet& outside,
labelHashSet& cutCells
)
{
// Pick up face neighbours of cutCells
labelHashSet addCutFaces(cutCells.size());
forAllConstIter(labelHashSet, cutCells, iter)
{
const label celli = iter.key();
const labelList& cFaces = mesh.cells()[celli];
forAll(cFaces, i)
{
const label facei = cFaces[i];
if (mesh.isInternalFace(facei))
{
label nbr = mesh.faceOwner()[facei];
if (nbr == celli)
{
nbr = mesh.faceNeighbour()[facei];
}
if (selectInside && inside.found(nbr))
{
addCutFaces.insert(nbr);
}
else if (selectOutside && outside.found(nbr))
{
addCutFaces.insert(nbr);
}
}
}
}
Info<< " Selected an additional " << addCutFaces.size()
<< " neighbours of cutCells to refine" << endl;
forAllConstIter(labelHashSet, addCutFaces, iter)
{
cutCells.insert(iter.key());
}
}
// Return true if any cells had to be split to keep a difference between
// neighbouring refinement levels < limitDiff.
// Gets cells which will be refined (so increase the refinement level) and
// updates it.
bool limitRefinementLevel
(
const primitiveMesh& mesh,
const label limitDiff,
const labelHashSet& excludeCells,
const labelList& refLevel,
labelHashSet& cutCells
)
{
// Do simple check on validity of refinement level.
forAll(refLevel, celli)
{
if (!excludeCells.found(celli))
{
const labelList& cCells = mesh.cellCells()[celli];
forAll(cCells, i)
{
label nbr = cCells[i];
if (!excludeCells.found(nbr))
{
if (refLevel[celli] - refLevel[nbr] >= limitDiff)
{
FatalErrorInFunction
<< "Level difference between neighbouring cells "
<< celli << " and " << nbr
<< " greater than or equal to " << limitDiff << endl
<< "refLevels:" << refLevel[celli] << ' '
<< refLevel[nbr] << abort(FatalError);
}
}
}
}
}
labelHashSet addCutCells(cutCells.size());
forAllConstIter(labelHashSet, cutCells, iter)
{
// celli will be refined.
const label celli = iter.key();
const labelList& cCells = mesh.cellCells()[celli];
forAll(cCells, i)
{
const label nbr = cCells[i];
if (!excludeCells.found(nbr) && !cutCells.found(nbr))
{
if (refLevel[celli] + 1 - refLevel[nbr] >= limitDiff)
{
addCutCells.insert(nbr);
}
}
}
}
if (addCutCells.size())
{
// Add cells to cutCells.
Info<< "Added an additional " << addCutCells.size() << " cells"
<< " to satisfy 1:" << limitDiff << " refinement level"
<< endl;
forAllConstIter(labelHashSet, addCutCells, iter)
{
cutCells.insert(iter.key());
}
return true;
}
else
{
Info<< "Added no additional cells"
<< " to satisfy 1:" << limitDiff << " refinement level"
<< endl;
return false;
}
}
// Do all refinement (i.e. refCells) according to refineDict and update
// refLevel afterwards for added cells
void doRefinement
(
polyMesh& mesh,
const dictionary& refineDict,
const labelHashSet& refCells,
labelList& refLevel
)
{
label oldCells = mesh.nCells();
// Multi-iteration, multi-direction topology modifier.
multiDirRefinement multiRef
(
mesh,
refCells.toc(),
refineDict
);
//
// Update refLevel for split cells
//
refLevel.setSize(mesh.nCells());
for (label celli = oldCells; celli < mesh.nCells(); celli++)
{
refLevel[celli] = 0;
}
const labelListList& addedCells = multiRef.addedCells();
forAll(addedCells, oldCelli)
{
const labelList& added = addedCells[oldCelli];
if (added.size())
{
// Give all cells resulting from split the refinement level
// of the master.
label masterLevel = ++refLevel[oldCelli];
forAll(added, i)
{
refLevel[added[i]] = masterLevel;
}
}
}
}
// Subset mesh and update refLevel and cutCells
void subsetMesh
(
polyMesh& mesh,
const label writeMesh,
const label patchi, // patchID for exposed faces
const labelHashSet& cellsToRemove,
cellSet& cutCells,
labelIOList& refLevel
)
{
removeCells cellRemover(mesh);
labelList cellLabels(cellsToRemove.toc());
Info<< "Mesh has:" << mesh.nCells() << " cells."
<< " Removing:" << cellLabels.size() << " cells" << endl;
// exposed faces
labelList exposedFaces(cellRemover.getExposedFaces(cellLabels));
polyTopoChange meshMod(mesh);
cellRemover.setRefinement
(
cellLabels,
exposedFaces,
labelList(exposedFaces.size(), patchi),
meshMod
);
// Do all changes
Info<< "Morphing ..." << endl;
const Time& runTime = mesh.time();
autoPtr<mapPolyMesh> morphMap = meshMod.changeMesh(mesh, false);
if (morphMap().hasMotionPoints())
{
mesh.movePoints(morphMap().preMotionPoints());
}
// Update topology on cellRemover
cellRemover.updateMesh(morphMap());
// Update refLevel for removed cells.
const labelList& cellMap = morphMap().cellMap();
labelList newRefLevel(cellMap.size());
forAll(cellMap, i)
{
newRefLevel[i] = refLevel[cellMap[i]];
}
// Transfer back to refLevel
refLevel.transfer(newRefLevel);
if (writeMesh)
{
Info<< "Writing refined mesh to time " << runTime.timeName() << nl
<< endl;
IOstream::defaultPrecision(max(10u, IOstream::defaultPrecision()));
mesh.write();
refLevel.write();
}
// Update cutCells for removed cells.
cutCells.updateMesh(morphMap());
}
// Divide the cells according to status compared to surface. Constructs sets:
// - cutCells : all cells cut by surface
// - inside : all cells inside surface
// - outside : ,, outside ,,
// and a combined set:
// - selected : sum of above according to selectCut/Inside/Outside flags.
void classifyCells
(
const polyMesh& mesh,
const fileName& surfName,
const triSurfaceSearch& querySurf,
const pointField& outsidePts,
const bool selectCut,
const bool selectInside,
const bool selectOutside,
const label nCutLayers,
cellSet& inside,
cellSet& outside,
cellSet& cutCells,
cellSet& selected
)
{
// Cut faces with surface and classify cells
surfaceSets::getSurfaceSets
(
mesh,
surfName,
querySurf.surface(),
querySurf,
outsidePts,
nCutLayers,
inside,
outside,
cutCells
);
// Combine wanted parts into selected
if (selectCut)
{
selected.addSet(cutCells);
}
if (selectInside)
{
selected.addSet(inside);
}
if (selectOutside)
{
selected.addSet(outside);
}
Info<< "Determined cell status:" << endl
<< " inside :" << inside.size() << endl
<< " outside :" << outside.size() << endl
<< " cutCells:" << cutCells.size() << endl
<< " selected:" << selected.size() << endl
<< endl;
writeSet(inside, "inside cells");
writeSet(outside, "outside cells");
writeSet(cutCells, "cut cells");
writeSet(selected, "selected cells");
}
int main(int argc, char *argv[])
{
argList::noParallel();
#include "setRootCase.H"
#include "createTime.H"
#include "createPolyMesh.H"
// If nessecary add oldInternalFaces patch
label newPatchi = addPatch(mesh, "oldInternalFaces");
//
// Read motionProperties dictionary
//
Info<< "Checking for motionProperties\n" << endl;
IOobject motionObj
(
"motionProperties",
runTime.constant(),
mesh,
IOobject::MUST_READ_IF_MODIFIED,
IOobject::NO_WRITE
);
// corrector for mesh motion
twoDPointCorrector* correct2DPtr = NULL;
if (motionObj.headerOk())
{
Info<< "Reading " << runTime.constant() / "motionProperties"
<< endl << endl;
IOdictionary motionProperties(motionObj);
Switch twoDMotion(motionProperties.lookup("twoDMotion"));
if (twoDMotion)
{
Info<< "Correcting for 2D motion" << endl << endl;
correct2DPtr = new twoDPointCorrector(mesh);
}
}
IOdictionary refineDict
(
IOobject
(
"autoRefineMeshDict",
runTime.system(),
mesh,
IOobject::MUST_READ_IF_MODIFIED,
IOobject::NO_WRITE
)
);
fileName surfName(refineDict.lookup("surface"));
surfName.expand();
label nCutLayers(readLabel(refineDict.lookup("nCutLayers")));
label cellLimit(readLabel(refineDict.lookup("cellLimit")));
bool selectCut(readBool(refineDict.lookup("selectCut")));
bool selectInside(readBool(refineDict.lookup("selectInside")));
bool selectOutside(readBool(refineDict.lookup("selectOutside")));
bool selectHanging(readBool(refineDict.lookup("selectHanging")));
scalar minEdgeLen(readScalar(refineDict.lookup("minEdgeLen")));
scalar maxEdgeLen(readScalar(refineDict.lookup("maxEdgeLen")));
scalar curvature(readScalar(refineDict.lookup("curvature")));
scalar curvDist(readScalar(refineDict.lookup("curvatureDistance")));
pointField outsidePts(refineDict.lookup("outsidePoints"));
label refinementLimit(readLabel(refineDict.lookup("splitLevel")));
bool writeMesh(readBool(refineDict.lookup("writeMesh")));
Info<< "Cells to be used for meshing (0=false, 1=true):" << nl
<< " cells cut by surface : " << selectCut << nl
<< " cells inside of surface : " << selectInside << nl
<< " cells outside of surface : " << selectOutside << nl
<< " hanging cells : " << selectHanging << nl
<< endl;
if (nCutLayers > 0 && selectInside)
{
WarningInFunction
<< "Illogical settings : Both nCutLayers>0 and selectInside true."
<< endl
<< "This would mean that inside cells get removed but should be"
<< " included in final mesh" << endl;
}
// Surface.
triSurface surf(surfName);
// Search engine on surface
triSurfaceSearch querySurf(surf);
// Search engine on mesh. No face decomposition since mesh unwarped.
meshSearch queryMesh(mesh, polyMesh::FACE_PLANES);
// Check all 'outside' points
forAll(outsidePts, outsideI)
{
const point& outsidePoint = outsidePts[outsideI];
if (queryMesh.findCell(outsidePoint, -1, false) == -1)
{
FatalErrorInFunction
<< "outsidePoint " << outsidePoint
<< " is not inside any cell"
<< exit(FatalError);
}
}
// Current refinement level. Read if present.
labelIOList refLevel
(
IOobject
(
"refinementLevel",
runTime.timeName(),
polyMesh::defaultRegion,
mesh,
IOobject::READ_IF_PRESENT,
IOobject::AUTO_WRITE
),
labelList(mesh.nCells(), 0)
);
label maxLevel = max(refLevel);
if (maxLevel > 0)
{
Info<< "Read existing refinement level from file "
<< refLevel.objectPath() << nl
<< " min level : " << min(refLevel) << nl
<< " max level : " << maxLevel << nl
<< endl;
}
else
{
Info<< "Created zero refinement level in file "
<< refLevel.objectPath() << nl
<< endl;
}
// Print edge stats on original mesh. Leave out 2d-normal direction
direction normalDir(getNormalDir(correct2DPtr));
scalar meshMinEdgeLen = getEdgeStats(mesh, normalDir);
while (meshMinEdgeLen > minEdgeLen)
{
// Get inside/outside/cutCells cellSets.
cellSet inside(mesh, "inside", mesh.nCells()/10);
cellSet outside(mesh, "outside", mesh.nCells()/10);
cellSet cutCells(mesh, "cutCells", mesh.nCells()/10);
cellSet selected(mesh, "selected", mesh.nCells()/10);
classifyCells
(
mesh,
surfName,
querySurf,
outsidePts,
selectCut, // for determination of selected
selectInside, // for determination of selected
selectOutside, // for determination of selected
nCutLayers, // How many layers of cutCells to include
inside,
outside,
cutCells,
selected // not used but determined anyway.
);
Info<< " Selected " << cutCells.name() << " with "
<< cutCells.size() << " cells" << endl;
if ((curvDist > 0) && (meshMinEdgeLen < maxEdgeLen))
{
// Done refining enough close to surface. Now switch to more
// intelligent refinement where only cutCells on surface curvature
// are refined.
cellSet curveCells(mesh, "curveCells", mesh.nCells()/10);
selectCurvatureCells
(
mesh,
surfName,
querySurf,
maxEdgeLen,
curvature,
curveCells
);
Info<< " Selected " << curveCells.name() << " with "
<< curveCells.size() << " cells" << endl;
// Add neighbours to cutCells. This is if selectCut is not
// true and so outside and/or inside cells get exposed there is
// also refinement in them.
if (!selectCut)
{
addCutNeighbours
(
mesh,
selectInside,
selectOutside,
inside,
outside,
cutCells
);
}
// Subset cutCells to only curveCells
cutCells.subset(curveCells);
Info<< " Removed cells not on surface curvature. Selected "
<< cutCells.size() << endl;
}
if (nCutLayers > 0)
{
// Subset mesh to remove inside cells altogether. Updates cutCells,
// refLevel.
subsetMesh(mesh, writeMesh, newPatchi, inside, cutCells, refLevel);
}
// Added cells from 2:1 refinement level restriction.
while
(
limitRefinementLevel
(
mesh,
refinementLimit,
labelHashSet(),
refLevel,
cutCells
)
)
{}
Info<< " Current cells : " << mesh.nCells() << nl
<< " Selected for refinement :" << cutCells.size() << nl
<< endl;
if (cutCells.empty())
{
Info<< "Stopping refining since 0 cells selected to be refined ..."
<< nl << endl;
break;
}
if ((mesh.nCells() + 8*cutCells.size()) > cellLimit)
{
Info<< "Stopping refining since cell limit reached ..." << nl
<< "Would refine from " << mesh.nCells()
<< " to " << mesh.nCells() + 8*cutCells.size() << " cells."
<< nl << endl;
break;
}
doRefinement
(
mesh,
refineDict,
cutCells,
refLevel
);
Info<< " After refinement:" << mesh.nCells() << nl
<< endl;
if (writeMesh)
{
Info<< " Writing refined mesh to time " << runTime.timeName()
<< nl << endl;
IOstream::defaultPrecision(max(10u, IOstream::defaultPrecision()));
mesh.write();
refLevel.write();
}
// Update mesh edge stats.
meshMinEdgeLen = getEdgeStats(mesh, normalDir);
}
if (selectHanging)
{
// Get inside/outside/cutCells cellSets.
cellSet inside(mesh, "inside", mesh.nCells()/10);
cellSet outside(mesh, "outside", mesh.nCells()/10);
cellSet cutCells(mesh, "cutCells", mesh.nCells()/10);
cellSet selected(mesh, "selected", mesh.nCells()/10);
classifyCells
(
mesh,
surfName,
querySurf,
outsidePts,
selectCut,
selectInside,
selectOutside,
nCutLayers,
inside,
outside,
cutCells,
selected
);
// Find any cells which have all their points on the outside of the
// selected set and refine them
labelHashSet hanging = surfaceSets::getHangingCells(mesh, selected);
Info<< "Detected " << hanging.size() << " hanging cells"
<< " (cells with all points on"
<< " outside of cellSet 'selected').\nThese would probably result"
<< " in flattened cells when snapping the mesh to the surface"
<< endl;
Info<< "Refining " << hanging.size() << " hanging cells" << nl
<< endl;
// Added cells from 2:1 refinement level restriction.
while
(
limitRefinementLevel
(
mesh,
refinementLimit,
labelHashSet(),
refLevel,
hanging
)
)
{}
doRefinement(mesh, refineDict, hanging, refLevel);
Info<< "Writing refined mesh to time " << runTime.timeName() << nl
<< endl;
// Write final mesh
IOstream::defaultPrecision(max(10u, IOstream::defaultPrecision()));
mesh.write();
refLevel.write();
}
else if (!writeMesh)
{
Info<< "Writing refined mesh to time " << runTime.timeName() << nl
<< endl;
// Write final mesh. (will have been written already if writeMesh=true)
IOstream::defaultPrecision(max(10u, IOstream::defaultPrecision()));
mesh.write();
refLevel.write();
}
Info<< "End\n" << endl;
return 0;
}
// ************************************************************************* //
|