/*---------------------------------------------------------------------------*\ ========= | \\ / 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 "MapLagrangianFields.H" #include "passiveParticleCloud.H" #include "meshBoundarySearch.H" #include "OSspecific.H" // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * // namespace Foam { static const scalar perturbFactor = 1e-6; static label findCell ( const meshSearch& searchEngine, const meshBoundarySearch& boundarySearchEngine, const lagrangian::Cloud& cloud, const point& pt ) { const polyMesh& mesh = cloud.pMesh(); // Standard search for the cell that contains the point const label celli = searchEngine.findCell(pt); if (celli >= 0) { return celli; } // See if the particle is on a boundary face by finding the nearest // boundary face and shifting the particle slightly into the owner cell // before doing the standard search again const label facei = boundarySearchEngine.findNearestBoundaryFace(pt); if (facei >= 0) { const point& cc = mesh.cellCentres()[mesh.faceOwner()[facei]]; const point perturbPt = (1 - perturbFactor)*pt + perturbFactor*cc; return searchEngine.findCell(perturbPt); } return -1; } void mapLagrangian(const meshToMesh0& meshToMesh0Interp) { // Determine which particles are in meshTarget // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ // target to source cell map const labelList& cellAddressing = meshToMesh0Interp.cellAddressing(); // Invert celladdressing to get source to target(s). // Note: could use sparse addressing but that is too storage inefficient // (Map) labelListList sourceToTargets ( invertOneToMany(meshToMesh0Interp.fromMesh().nCells(), cellAddressing) ); const fvMesh& meshSource = meshToMesh0Interp.fromMesh(); const fvMesh& meshTarget = meshToMesh0Interp.toMesh(); const meshSearch& targetInternalSearchEngine = meshSearch::New(meshTarget); const meshBoundarySearch& targetBoundarySearchEngine = meshBoundarySearch::New(meshTarget); word baseDir(meshSource.time().timePath()); if (meshSource.name() != fvMesh::defaultRegion) { baseDir = baseDir/meshSource.name(); } fileNameList cloudDirs ( readDir ( baseDir/lagrangian::cloud::prefix, fileType::directory ) ); forAll(cloudDirs, cloudI) { // Search for list of lagrangian objects for this time IOobjectList objects ( meshSource, meshSource.time().name(), lagrangian::cloud::prefix/cloudDirs[cloudI] ); IOobject* positionsPtr = objects.lookup("positions"); if (positionsPtr) { Info<< nl << " processing cloud " << cloudDirs[cloudI] << endl; // Read positions & cell passiveParticleCloud sourceParcels ( meshSource, cloudDirs[cloudI], false ); Info<< " read " << sourceParcels.size() << " parcels from source mesh." << endl; // Construct empty target cloud passiveParticleCloud targetParcels ( meshTarget, cloudDirs[cloudI], IDLList() ); passiveParticle::trackingData td(targetParcels); label sourceParticleI = 0; // Indices of source particles that get added to targetParcels DynamicList