File size: 10,135 Bytes
5a600cf | 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 | /*---------------------------------------------------------------------------*\
========= |
\\ / 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/>.
Description
Best thing is probably to look at attachDetach which does almost exactly
the same but for the geometric matching of points and face centres.
\*---------------------------------------------------------------------------*/
#include "perfectInterface.H"
#include "polyMesh.H"
#include "polyTopoChange.H"
#include "matchPoints.H"
#include "addToRunTimeSelectionTable.H"
// * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //
namespace Foam
{
defineTypeNameAndDebug(perfectInterface, 0);
}
const Foam::scalar Foam::perfectInterface::tol_ = 1e-3;
// * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * //
Foam::pointField Foam::perfectInterface::calcFaceCentres
(
const indirectPrimitivePatch& pp
)
{
const pointField& points = pp.points();
pointField ctrs(pp.size());
forAll(ctrs, patchFacei)
{
ctrs[patchFacei] = pp[patchFacei].centre(points);
}
return ctrs;
}
// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
Foam::perfectInterface::perfectInterface
(
const word& name,
const polyMesh& mesh,
const word& masterPatchName,
const word& slavePatchName
)
:
mesh_(mesh),
masterPatchIndex_(mesh_.boundary().findIndex(masterPatchName)),
slavePatchIndex_(mesh_.boundary().findIndex(slavePatchName))
{}
// * * * * * * * * * * * * * * * * Destructor * * * * * * * * * * * * * * * //
Foam::perfectInterface::~perfectInterface()
{}
// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
void Foam::perfectInterface::setRefinement
(
const indirectPrimitivePatch& pp0,
const indirectPrimitivePatch& pp1,
polyTopoChange& ref
) const
{
const polyBoundaryMesh& patches = mesh_.boundary();
// Some aliases
const edgeList& edges0 = pp0.edges();
const pointField& pts0 = pp0.localPoints();
const pointField& pts1 = pp1.localPoints();
const labelList& meshPts0 = pp0.meshPoints();
const labelList& meshPts1 = pp1.meshPoints();
// Get local dimension as fraction of minimum edge length
scalar minLen = great;
forAll(edges0, edgeI)
{
minLen = min(minLen, edges0[edgeI].mag(pts0));
}
scalar typDim = tol_*minLen;
if (debug)
{
Pout<< "typDim:" << typDim << " edges0:" << edges0.size()
<< " pts0:" << pts0.size() << " pts1:" << pts1.size()
<< " pp0:" << pp0.size() << " pp1:" << pp1.size() << endl;
}
// Determine pointMapping in mesh point labels. Uses geometric
// comparison to find correspondence between patch points.
labelList renumberPoints(mesh_.points().size());
forAll(renumberPoints, i)
{
renumberPoints[i] = i;
}
{
labelList from1To0Points(pts1.size());
const bool matchOk = matchPoints
(
pts1,
pts0,
scalarField(pts1.size(), typDim), // tolerance
true, // verbose
from1To0Points
);
if (!matchOk)
{
FatalErrorInFunction
<< "Points on patch sides do not match to within tolerance "
<< typDim << exit(FatalError);
}
forAll(pts1, i)
{
renumberPoints[meshPts1[i]] = meshPts0[from1To0Points[i]];
}
}
// Calculate correspondence between patch faces
labelList from0To1Faces(pp1.size());
const bool matchOk = matchPoints
(
calcFaceCentres(pp0),
calcFaceCentres(pp1),
scalarField(pp0.size(), typDim), // tolerance
true, // verbose
from0To1Faces
);
if (!matchOk)
{
FatalErrorInFunction
<< "Face centres of patch sides do not match to within tolerance "
<< typDim << exit(FatalError);
}
// Now
// - renumber faces using pts1 (except patch1 faces)
// - remove patch1 faces. Remember cell label on owner side.
// - modify patch0 faces to be internal.
// 1. Get faces to be renumbered
labelHashSet affectedFaces(2*pp1.size());
forAll(meshPts1, i)
{
const label meshPointi = meshPts1[i];
if (meshPointi != renumberPoints[meshPointi])
{
const labelList& pFaces = mesh_.pointFaces()[meshPointi];
forAll(pFaces, pFacei)
{
affectedFaces.insert(pFaces[pFacei]);
}
}
}
forAll(pp1, i)
{
affectedFaces.erase(pp1.addressing()[i]);
}
// Remove patch0 from renumbered faces. Should not be necessary since
// patch0 and 1 should not share any point (if created by mergeMeshing)
// so affectedFaces should not contain any patch0 faces but you can
// never be sure what the user is doing.
forAll(pp0, i)
{
const label facei = pp0.addressing()[i];
if (affectedFaces.erase(facei))
{
WarningInFunction
<< "Found face " << facei << " vertices "
<< mesh_.faces()[facei] << " whose points are"
<< " used both by master patch and slave patch" << endl;
}
}
// 2. Renumber (non patch0/1) faces.
forAllConstIter(labelHashSet, affectedFaces, iter)
{
const label facei = iter.key();
const face& f = mesh_.faces()[facei];
face newFace(f.size());
forAll(newFace, fp)
{
newFace[fp] = renumberPoints[f[fp]];
}
label nbr = -1;
label patchi = -1;
if (mesh_.isInternalFace(facei))
{
nbr = mesh_.faceNeighbour()[facei];
}
else
{
patchi = patches.whichPatch(facei);
}
ref.modifyFace
(
newFace, // modified face
facei, // label of face being modified
mesh_.faceOwner()[facei], // owner
nbr, // neighbour
false, // face flip
patchi // patch for face
);
}
// 3. Remove patch1 points
forAll(meshPts1, i)
{
const label meshPointi = meshPts1[i];
if (meshPointi != renumberPoints[meshPointi])
{
ref.removePoint(meshPointi, -1);
}
}
// 4. Remove patch1 faces
forAll(pp1, i)
{
const label facei = pp1.addressing()[i];
ref.removeFace(facei, -1);
}
// 5. Modify patch0 faces for new points (not really necessary; see
// comment above about patch1 and patch0 never sharing points) and
// becoming internal.
forAll(pp0, i)
{
const label facei = pp0.addressing()[i];
const face& f = mesh_.faces()[facei];
face newFace(f.size());
forAll(newFace, fp)
{
newFace[fp] = renumberPoints[f[fp]];
}
const label own = mesh_.faceOwner()[facei];
const label pp1Facei = pp1.addressing()[from0To1Faces[i]];
const label nbr = mesh_.faceOwner()[pp1Facei];
if (own < nbr)
{
ref.modifyFace
(
newFace, // modified face
facei, // label of face being modified
own, // owner
nbr, // neighbour
false, // face flip
-1 // patch for face
);
}
else
{
ref.modifyFace
(
newFace.reverseFace(), // modified face
facei, // label of face being modified
nbr, // owner
own, // neighbour
true, // face flip
-1 // patch for face
);
}
}
}
void Foam::perfectInterface::setRefinement(polyTopoChange& ref) const
{
if (debug)
{
Pout<< "bool perfectInterface::setRefinement(polyTopoChange&) const : "
<< "masterPatchIndex_:" << masterPatchIndex_
<< " slavePatchIndex_:" << slavePatchIndex_ << endl;
}
const polyBoundaryMesh& patches = mesh_.boundary();
const polyPatch& patch0 = patches[masterPatchIndex_];
const polyPatch& patch1 = patches[slavePatchIndex_];
labelList pp0Labels(identityMap(patch0.start(), patch0.size()));
indirectPrimitivePatch pp0
(
IndirectList<face>(mesh_.faces(), pp0Labels),
mesh_.points()
);
labelList pp1Labels(identityMap(patch1.start(), patch1.size()));
indirectPrimitivePatch pp1
(
IndirectList<face>(mesh_.faces(), pp1Labels),
mesh_.points()
);
setRefinement(pp0, pp1, ref);
}
// ************************************************************************* //
|