Download data/src/sampling/sampledSurface/sampledTriSurface/sampledTriSurface.C from introvoyz042/OpenFOAM-dev: direct link, hf CLI and curl.
- Browser
- Download file 19.8 kB
-
https://huggingface.co/datasets/introvoyz042/OpenFOAM-dev/resolve/main/data/src/sampling/sampledSurface/sampledTriSurface/sampledTriSurface.C
- Command line
-
hf download hf://datasets/introvoyz042/OpenFOAM-dev/data/src/sampling/sampledSurface/sampledTriSurface/sampledTriSurface.C
-
curl -L -o sampledTriSurface.C https://huggingface.co/datasets/introvoyz042/OpenFOAM-dev/resolve/main/data/src/sampling/sampledSurface/sampledTriSurface/sampledTriSurface.C
19.8 kB
| /*---------------------------------------------------------------------------*\ | |
| ========= | | |
| \\ / 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 <http://www.gnu.org/licenses/>. | |
| \*---------------------------------------------------------------------------*/ | |
| // * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * // | |
| namespace Foam | |
| { | |
| namespace sampledSurfaces | |
| { | |
| defineTypeNameAndDebug(triSurface, 0); | |
| addToRunTimeSelectionTable | |
| ( | |
| sampledSurface, | |
| triSurface, | |
| word | |
| ); | |
| addBackwardCompatibleToRunTimeSelectionTable | |
| ( | |
| sampledSurface, | |
| triSurface, | |
| word, | |
| triSurfaceMesh, | |
| "triSurfaceMesh" | |
| ); | |
| //- Private class for finding nearest | |
| // Comprising: | |
| // - global index | |
| // - sqr(distance) | |
| typedef Tuple2<scalar, label> nearInfo; | |
| class nearestEqOp | |
| { | |
| public: | |
| void operator()(nearInfo& x, const nearInfo& y) const | |
| { | |
| if (y.first() < x.first()) | |
| { | |
| x = y; | |
| } | |
| } | |
| }; | |
| } | |
| } | |
| const Foam::NamedEnum | |
| < | |
| Foam::sampledSurfaces::triSurface::samplingSource, | |
| 3 | |
| > Foam::sampledSurfaces::triSurface::samplingSourceNames_ | |
| { | |
| "cells", | |
| "insideCells", | |
| "boundaryFaces" | |
| }; | |
| // * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * // | |
| const Foam::indexedOctree<Foam::treeDataFace>& | |
| Foam::sampledSurfaces::triSurface::nonCoupledboundaryTree() const | |
| { | |
| // Variant of meshBoundarySearch::boundaryTree() that only does non-coupled | |
| // boundary faces. | |
| if (!boundaryTreePtr_.valid()) | |
| { | |
| // all non-coupled boundary faces (not just walls) | |
| const polyBoundaryMesh& patches = mesh().boundary(); | |
| labelList bndFaces(mesh().nFaces()-mesh().nInternalFaces()); | |
| label bndI = 0; | |
| forAll(patches, patchi) | |
| { | |
| const polyPatch& pp = patches[patchi]; | |
| if (!pp.coupled()) | |
| { | |
| forAll(pp, i) | |
| { | |
| bndFaces[bndI++] = pp.start()+i; | |
| } | |
| } | |
| } | |
| bndFaces.setSize(bndI); | |
| treeBoundBox overallBb(mesh().points()); | |
| overallBb = overallBb.extend(1e-4); | |
| boundaryTreePtr_.reset | |
| ( | |
| new indexedOctree<treeDataFace> | |
| ( | |
| treeDataFace // all information needed to search faces | |
| ( | |
| false, // do not cache bb | |
| mesh(), | |
| bndFaces // boundary faces only | |
| ), | |
| overallBb, // overall search domain | |
| 8, // maxLevel | |
| 10, // leafsize | |
| 3.0 // duplicity | |
| ) | |
| ); | |
| } | |
| return boundaryTreePtr_(); | |
| } | |
| // * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * // | |
| Foam::sampledSurfaces::triSurface::triSurface | |
| ( | |
| const word& name, | |
| const polyMesh& mesh, | |
| const word& surfaceName, | |
| const samplingSource sampleSource | |
| ) | |
| : | |
| sampledSurface(name, mesh), | |
| surface_ | |
| ( | |
| IOobject | |
| ( | |
| surfaceName, | |
| mesh.time().constant(), | |
| searchableSurface::geometryDir(mesh.time()), | |
| mesh, | |
| IOobject::MUST_READ, | |
| IOobject::NO_WRITE, | |
| false | |
| ) | |
| ), | |
| sampleSource_(sampleSource), | |
| needsUpdate_(true), | |
| sampleElements_(0), | |
| samplePoints_(0) | |
| {} | |
| Foam::sampledSurfaces::triSurface::triSurface | |
| ( | |
| const word& name, | |
| const polyMesh& mesh, | |
| const dictionary& dict | |
| ) | |
| : | |
| sampledSurface(name, mesh, dict), | |
| surface_ | |
| ( | |
| IOobject | |
| ( | |
| dict.lookup("surface"), | |
| mesh.time().constant(), | |
| searchableSurface::geometryDir(mesh.time()), | |
| mesh, | |
| IOobject::MUST_READ, | |
| IOobject::NO_WRITE, | |
| false | |
| ) | |
| ), | |
| sampleSource_(samplingSourceNames_[dict.lookup("source")]), | |
| needsUpdate_(true), | |
| sampleElements_(0), | |
| samplePoints_(0) | |
| {} | |
| Foam::sampledSurfaces::triSurface::triSurface | |
| ( | |
| const word& name, | |
| const polyMesh& mesh, | |
| const Foam::triSurface& surface, | |
| const word& sampleSourceName | |
| ) | |
| : | |
| sampledSurface(name, mesh), | |
| surface_ | |
| ( | |
| IOobject | |
| ( | |
| name, | |
| mesh.time().constant(), | |
| searchableSurface::geometryDir(mesh.time()), | |
| mesh, | |
| IOobject::NO_READ, | |
| IOobject::NO_WRITE, | |
| false | |
| ), | |
| surface | |
| ), | |
| sampleSource_(samplingSourceNames_[sampleSourceName]), | |
| needsUpdate_(true), | |
| sampleElements_(0), | |
| samplePoints_(0) | |
| {} | |
| // * * * * * * * * * * * * * * * * Destructor * * * * * * * * * * * * * * * // | |
| Foam::sampledSurfaces::triSurface::~triSurface() | |
| {} | |
| // * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * // | |
| bool Foam::sampledSurfaces::triSurface::needsUpdate() const | |
| { | |
| return needsUpdate_; | |
| } | |
| bool Foam::sampledSurfaces::triSurface::update() | |
| { | |
| if (!needsUpdate_) | |
| { | |
| return false; | |
| } | |
| // Find the cells the triangles of the surface are in. | |
| // Does approximation by looking at the face centres only | |
| const pointField& fc = surface_.faceCentres(); | |
| List<nearInfo> nearest(fc.size()); | |
| // Global numbering for cells/faces - only used to uniquely identify local | |
| // elements | |
| globalIndex globalCells | |
| ( | |
| (sampleSource_ == cells || sampleSource_ == insideCells) | |
| ? mesh().nCells() | |
| : mesh().nFaces() | |
| ); | |
| forAll(nearest, i) | |
| { | |
| nearest[i].first() = great; | |
| nearest[i].second() = labelMax; | |
| } | |
| if (sampleSource_ == cells) | |
| { | |
| // Search for nearest cell | |
| const indexedOctree<treeDataCell>& cellTree = | |
| meshSearch::New(mesh(), pointInCellShapes::facePlanes).cellTree(); | |
| forAll(fc, triI) | |
| { | |
| pointIndexHit nearInfo = | |
| cellTree.findNearest(fc[triI], sqr(great)); | |
| if (nearInfo.hit()) | |
| { | |
| nearest[triI].first() = magSqr(nearInfo.hitPoint()-fc[triI]); | |
| nearest[triI].second() = globalCells.toGlobal(nearInfo.index()); | |
| } | |
| } | |
| } | |
| else if (sampleSource_ == insideCells) | |
| { | |
| // Search for cell containing point | |
| const indexedOctree<treeDataCell>& cellTree = | |
| meshSearch::New(mesh(), pointInCellShapes::facePlanes).cellTree(); | |
| forAll(fc, triI) | |
| { | |
| if (cellTree.bb().contains(fc[triI])) | |
| { | |
| label index = | |
| cellTree.findInside | |
| ( | |
| fc[triI], | |
| pointInCellShapes::facePlanes | |
| ); | |
| if (index != -1) | |
| { | |
| nearest[triI].first() = 0.0; | |
| nearest[triI].second() = globalCells.toGlobal(index); | |
| } | |
| } | |
| } | |
| } | |
| else | |
| { | |
| // Search on all non-coupled boundary faces | |
| const indexedOctree<treeDataFace>& bTree = nonCoupledboundaryTree(); | |
| forAll(fc, triI) | |
| { | |
| pointIndexHit nearInfo = bTree.findNearest | |
| ( | |
| fc[triI], | |
| sqr(great) | |
| ); | |
| if (nearInfo.hit()) | |
| { | |
| nearest[triI].first() = magSqr(nearInfo.hitPoint()-fc[triI]); | |
| nearest[triI].second() = globalCells.toGlobal | |
| ( | |
| bTree.shapes().faceLabels()[nearInfo.index()] | |
| ); | |
| } | |
| } | |
| } | |
| // See which processor has the nearest. Mark and subset | |
| // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | |
| Pstream::listCombineGather(nearest, nearestEqOp()); | |
| Pstream::listCombineScatter(nearest); | |
| labelList cellOrFaceLabels(fc.size(), -1); | |
| label nFound = 0; | |
| forAll(nearest, triI) | |
| { | |
| if (nearest[triI].second() == labelMax) | |
| { | |
| // Not found on any processor. How to map? | |
| } | |
| else if (globalCells.isLocal(nearest[triI].second())) | |
| { | |
| cellOrFaceLabels[triI] = globalCells.toLocal | |
| ( | |
| nearest[triI].second() | |
| ); | |
| nFound++; | |
| } | |
| } | |
| if (debug) | |
| { | |
| Pout<< "Local out of faces:" << cellOrFaceLabels.size() | |
| << " keeping:" << nFound << endl; | |
| } | |
| // Now subset the surface. Do not use triSurface::subsetMesh since requires | |
| // original surface to be in compact numbering. | |
| const Foam::triSurface& s = surface_; | |
| // Compact to original triangle | |
| labelList faceMap(s.size()); | |
| // Compact to original points | |
| labelList pointMap(s.points().size()); | |
| // From original point to compact points | |
| labelList reversePointMap(s.points().size(), -1); | |
| { | |
| label newPointi = 0; | |
| label newFacei = 0; | |
| forAll(s, facei) | |
| { | |
| if (cellOrFaceLabels[facei] != -1) | |
| { | |
| faceMap[newFacei++] = facei; | |
| const triSurface::FaceType& f = s[facei]; | |
| forAll(f, fp) | |
| { | |
| if (reversePointMap[f[fp]] == -1) | |
| { | |
| pointMap[newPointi] = f[fp]; | |
| reversePointMap[f[fp]] = newPointi++; | |
| } | |
| } | |
| } | |
| } | |
| faceMap.setSize(newFacei); | |
| pointMap.setSize(newPointi); | |
| } | |
| // Subset cellOrFaceLabels | |
| cellOrFaceLabels = UIndirectList<label>(cellOrFaceLabels, faceMap)(); | |
| // Store any face per point (without using pointFaces()) | |
| labelList pointToFace(pointMap.size()); | |
| // Create faces and points for subsetted surface | |
| faceList& faces = this->storedFaces(); | |
| faces.setSize(faceMap.size()); | |
| forAll(faceMap, i) | |
| { | |
| const triFace& f = s[faceMap[i]]; | |
| triFace newF | |
| ( | |
| reversePointMap[f[0]], | |
| reversePointMap[f[1]], | |
| reversePointMap[f[2]] | |
| ); | |
| faces[i] = newF.triFaceFace(); | |
| forAll(newF, fp) | |
| { | |
| pointToFace[newF[fp]] = i; | |
| } | |
| } | |
| this->storedPoints() = pointField(s.points(), pointMap); | |
| if (debug) | |
| { | |
| print(Pout); | |
| Pout<< endl; | |
| } | |
| // Collect the samplePoints and sampleElements | |
| // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | |
| if (sampledSurface::interpolate()) | |
| { | |
| samplePoints_.setSize(pointMap.size()); | |
| sampleElements_.setSize(pointMap.size(), -1); | |
| if (sampleSource_ == cells) | |
| { | |
| // samplePoints_ : per surface point a location inside the cell | |
| // sampleElements_ : per surface point the cell | |
| forAll(points(), pointi) | |
| { | |
| const point& pt = points()[pointi]; | |
| label celli = cellOrFaceLabels[pointToFace[pointi]]; | |
| sampleElements_[pointi] = celli; | |
| // Check if point inside cell | |
| if (pointInCellFacePlanes(pt, mesh(), sampleElements_[pointi])) | |
| { | |
| samplePoints_[pointi] = pt; | |
| } | |
| else | |
| { | |
| // Find nearest point on faces of cell | |
| const cell& cFaces = mesh().cells()[celli]; | |
| scalar minDistSqr = vGreat; | |
| forAll(cFaces, i) | |
| { | |
| const face& f = mesh().faces()[cFaces[i]]; | |
| pointHit info = f.nearestPoint(pt, mesh().points()); | |
| if (info.distance() < minDistSqr) | |
| { | |
| minDistSqr = info.distance(); | |
| samplePoints_[pointi] = info.rawPoint(); | |
| } | |
| } | |
| } | |
| } | |
| } | |
| else if (sampleSource_ == insideCells) | |
| { | |
| // samplePoints_ : per surface point a location inside the cell | |
| // sampleElements_ : per surface point the cell | |
| forAll(points(), pointi) | |
| { | |
| const point& pt = points()[pointi]; | |
| label celli = cellOrFaceLabels[pointToFace[pointi]]; | |
| sampleElements_[pointi] = celli; | |
| samplePoints_[pointi] = pt; | |
| } | |
| } | |
| else | |
| { | |
| // samplePoints_ : per surface point a location on the boundary | |
| // sampleElements_ : per surface point the boundary face containing | |
| // the location | |
| forAll(points(), pointi) | |
| { | |
| const point& pt = points()[pointi]; | |
| label facei = cellOrFaceLabels[pointToFace[pointi]]; | |
| sampleElements_[pointi] = facei; | |
| samplePoints_[pointi] = mesh().faces()[facei].nearestPoint | |
| ( | |
| pt, | |
| mesh().points() | |
| ).rawPoint(); | |
| } | |
| } | |
| } | |
| else | |
| { | |
| // if sampleSource_ == cells: | |
| // samplePoints_ : n/a | |
| // sampleElements_ : per surface triangle the cell | |
| // if sampleSource_ == insideCells: | |
| // samplePoints_ : n/a | |
| // sampleElements_ : -1 or per surface triangle the cell | |
| // else: | |
| // samplePoints_ : n/a | |
| // sampleElements_ : per surface triangle the boundary face | |
| samplePoints_.clear(); | |
| sampleElements_.transfer(cellOrFaceLabels); | |
| } | |
| if (debug) | |
| { | |
| this->clearOut(); | |
| OBJstream str(mesh().time().path()/"surfaceToMesh.obj"); | |
| Info<< "Dumping correspondence from local surface (points or faces)" | |
| << " to mesh (cells or faces) to " << str.name() << endl; | |
| if (sampledSurface::interpolate()) | |
| { | |
| if (sampleSource_ == cells || sampleSource_ == insideCells) | |
| { | |
| forAll(samplePoints_, pointi) | |
| { | |
| const label celli = sampleElements_[pointi]; | |
| str.write | |
| ( | |
| triPointRef | |
| ( | |
| points()[pointi], | |
| samplePoints_[pointi], | |
| mesh().cellCentres()[celli] | |
| ) | |
| ); | |
| } | |
| } | |
| else | |
| { | |
| forAll(samplePoints_, pointi) | |
| { | |
| const label facei = sampleElements_[pointi]; | |
| str.write | |
| ( | |
| triPointRef | |
| ( | |
| points()[pointi], | |
| samplePoints_[pointi], | |
| mesh().faceCentres()[facei] | |
| ) | |
| ); | |
| } | |
| } | |
| } | |
| else | |
| { | |
| if (sampleSource_ == cells || sampleSource_ == insideCells) | |
| { | |
| forAll(sampleElements_, triI) | |
| { | |
| const label celli = sampleElements_[triI]; | |
| str.write | |
| ( | |
| linePointRef | |
| ( | |
| faceCentres()[triI], | |
| mesh().cellCentres()[celli] | |
| ) | |
| ); | |
| } | |
| } | |
| else | |
| { | |
| forAll(sampleElements_, triI) | |
| { | |
| const label facei = sampleElements_[triI]; | |
| str.write | |
| ( | |
| linePointRef | |
| ( | |
| faceCentres()[triI], | |
| mesh().faceCentres()[facei] | |
| ) | |
| ); | |
| } | |
| } | |
| } | |
| } | |
| needsUpdate_ = false; | |
| return true; | |
| } | |
| FOR_ALL_FIELD_TYPES(IMPLEMENT_SAMPLE); | |
| FOR_ALL_FIELD_TYPES(IMPLEMENT_INTERPOLATE); | |
| void Foam::sampledSurfaces::triSurface::movePoints() | |
| { | |
| sampledSurface::clearGeom(); | |
| MeshedSurface<face>::clear(); | |
| boundaryTreePtr_.clear(); | |
| sampleElements_.clear(); | |
| samplePoints_.clear(); | |
| needsUpdate_ = true; | |
| } | |
| void Foam::sampledSurfaces::triSurface::topoChange(const polyTopoChangeMap&) | |
| { | |
| movePoints(); | |
| } | |
| void Foam::sampledSurfaces::triSurface::mapMesh(const polyMeshMap&) | |
| { | |
| movePoints(); | |
| } | |
| void Foam::sampledSurfaces::triSurface::distribute(const polyDistributionMap&) | |
| { | |
| movePoints(); | |
| } | |
| void Foam::sampledSurfaces::triSurface::print(Ostream& os) const | |
| { | |
| os << "triSurface: " << name() << " :" | |
| << " surface:" << surface_.objectRegistry::name() | |
| << " faces:" << faces().size() | |
| << " points:" << points().size(); | |
| } | |
| // ************************************************************************* // | |