/*---------------------------------------------------------------------------*\ ========= | \\ / F ield | OpenFOAM: The Open Source CFD Toolbox \\ / O peration | Website: https://openfoam.org \\ / A nd | Copyright (C) 2011-2026 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 . \*---------------------------------------------------------------------------*/ #include "meshRefinement.H" #include "trackedParticle.H" #include "syncTools.H" #include "Time.H" #include "refinementSurfaces.H" #include "refinementFeatures.H" #include "refinementRegions.H" #include "faceSet.H" #include "decompositionMethod.H" #include "fvMeshDistribute.H" #include "polyTopoChange.H" #include "polyDistributionMap.H" #include "Cloud.H" #include "OBJstream.H" #include "cellSet.H" #include "meshSearch.H" // * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * // namespace Foam { //- To compare normals static bool less(const vector& x, const vector& y) { for (direction i = 0; i < vector::nComponents; i++) { if (x[i] < y[i]) { return true; } else if (x[i] > y[i]) { return false; } } // All components the same return false; } //- To compare normals class normalLess { const vectorList& values_; public: normalLess(const vectorList& values) : values_(values) {} bool operator()(const label a, const label b) const { return less(values_[a], values_[b]); } }; //- Template specialisation for pTraits so we can have fields template<> class pTraits { public: //- Component type typedef labelList cmptType; }; //- Template specialisation for pTraits so we can have fields template<> class pTraits { public: //- Component type typedef vectorList cmptType; }; } // * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * // // Get faces (on the new mesh) that have in some way been affected by the // mesh change. Picks up all faces but those that are between two // unrefined faces. (Note that of an unchanged face the edge still might be // split but that does not change any face centre or cell centre. Foam::labelList Foam::meshRefinement::getChangedFaces ( const polyTopoChangeMap& map, const labelList& oldCellsToRefine ) { const polyMesh& mesh = map.mesh(); labelList changedFaces; // For reporting: number of masterFaces changed label nMasterChanged = 0; PackedBoolList isMasterFace(syncTools::getMasterFaces(mesh)); { // Mark any face on a cell which has been added or changed // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ // Note that refining a face changes the face centre (for a warped face) // which changes the cell centre. This again changes the cellcentre- // cellcentre edge across all faces of the cell. // Note: this does not happen for unwarped faces but unfortunately // we don't have this information. const labelList& faceOwner = mesh.faceOwner(); const labelList& faceNeighbour = mesh.faceNeighbour(); const cellList& cells = mesh.cells(); const label nInternalFaces = mesh.nInternalFaces(); // Mark refined cells on old mesh PackedBoolList oldRefineCell(map.nOldCells()); forAll(oldCellsToRefine, i) { oldRefineCell.set(oldCellsToRefine[i], 1u); } // Mark refined faces PackedBoolList refinedInternalFace(nInternalFaces); // 1. Internal faces for (label facei = 0; facei < nInternalFaces; facei++) { const label oldOwn = map.cellMap()[faceOwner[facei]]; const label oldNei = map.cellMap()[faceNeighbour[facei]]; if ( oldOwn >= 0 && oldRefineCell.get(oldOwn) == 0u && oldNei >= 0 && oldRefineCell.get(oldNei) == 0u ) { // Unaffected face since both neighbours were not refined. } else { refinedInternalFace.set(facei, 1u); } } // 2. Boundary faces boolList refinedBoundaryFace(mesh.nFaces()-nInternalFaces, false); forAll(mesh.boundary(), patchi) { const polyPatch& pp = mesh.boundary()[patchi]; label facei = pp.start(); forAll(pp, i) { label oldOwn = map.cellMap()[faceOwner[facei]]; if (oldOwn >= 0 && oldRefineCell.get(oldOwn) == 0u) { // owner did exist and wasn't refined. } else { refinedBoundaryFace[facei - nInternalFaces] = true; } facei++; } } // Synchronise refined face status syncTools::syncBoundaryFaceList ( mesh, refinedBoundaryFace, orEqOp() ); // 3. Mark all faces affected by refinement. Refined faces are in // - refinedInternalFace // - refinedBoundaryFace boolList changedFace(mesh.nFaces(), false); forAll(refinedInternalFace, facei) { if (refinedInternalFace.get(facei) == 1u) { const cell& ownFaces = cells[faceOwner[facei]]; forAll(ownFaces, owni) { changedFace[ownFaces[owni]] = true; } const cell& neiFaces = cells[faceNeighbour[facei]]; forAll(neiFaces, neii) { changedFace[neiFaces[neii]] = true; } } } forAll(refinedBoundaryFace, i) { if (refinedBoundaryFace[i]) { const cell& ownFaces = cells[faceOwner[i+nInternalFaces]]; forAll(ownFaces, owni) { changedFace[ownFaces[owni]] = true; } } } syncTools::syncFaceList ( mesh, changedFace, orEqOp() ); // Now we have in changedFace marked all affected faces. Pack. // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ changedFaces = findIndices(changedFace, true); // Count changed master faces. nMasterChanged = 0; forAll(changedFace, facei) { if (changedFace[facei] && isMasterFace[facei]) { nMasterChanged++; } } } if (debug&meshRefinement::MESH) { Pout<< "getChangedFaces : Detected " << " local:" << changedFaces.size() << " global:" << returnReduce(nMasterChanged, sumOp()) << " changed faces out of " << mesh.globalData().nTotalFaces() << endl; faceSet changedFacesSet(mesh, "changedFaces", changedFaces); Pout<< "getChangedFaces : Writing " << changedFaces.size() << " changed faces to faceSet " << changedFacesSet.name() << endl; changedFacesSet.write(); } return changedFaces; } // Mark cell for refinement (if not already marked). Return false if // refinelimit hit. Keeps running count (in nRefine) of cells marked for // refinement bool Foam::meshRefinement::markForRefine ( const label markValue, const label nAllowRefine, label& cellValue, label& nRefine ) { if (cellValue == -1) { cellValue = markValue; nRefine++; } return nRefine <= nAllowRefine; } void Foam::meshRefinement::markFeatureCellLevel ( const List& insidePoints, labelList& maxFeatureLevel ) const { // We want to refine all cells containing a feature edge. // - don't want to search over whole mesh // - don't want to build octree for whole mesh // - so use tracking to follow the feature edges // // 1. find non-manifold points on feature edges (i.e. start of feature edge // or 'knot') // 2. seed particle starting at insidePoint going to this non-manifold // point // 3. track particles to their non-manifold point // // 4. track particles across their connected feature edges, marking all // visited cells with their level (through trackingData) // 5. do 4 until all edges have been visited. // Find all start cells of features. // Is done by tracking from insidePoint. lagrangian::Cloud startPointCloud ( mesh_, "startPointCloud", IDLList() ); // Features are identical on all processors. Number them so we know // what to seed. Do this on only the processor that // holds the insidePoint. label nLocateBoundaryHits = 0; const meshSearch& searchEngine = meshSearch::New(mesh()); forAll(insidePoints, i) { const point& insidePoint = insidePoints[i]; const label celli = searchEngine.findCell(insidePoint); if (celli != -1) { // I am the processor that holds the insidePoint forAll(features_, feati) { const edgeMesh& featureMesh = features_[feati]; const label featureLevel = features_.levels()[feati][0]; const labelListList& pointEdges = featureMesh.pointEdges(); // Find regions on edgeMesh labelList edgeRegion; const label nRegions = featureMesh.regions(edgeRegion); PackedBoolList regionVisited(nRegions); // 1. Seed all 'knots' in edgeMesh forAll(pointEdges, pointi) { if (pointEdges[pointi].size() != 2) { if (debug&meshRefinement::FEATURESEEDS) { Pout<< "Adding particle from point:" << pointi << " coord:" << featureMesh.points()[pointi] << " since number of emanating edges:" << pointEdges[pointi].size() << endl; } // Non-manifold point. Create particle. startPointCloud.addParticle ( new trackedParticle ( searchEngine, insidePoint, celli, nLocateBoundaryHits, featureMesh.points()[pointi], // endpos featureLevel, // level feati, // featureMesh pointi, // end point -1 // feature edge ) ); // Mark if (pointEdges[pointi].size() > 0) { label e0 = pointEdges[pointi][0]; label regioni = edgeRegion[e0]; regionVisited[regioni] = 1u; } } } // 2. Any regions that have not been visited at all? These can // only be circular regions! forAll(featureMesh.edges(), edgei) { if (regionVisited.set(edgeRegion[edgei], 1u)) { const edge& e = featureMesh.edges()[edgei]; const label pointi = e.start(); if (debug&meshRefinement::FEATURESEEDS) { Pout<< "Adding particle from point:" << pointi << " coord:" << featureMesh.points()[pointi] << " on circular region:" << edgeRegion[edgei] << endl; } // Non-manifold point. Create particle. startPointCloud.addParticle ( new trackedParticle ( searchEngine, insidePoint, celli, nLocateBoundaryHits, featureMesh.points()[pointi], // endpos featureLevel, // level feati, // featureMesh pointi, // end point -1 // feature edge ) ); } } } } } // Largest refinement level of any feature passed through maxFeatureLevel = labelList(mesh_.nCells(), -1); // Whether edge has been visited. List featureEdgeVisited(features_.size()); forAll(features_, feati) { featureEdgeVisited[feati].setSize(features_[feati].edges().size()); featureEdgeVisited[feati] = 0u; } // Database to pass into trackedParticle::move trackedParticle::trackingData td ( startPointCloud, 2.0*mesh_.bounds().mag(), maxFeatureLevel, featureEdgeVisited ); // Track all particles to their end position (= starting feature point) // Note that the particle might have started on a different processor // so this will transfer across nicely until we can start tracking proper. if (debug&meshRefinement::FEATURESEEDS) { Pout<< "Tracking " << startPointCloud.size() << " particles over distance " << td.maxTrackLen_ << " to find the starting cell" << endl; } startPointCloud.move(startPointCloud, td); // Reset levels maxFeatureLevel = -1; forAll(features_, feati) { featureEdgeVisited[feati] = 0u; } lagrangian::Cloud cloud ( mesh_, "featureCloud", IDLList() ); if (debug&meshRefinement::FEATURESEEDS) { Pout<< "Constructing cloud for cell marking" << endl; } forAllIter(lagrangian::Cloud, startPointCloud, iter) { const trackedParticle& startTp = iter(); const label feati = startTp.i(); const label pointi = startTp.j(); const edgeMesh& featureMesh = features_[feati]; const labelList& pEdges = featureMesh.pointEdges()[pointi]; // Now shoot particles down all pEdges. forAll(pEdges, pEdgei) { const label edgei = pEdges[pEdgei]; if (featureEdgeVisited[feati].set(edgei, 1u)) { // Unvisited edge. Make the particle go to the other point // on the edge. const edge& e = featureMesh.edges()[edgei]; label otherPointi = e.otherVertex(pointi); trackedParticle* tp(new trackedParticle(startTp)); tp->start() = tp->position(mesh_); tp->end() = featureMesh.points()[otherPointi]; tp->fraction() = 1; tp->j() = otherPointi; tp->k() = edgei; if (debug&meshRefinement::FEATURESEEDS) { Pout<< "Adding particle for point:" << pointi << " coord:" << tp->position(mesh_) << " feature:" << feati << " to track to:" << tp->end() << endl; } cloud.addParticle(tp); } } } startPointCloud.clear(); while (true) { // Track all particles to their end position. if (debug&meshRefinement::FEATURESEEDS) { Pout<< "Tracking " << cloud.size() << " particles over distance " << td.maxTrackLen_ << " to mark cells" << endl; } cloud.move(cloud, td); // Make particle follow edge. forAllIter(lagrangian::Cloud, cloud, iter) { trackedParticle& tp = iter(); const label feati = tp.i(); const label pointi = tp.j(); const edgeMesh& featureMesh = features_[feati]; const labelList& pEdges = featureMesh.pointEdges()[pointi]; // Particle now at pointi. Check connected edges to see which one // we have to visit now. bool keepParticle = false; forAll(pEdges, i) { const label edgei = pEdges[i]; if (featureEdgeVisited[feati].set(edgei, 1u)) { // Unvisited edge. Make the particle go to the other point // on the edge. const edge& e = featureMesh.edges()[edgei]; const label otherPointi = e.otherVertex(pointi); tp.start() = tp.position(mesh_); tp.end() = featureMesh.points()[otherPointi]; tp.fraction() = 1; tp.j() = otherPointi; tp.k() = edgei; keepParticle = true; break; } } if (!keepParticle) { // Particle at 'knot' where another particle already has been // seeded. Delete particle. cloud.deleteParticle(tp); } } if (debug&meshRefinement::FEATURESEEDS) { Pout<< "Remaining particles " << cloud.size() << endl; } if (returnReduce(cloud.size(), sumOp()) == 0) { break; } } // if (debug&meshRefinement::FEATURESEEDS) //{ // forAll(maxFeatureLevel, celli) // { // if (maxFeatureLevel[celli] != -1) // { // Pout<< "Feature went through cell:" << celli // << " coord:" << mesh_.cellCentres()[celli] // << " level:" << maxFeatureLevel[celli] // << endl; // } // } //} } // Calculates list of cells to refine based on intersection with feature edge. Foam::label Foam::meshRefinement::markFeatureRefinement ( const List& insidePoints, const label nAllowRefine, labelList& refineCell, label& nRefine ) const { // Largest refinement level of any feature passed through labelList maxFeatureLevel; markFeatureCellLevel(insidePoints, maxFeatureLevel); // See which cells to refine. maxFeatureLevel will hold highest level // of any feature edge that passed through. const labelList& cellLevel = meshCutter_.cellLevel(); const label oldNRefine = nRefine; forAll(maxFeatureLevel, celli) { if (maxFeatureLevel[celli] > cellLevel[celli]) { // Mark if ( !markForRefine ( 0, // surface (n/a) nAllowRefine, refineCell[celli], nRefine ) ) { // Reached limit break; } } } if ( returnReduce(nRefine, sumOp()) > returnReduce(nAllowRefine, sumOp()) ) { Info<< "Reached refinement limit." << endl; } return returnReduce(nRefine-oldNRefine, sumOp()); } // Mark cells for distance-to-feature based refinement. Foam::label Foam::meshRefinement::markInternalDistanceToFeatureRefinement ( const label nAllowRefine, labelList& refineCell, label& nRefine ) const { const labelList& cellLevel = meshCutter_.cellLevel(); const pointField& cellCentres = mesh_.cellCentres(); // Detect if there are any distance features if (features_.maxDistance() <= 0.0) { return 0; } label oldNRefine = nRefine; // Collect cells to test pointField testCc(cellLevel.size()-nRefine); labelList testLevels(cellLevel.size()-nRefine); label testi = 0; forAll(cellLevel, celli) { if (refineCell[celli] == -1) { testCc[testi] = cellCentres[celli]; testLevels[testi] = cellLevel[celli]; testi++; } } // Do test to see whether cells are in/near features with higher level labelList maxLevel; features_.findHigherLevel(testCc, testLevels, maxLevel); // Mark for refinement. Note that we didn't store the original cellID so // now just reloop in same order. testi = 0; forAll(cellLevel, celli) { if (refineCell[celli] == -1) { if (maxLevel[testi] > testLevels[testi]) { const bool reachedLimit = !markForRefine ( maxLevel[testi], // mark with any positive value nAllowRefine, refineCell[celli], nRefine ); if (reachedLimit) { if (debug) { Pout<< "Stopped refining internal cells" << " since reaching my cell limit of " << mesh_.nCells()+7*nRefine << endl; } break; } } testi++; } } if ( returnReduce(nRefine, sumOp()) > returnReduce(nAllowRefine, sumOp()) ) { Info<< "Reached refinement limit." << endl; } return returnReduce(nRefine-oldNRefine, sumOp()); } Foam::label Foam::meshRefinement::markInternalRefinement ( const label nAllowRefine, labelList& refineCell, label& nRefine ) const { const labelList& cellLevel = meshCutter_.cellLevel(); const pointField& cellCentres = mesh_.cellCentres(); const label oldNRefine = nRefine; // Collect cells to test pointField testCc(cellLevel.size()-nRefine); labelList testLevels(cellLevel.size()-nRefine); label testi = 0; forAll(cellLevel, celli) { if (refineCell[celli] == -1) { testCc[testi] = cellCentres[celli]; testLevels[testi] = cellLevel[celli]; testi++; } } // Do test to see whether cells is inside/outside shell with higher level labelList maxLevel; shells_.findHigherLevel ( testCc, testLevels, meshCutter_.level0EdgeLength(), maxLevel ); // Mark for refinement. Note that we didn't store the original cellID so // now just reloop in same order. testi = 0; forAll(cellLevel, celli) { if (refineCell[celli] == -1) { if (maxLevel[testi] > testLevels[testi]) { bool reachedLimit = !markForRefine ( maxLevel[testi], // mark with any positive value nAllowRefine, refineCell[celli], nRefine ); if (reachedLimit) { if (debug) { Pout<< "Stopped refining internal cells" << " since reaching my cell limit of " << mesh_.nCells()+7*nRefine << endl; } break; } } testi++; } } if ( returnReduce(nRefine, sumOp()) > returnReduce(nAllowRefine, sumOp()) ) { Info<< "Reached refinement limit." << endl; } return returnReduce(nRefine-oldNRefine, sumOp()); } Foam::labelList Foam::meshRefinement::getRefineCandidateFaces ( const labelList& refineCell ) const { labelList testFaces(mesh_.nFaces()); label nTest = 0; forAll(surfaceIndex_, facei) { if (surfaceIndex_[facei] != -1) { label own = mesh_.faceOwner()[facei]; if (mesh_.isInternalFace(facei)) { const label nei = mesh_.faceNeighbour()[facei]; if (refineCell[own] == -1 || refineCell[nei] == -1) { testFaces[nTest++] = facei; } } else { if (refineCell[own] == -1) { testFaces[nTest++] = facei; } } } } testFaces.setSize(nTest); return testFaces; } Foam::label Foam::meshRefinement::markSurfaceRefinement ( const label nAllowRefine, const labelList& neiLevel, const pointField& neiCc, labelList& refineCell, label& nRefine ) const { const labelList& cellLevel = meshCutter_.cellLevel(); const pointField& cellCentres = mesh_.cellCentres(); const label oldNRefine = nRefine; // Use cached surfaceIndex_ to detect if any intersection. If so // re-intersect to determine level wanted. // Collect candidate faces // ~~~~~~~~~~~~~~~~~~~~~~~ labelList testFaces(getRefineCandidateFaces(refineCell)); // Collect segments // ~~~~~~~~~~~~~~~~ pointField start(testFaces.size()); pointField end(testFaces.size()); labelList minLevel(testFaces.size()); forAll(testFaces, i) { const label facei = testFaces[i]; const label own = mesh_.faceOwner()[facei]; if (mesh_.isInternalFace(facei)) { label nei = mesh_.faceNeighbour()[facei]; start[i] = cellCentres[own]; end[i] = cellCentres[nei]; minLevel[i] = min(cellLevel[own], cellLevel[nei]); } else { const label bFacei = facei - mesh_.nInternalFaces(); start[i] = cellCentres[own]; end[i] = neiCc[bFacei]; minLevel[i] = min(cellLevel[own], neiLevel[bFacei]); } } // Extend segments a bit { const vectorField smallVec(rootSmall*(end-start)); start -= smallVec; end += smallVec; } // Do test for higher intersections // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ labelList surfaceHit; labelList surfaceMinLevel; surfaces_.findHigherIntersection ( start, end, minLevel, surfaceHit, surfaceMinLevel ); // Mark cells for refinement // ~~~~~~~~~~~~~~~~~~~~~~~~~ forAll(testFaces, i) { const label facei = testFaces[i]; const label surfi = surfaceHit[i]; if (surfi != -1) { // Found intersection with surface with higher wanted // refinement. Check if the level field on that surface // specifies an even higher level. Note:this is weird. Should // do the check with the surfaceMinLevel whilst intersecting the // surfaces? const label own = mesh_.faceOwner()[facei]; if (surfaceMinLevel[i] > cellLevel[own]) { // Owner needs refining if ( !markForRefine ( surfi, nAllowRefine, refineCell[own], nRefine ) ) { break; } } if (mesh_.isInternalFace(facei)) { const label nei = mesh_.faceNeighbour()[facei]; if (surfaceMinLevel[i] > cellLevel[nei]) { // Neighbour needs refining if ( !markForRefine ( surfi, nAllowRefine, refineCell[nei], nRefine ) ) { break; } } } } } if ( returnReduce(nRefine, sumOp()) > returnReduce(nAllowRefine, sumOp()) ) { Info<< "Reached refinement limit." << endl; } return returnReduce(nRefine-oldNRefine, sumOp()); } // Count number of matches of first argument in second argument Foam::label Foam::meshRefinement::countMatches ( const List& normals1, const List& normals2, const scalar tol ) const { label nMatches = 0; forAll(normals1, i) { const vector& n1 = normals1[i]; forAll(normals2, j) { const vector& n2 = normals2[j]; if (magSqr(n1-n2) < tol) { nMatches++; break; } } } return nMatches; } // Mark cells for surface curvature based refinement. Foam::label Foam::meshRefinement::markSurfaceCurvatureRefinement ( const scalar curvature, const label nAllowRefine, const labelList& neiLevel, const pointField& neiCc, labelList& refineCell, label& nRefine ) const { const labelList& cellLevel = meshCutter_.cellLevel(); const pointField& cellCentres = mesh_.cellCentres(); const label oldNRefine = nRefine; // 1. local test: any cell on more than one surface gets refined // (if its current level is < max of the surface max level) // 2. 'global' test: any cell on only one surface with a neighbour // on a different surface gets refined (if its current level etc.) const PackedBoolList isMasterFace(syncTools::getMasterFaces(mesh_)); // Collect candidate faces (i.e. intersecting any surface and // owner/neighbour not yet refined. labelList testFaces(getRefineCandidateFaces(refineCell)); // Collect segments pointField start(testFaces.size()); pointField end(testFaces.size()); labelList minLevel(testFaces.size()); forAll(testFaces, i) { const label facei = testFaces[i]; const label own = mesh_.faceOwner()[facei]; if (mesh_.isInternalFace(facei)) { const label nei = mesh_.faceNeighbour()[facei]; start[i] = cellCentres[own]; end[i] = cellCentres[nei]; minLevel[i] = min(cellLevel[own], cellLevel[nei]); } else { const label bFacei = facei - mesh_.nInternalFaces(); start[i] = cellCentres[own]; end[i] = neiCc[bFacei]; if (!isMasterFace[facei]) { Swap(start[i], end[i]); } minLevel[i] = min(cellLevel[own], neiLevel[bFacei]); } } // Extend segments a bit { const vectorField smallVec(rootSmall*(end-start)); start -= smallVec; end += smallVec; } // Test for all intersections (with surfaces of higher max level than // minLevel) and cache per cell the interesting inter labelListList cellSurfLevels(mesh_.nCells()); List cellSurfNormals(mesh_.nCells()); { // Per segment the normals of the surfaces List surfaceNormal; // Per segment the list of levels of the surfaces labelListList surfaceLevel; surfaces_.findAllHigherIntersections ( start, end, minLevel, // max level of surface has to be bigger // than min level of neighbouring cells surfaces_.maxLevel(), surfaceNormal, surfaceLevel ); // Sort the data according to surface location. This will guarantee // that on coupled faces both sides visit the intersections in // the same order so will decide the same labelList visitOrder; forAll(surfaceNormal, pointi) { vectorList& pNormals = surfaceNormal[pointi]; labelList& pLevel = surfaceLevel[pointi]; sortedOrder(pNormals, visitOrder, normalLess(pNormals)); pNormals = List(pNormals, visitOrder); pLevel = UIndirectList