Download data/applications/utilities/surface/surfaceToPatch/surfaceToPatch.C from introvoyz042/OpenFOAM-dev: direct link, hf CLI and curl.
- Browser
- Download file 8.33 kB
-
https://huggingface.co/datasets/introvoyz042/OpenFOAM-dev/resolve/main/data/applications/utilities/surface/surfaceToPatch/surfaceToPatch.C
- Command line
-
hf download hf://datasets/introvoyz042/OpenFOAM-dev/data/applications/utilities/surface/surfaceToPatch/surfaceToPatch.C
-
curl -L -o surfaceToPatch.C https://huggingface.co/datasets/introvoyz042/OpenFOAM-dev/resolve/main/data/applications/utilities/surface/surfaceToPatch/surfaceToPatch.C
8.33 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/>. | |
| Application | |
| surfaceToPatch | |
| Description | |
| Reads surface and applies surface regioning to a mesh. Uses repatchMesh | |
| to do the hard work. | |
| \*---------------------------------------------------------------------------*/ | |
| using namespace Foam; | |
| // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * // | |
| // Adds empty patch if not yet there. Returns patchID. | |
| label addPatch(polyMesh& mesh, const word& patchName) | |
| { | |
| label patchi = mesh.boundary().findIndex(patchName); | |
| if (patchi == -1) | |
| { | |
| const polyBoundaryMesh& patches = mesh.boundary(); | |
| List<polyPatch*> newPatches(patches.size() + 1); | |
| patchi = 0; | |
| // Copy all old patches | |
| forAll(patches, i) | |
| { | |
| const polyPatch& pp = patches[i]; | |
| newPatches[patchi] = | |
| pp.clone | |
| ( | |
| patches, | |
| patchi, | |
| pp.size(), | |
| pp.start() | |
| ).ptr(); | |
| patchi++; | |
| } | |
| // Add zero-sized patch | |
| newPatches[patchi] = | |
| new polyPatch | |
| ( | |
| patchName, | |
| 0, | |
| mesh.nFaces(), | |
| patchi, | |
| patches | |
| ); | |
| mesh.removeBoundary(); | |
| mesh.addPatches(newPatches); | |
| Pout<< "Created patch " << patchName << " at " << patchi << endl; | |
| } | |
| else | |
| { | |
| Pout<< "Reusing patch " << patchName << " at " << patchi << endl; | |
| } | |
| return patchi; | |
| } | |
| // Repatch single face. Return true if patch changed. | |
| bool repatchFace | |
| ( | |
| const polyMesh& mesh, | |
| const repatchMesh& rMesh, | |
| const labelList& nearest, | |
| const labelList& surfToMeshPatch, | |
| const label facei, | |
| polyTopoChange& meshMod | |
| ) | |
| { | |
| bool changed = false; | |
| label bFacei = facei - mesh.nInternalFaces(); | |
| if (nearest[bFacei] != -1) | |
| { | |
| // Use boundary mesh one. | |
| const label rMeshPatchID = rMesh.whichPatch(nearest[bFacei]); | |
| const label patchID = surfToMeshPatch[rMeshPatchID]; | |
| if (patchID != mesh.boundary().whichPatch(facei)) | |
| { | |
| const label own = mesh.faceOwner()[facei]; | |
| meshMod.modifyFace | |
| ( | |
| mesh.faces()[facei],// modified face | |
| facei, // label of face being modified | |
| own, // owner | |
| -1, // neighbour | |
| false, // face flip | |
| patchID // patch for face | |
| ); | |
| changed = true; | |
| } | |
| } | |
| else | |
| { | |
| changed = false; | |
| } | |
| return changed; | |
| } | |
| int main(int argc, char *argv[]) | |
| { | |
| argList::addNote | |
| ( | |
| "reads surface and applies surface regioning to a mesh" | |
| ); | |
| argList::noParallel(); | |
| argList::validArgs.append("surface file"); | |
| argList::addOption | |
| ( | |
| "faceSet", | |
| "name", | |
| "only repatch the faces in specified faceSet" | |
| ); | |
| argList::addOption | |
| ( | |
| "tol", | |
| "scalar", | |
| "search tolerance as fraction of mesh size (default 1e-3)" | |
| ); | |
| const fileName surfName = args[1]; | |
| Info<< "Reading surface from " << surfName << " ..." << endl; | |
| word setName; | |
| const bool readSet = args.optionReadIfPresent("faceSet", setName); | |
| if (readSet) | |
| { | |
| Info<< "Repatching only the faces in faceSet " << setName | |
| << " according to nearest surface triangle ..." << endl; | |
| } | |
| else | |
| { | |
| Info<< "Patching all boundary faces according to nearest surface" | |
| << " triangle ..." << endl; | |
| } | |
| const scalar searchTol = args.optionLookupOrDefault("tol", 1e-3); | |
| // Get search box. Anything not within this box will not be considered. | |
| const boundBox& meshBb = mesh.bounds(); | |
| const vector searchSpan = searchTol * meshBb.span(); | |
| Info<< "All boundary faces further away than " << searchTol | |
| << " of mesh bounding box " << meshBb | |
| << " will keep their patch label ..." << endl; | |
| Info<< "Before patching:" << nl | |
| << " patch\tsize" << endl; | |
| forAll(mesh.boundary(), patchi) | |
| { | |
| Info<< " " << mesh.boundary()[patchi].name() << '\t' | |
| << mesh.boundary()[patchi].size() << nl; | |
| } | |
| Info<< endl; | |
| repatchMesh rMesh; | |
| // Load in the surface. | |
| rMesh.readTriSurface(surfName); | |
| // Add all the boundaryMesh patches to the mesh. | |
| const PtrList<repatchPatch>& bPatches = rMesh.patches(); | |
| // Map from surface patch ( = boundaryMesh patch) to polyMesh patch | |
| labelList patchMap(bPatches.size()); | |
| forAll(bPatches, i) | |
| { | |
| patchMap[i] = addPatch(mesh, bPatches[i].name()); | |
| } | |
| // Obtain nearest face in rMesh for each boundary face in mesh that | |
| // is within search span. | |
| // Note: should only determine for faceSet if working with that. | |
| labelList nearest(rMesh.getNearest(mesh, searchSpan)); | |
| { | |
| // Dump unmatched faces to faceSet for debugging. | |
| faceSet unmatchedFaces(mesh, "unmatchedFaces", nearest.size()/100); | |
| forAll(nearest, bFacei) | |
| { | |
| if (nearest[bFacei] == -1) | |
| { | |
| unmatchedFaces.insert(mesh.nInternalFaces() + bFacei); | |
| } | |
| } | |
| Pout<< "Writing all " << unmatchedFaces.size() | |
| << " unmatched faces to faceSet " | |
| << unmatchedFaces.name() | |
| << endl; | |
| unmatchedFaces.write(); | |
| } | |
| polyTopoChange meshMod(mesh); | |
| label nChanged = 0; | |
| if (readSet) | |
| { | |
| faceSet faceLabels(mesh, setName); | |
| Info<< "Read " << faceLabels.size() << " faces to repatch ..." << endl; | |
| forAllConstIter(faceSet, faceLabels, iter) | |
| { | |
| label facei = iter.key(); | |
| if (repatchFace(mesh, rMesh, nearest, patchMap, facei, meshMod)) | |
| { | |
| nChanged++; | |
| } | |
| } | |
| } | |
| else | |
| { | |
| forAll(nearest, bFacei) | |
| { | |
| label facei = mesh.nInternalFaces() + bFacei; | |
| if (repatchFace(mesh, rMesh, nearest, patchMap, facei, meshMod)) | |
| { | |
| nChanged++; | |
| } | |
| } | |
| } | |
| Pout<< "Changed " << nChanged << " boundary faces." << nl << endl; | |
| if (nChanged > 0) | |
| { | |
| meshMod.changeMesh(mesh); | |
| Info<< "After patching:" << nl | |
| << " patch\tsize" << endl; | |
| forAll(mesh.boundary(), patchi) | |
| { | |
| Info<< " " << mesh.boundary()[patchi].name() << '\t' | |
| << mesh.boundary()[patchi].size() << endl; | |
| } | |
| Info<< endl; | |
| runTime++; | |
| // Write resulting mesh | |
| Info<< "Writing modified mesh to time " | |
| << runTime.userTimeName() << endl; | |
| mesh.write(); | |
| } | |
| Info<< "End\n" << endl; | |
| return 0; | |
| } | |
| // ************************************************************************* // | |