File size: 10,893 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 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 | /*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Copyright (C) 2013-2025 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/>.
\*---------------------------------------------------------------------------*/
#include "nearestCellsToCells.H"
#include "pointIndexHit.H"
#include "meshSearch.H"
#include "addToRunTimeSelectionTable.H"
// * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //
namespace Foam
{
namespace cellsToCellss
{
defineTypeNameAndDebug(nearest, 0);
addToRunTimeSelectionTable(cellsToCells, nearest, word);
}
}
// * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * //
bool Foam::cellsToCellss::nearest::findInitialSeeds
(
const polyMesh& srcMesh,
const polyMesh& tgtMesh,
const labelList& srcCellIDs,
const boolList& mapFlag,
const label startSeedI,
label& srcSeedI,
label& tgtSeedI
) const
{
const vectorField& srcCcs = srcMesh.cellCentres();
const meshSearch& tgtSearchEngine = meshSearch::New(tgtMesh);
for (label i = startSeedI; i < srcCellIDs.size(); i++)
{
label srcI = srcCellIDs[i];
if (mapFlag[srcI])
{
const point& srcCc = srcCcs[srcI];
pointIndexHit hit =
tgtSearchEngine.cellTree().findNearest(srcCc, great);
if (hit.hit())
{
srcSeedI = srcI;
tgtSeedI = hit.index();
return true;
}
else
{
FatalErrorInFunction
<< "Unable to find nearest target cell"
<< " for source cell " << srcI
<< " with centre " << srcCc
<< abort(FatalError);
}
break;
}
}
if (debug)
{
Pout<< "could not find starting seed" << endl;
}
return false;
}
Foam::scalar Foam::cellsToCellss::nearest::calculateAddressing
(
const polyMesh& srcMesh,
const polyMesh& tgtMesh,
labelListList& srcToTgtCellAddr,
scalarListList& srcToTgtCellWght,
labelListList& tgtToSrcCellAddr,
scalarListList& tgtToSrcCellWght,
const label srcSeedI,
const label tgtSeedI,
const labelList& srcCellIDs,
boolList& mapFlag,
label& startSeedI
)
{
scalar V = 0;
List<DynamicList<label>> srcToTgt(srcMesh.nCells());
List<DynamicList<label>> tgtToSrc(tgtMesh.nCells());
const scalarField& srcVc = srcMesh.cellVolumes();
{
label srcCelli = srcSeedI;
label tgtCelli = tgtSeedI;
do
{
// find nearest tgt cell
findNearestCell(srcMesh, tgtMesh, srcCelli, tgtCelli);
// store src/tgt cell pair
srcToTgt[srcCelli].append(tgtCelli);
tgtToSrc[tgtCelli].append(srcCelli);
// mark source cell srcCelli and tgtCelli as matched
mapFlag[srcCelli] = false;
// accumulate intersection volume
V += srcVc[srcCelli];
// find new source cell
setNextNearestCells
(
srcMesh,
tgtMesh,
startSeedI,
srcCelli,
tgtCelli,
mapFlag,
srcCellIDs
);
}
while (srcCelli >= 0);
}
// for the case of multiple source cells per target cell, select the
// nearest source cell only and discard the others
const vectorField& srcCc = srcMesh.cellCentres();
const vectorField& tgtCc = tgtMesh.cellCentres();
forAll(tgtToSrc, targetCelli)
{
if (tgtToSrc[targetCelli].size() > 1)
{
const vector& tgtC = tgtCc[targetCelli];
DynamicList<label>& srcCells = tgtToSrc[targetCelli];
label srcCelli = srcCells[0];
scalar d = magSqr(tgtC - srcCc[srcCelli]);
for (label i = 1; i < srcCells.size(); i++)
{
label srcI = srcCells[i];
scalar dNew = magSqr(tgtC - srcCc[srcI]);
if (dNew < d)
{
d = dNew;
srcCelli = srcI;
}
}
srcCells.clear();
srcCells.append(srcCelli);
}
}
// If there are more target cells than source cells, some target cells
// might not yet be mapped
forAll(tgtToSrc, tgtCelli)
{
if (tgtToSrc[tgtCelli].empty())
{
label srcCelli =
findMappedSrcCell(srcMesh, tgtMesh, tgtCelli, tgtToSrc);
findNearestCell(tgtMesh, srcMesh, tgtCelli, srcCelli);
tgtToSrc[tgtCelli].append(srcCelli);
}
}
// transfer addressing into persistent storage
forAll(srcToTgtCellAddr, i)
{
srcToTgtCellWght[i] = scalarList(srcToTgt[i].size(), scalar(1));
srcToTgtCellAddr[i].transfer(srcToTgt[i]);
}
forAll(tgtToSrcCellAddr, i)
{
tgtToSrcCellWght[i] = scalarList(tgtToSrc[i].size(), scalar(1));
tgtToSrcCellAddr[i].transfer(tgtToSrc[i]);
}
return V;
}
void Foam::cellsToCellss::nearest::findNearestCell
(
const polyMesh& mesh1,
const polyMesh& mesh2,
const label cell1,
label& cell2
) const
{
const vectorField& Cc1 = mesh1.cellCentres();
const vectorField& Cc2 = mesh2.cellCentres();
const vector& p1 = Cc1[cell1];
DynamicList<label> cells2(10);
cells2.append(cell2);
DynamicList<label> visitedCells(10);
scalar d = great;
do
{
label c2 = cells2.remove();
visitedCells.append(c2);
scalar dTest = magSqr(Cc2[c2] - p1);
if (dTest < d)
{
cell2 = c2;
d = dTest;
appendNbrCells(cell2, mesh2, visitedCells, cells2);
}
} while (cells2.size() > 0);
}
void Foam::cellsToCellss::nearest::setNextNearestCells
(
const polyMesh& srcMesh,
const polyMesh& tgtMesh,
label& startSeedI,
label& srcCelli,
label& tgtCelli,
boolList& mapFlag,
const labelList& srcCellIDs
) const
{
const labelList& srcNbr = srcMesh.cellCells()[srcCelli];
srcCelli = -1;
forAll(srcNbr, i)
{
label celli = srcNbr[i];
if (mapFlag[celli])
{
srcCelli = celli;
return;
}
}
for (label i = startSeedI; i < srcCellIDs.size(); i++)
{
label celli = srcCellIDs[i];
if (mapFlag[celli])
{
startSeedI = i;
break;
}
}
findInitialSeeds
(
srcMesh,
tgtMesh,
srcCellIDs,
mapFlag,
startSeedI,
srcCelli,
tgtCelli
);
}
Foam::label Foam::cellsToCellss::nearest::findMappedSrcCell
(
const polyMesh& srcMesh,
const polyMesh& tgtMesh,
const label tgtCelli,
const List<DynamicList<label>>& tgtToSrc
) const
{
DynamicList<label> testCells(10);
DynamicList<label> visitedCells(10);
testCells.append(tgtCelli);
do
{
// search target tgtCelli neighbours for match with source cell
label tgtI = testCells.remove();
if (findIndex(visitedCells, tgtI) == -1)
{
visitedCells.append(tgtI);
if (tgtToSrc[tgtI].size())
{
return tgtToSrc[tgtI][0];
}
else
{
const labelList& nbrCells = tgtMesh.cellCells()[tgtI];
forAll(nbrCells, i)
{
if (findIndex(visitedCells, nbrCells[i]) == -1)
{
testCells.append(nbrCells[i]);
}
}
}
}
} while (testCells.size());
// did not find any match - should not be possible to get here!
return -1;
}
// * * * * * * * * * * * * Protected Member Functions * * * * * * * * * * * //
Foam::scalar Foam::cellsToCellss::nearest::calculate
(
const polyMesh& srcMesh,
const polyMesh& tgtMesh
)
{
initialise(srcMesh, tgtMesh);
// Determine (potentially) participating source mesh cells
const labelList srcCellIDs(maskCells(srcMesh, tgtMesh));
// Initialise list to keep track of whether src cell can be mapped
boolList mapFlag(srcMesh.nCells(), false);
UIndirectList<bool>(mapFlag, srcCellIDs) = true;
// Find initial point in tgt mesh
label srcSeedI = -1;
label tgtSeedI = -1;
label startSeedI = 0;
bool startWalk =
findInitialSeeds
(
srcMesh,
tgtMesh,
srcCellIDs,
mapFlag,
startSeedI,
srcSeedI,
tgtSeedI
);
if (startWalk)
{
return
calculateAddressing
(
srcMesh,
tgtMesh,
srcLocalTgtCells_,
srcWeights_,
tgtLocalSrcCells_,
tgtWeights_,
srcSeedI,
tgtSeedI,
srcCellIDs,
mapFlag,
startSeedI
);
}
else
{
return 0;
}
}
void Foam::cellsToCellss::nearest::normalise
(
const polyMesh& srcMesh,
labelListList& srcToTgtAddr,
scalarListList& srcToTgtWght
) const
{
forAll(srcToTgtWght, srcCelli)
{
if (srcToTgtWght[srcCelli].size() > 1)
{
srcToTgtAddr[srcCelli].resize(1);
srcToTgtWght[srcCelli].resize(1);
}
}
}
// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
Foam::cellsToCellss::nearest::nearest()
:
cellsToCells()
{}
// * * * * * * * * * * * * * * * * Destructor * * * * * * * * * * * * * * * //
Foam::cellsToCellss::nearest::~nearest()
{}
// ************************************************************************* //
|