File size: 24,473 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 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 | /*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Copyright (C) 2022-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/>.
\*---------------------------------------------------------------------------*/
#include "patchCutPlot.H"
#include "cutPolyIntegral.H"
#include "OSspecific.H"
#include "setWriter.H"
#include "SubField.H"
#include "volFields.H"
#include "writeFile.H"
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
namespace Foam
{
namespace patchCutPlot
{
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
List<weight> calcNonInterpolatingWeights
(
const faceList& faces,
const UList<vector>& faceAreas,
const UList<vector>& faceNormals,
const pointField& points,
const scalarField& pointXs,
const scalarField& faceMinXs,
const scalarField& faceMaxXs,
const labelList& faceMinOrder,
const scalarField& cutXs,
const bool normalise
)
{
// Generate weights for each face in turn
DynamicList<weight> dynWeights(faces.size()*2);
label cuti = 0;
forAll(faceMinOrder, i)
{
const label facei = faceMinOrder[i];
const scalar a = faceAreas[facei] & faceNormals[facei];
// Find the next relevant cut
while
(
cuti < cutXs.size() - 1
&& faceMinXs[facei] > cutXs[cuti + 1]
)
{
cuti ++;
}
// Loop over all relevant cut intervals
label cutj = cuti;
while
(
cutj < cutXs.size() - 1
&& faceMaxXs[facei] > cutXs[cutj]
)
{
// Add a new weight
dynWeights.append({facei, cutj, a});
// Left interval
if (faceMinXs[facei] < cutXs[cutj])
{
dynWeights.last().value -=
cutPoly::faceCutArea
(
faces[facei],
faceAreas[facei],
cutPoly::faceCuts
(
faces[facei],
pointXs,
cutXs[cutj]
),
points,
pointXs,
cutXs[cutj],
true
) & faceNormals[facei];
}
// Right interval
if (faceMaxXs[facei] > cutXs[cutj + 1])
{
dynWeights.last().value -=
cutPoly::faceCutArea
(
faces[facei],
faceAreas[facei],
cutPoly::faceCuts
(
faces[facei],
pointXs,
cutXs[cutj + 1]
),
points,
pointXs,
cutXs[cutj + 1],
false
) & faceNormals[facei];
}
cutj ++;
}
}
// Transfer to non-dynamic storage
List<weight> weights;
weights.transfer(dynWeights);
// Normalise, if requested
if (normalise)
{
scalarField cutWeightSums(cutXs.size() - 1, scalar(0));
forAll(weights, weighti)
{
cutWeightSums[weights[weighti].cuti] += weights[weighti].value;
}
Pstream::listCombineGather(cutWeightSums, addEqOp());
Pstream::listCombineScatter(cutWeightSums);
forAll(weights, weighti)
{
weights[weighti].value /=
(cutWeightSums[weights[weighti].cuti] + vSmall);
}
}
return weights;
}
List<weight> calcInterpolatingWeights
(
const faceList& faces,
const UList<vector>& faceAreas,
const UList<vector>& faceNormals,
const pointField& points,
const scalarField& pointXs,
const scalarField& faceMinXs,
const scalarField& faceMaxXs,
const labelList& faceMinOrder,
const scalarField& cutXs,
const bool normalise
)
{
// Values of the (piecewise linear) interpolation basis function. Different
// for every interval. Is constantly being set on a sub-set of the
// currently relevant points in the loop below.
scalarField pointFs(points.size(), scalar(0));
// Generate weights for each face in turn
DynamicList<weight> dynWeights(faces.size()*2);
label cuti = 0;
forAll(faceMinOrder, i)
{
const label facei = faceMinOrder[i];
const scalar a = faceAreas[facei] & faceNormals[facei];
// Find the next relevant cut
while
(
cuti < cutXs.size()
&& faceMinXs[facei] > cutXs[cuti + 1]
)
{
cuti ++;
}
// Loop over all relevant cuts
label cutj = cuti;
while
(
cutj < cutXs.size()
&& faceMaxXs[facei] > cutXs[max(cutj - 1, 0)]
)
{
// Add a new weight
dynWeights.append({facei, cutj, 0});
// Left interval
if (cutj > 0 && faceMinXs[facei] < cutXs[cutj])
{
// Update the basis function on the relevant points and
// calculate the area-average value on the face
forAll(faces[facei], facePointi)
{
const label pointi = faces[facei][facePointi];
pointFs[pointi] =
(pointXs[pointi] - cutXs[cutj - 1])
/(cutXs[cutj] - cutXs[cutj - 1]);
}
const scalar faceF =
cutPoly::faceAreaAverage
(
faces[facei],
points,
pointFs
).second();
// Add the whole face's contribution
dynWeights.last().value += faceF*a;
// Cut off anything before the left point
if (faceMinXs[facei] < cutXs[cutj - 1])
{
dynWeights.last().value -=
cutPoly::faceCutAreaIntegral
(
faces[facei],
faceAreas[facei],
faceF,
cutPoly::faceCuts
(
faces[facei],
pointXs,
cutXs[cutj - 1]
),
points,
pointFs,
pointXs,
cutXs[cutj - 1],
true
).second() & faceNormals[facei];
}
// Cut off anything after the middle point
if (faceMaxXs[facei] > cutXs[cutj])
{
dynWeights.last().value -=
cutPoly::faceCutAreaIntegral
(
faces[facei],
faceAreas[facei],
faceF,
cutPoly::faceCuts
(
faces[facei],
pointXs,
cutXs[cutj]
),
points,
pointFs,
pointXs,
cutXs[cutj],
false
).second() & faceNormals[facei];
}
}
// Right interval
if (cutj < cutXs.size() - 1 && faceMaxXs[facei] > cutXs[cutj])
{
// Update the basis function on the relevant points and
// calculate the area-average value on the face
forAll(faces[facei], facePointi)
{
const label pointi = faces[facei][facePointi];
pointFs[pointi] =
(cutXs[cutj + 1] - pointXs[pointi])
/(cutXs[cutj + 1] - cutXs[cutj]);
}
const scalar faceF =
cutPoly::faceAreaAverage
(
faces[facei],
points,
pointFs
).second();
// Add the whole face's contribution
dynWeights.last().value += faceF*a;
// Cut off anything before the middle point
if (faceMinXs[facei] < cutXs[cutj])
{
dynWeights.last().value -=
cutPoly::faceCutAreaIntegral
(
faces[facei],
faceAreas[facei],
faceF,
cutPoly::faceCuts
(
faces[facei],
pointXs,
cutXs[cutj]
),
points,
pointFs,
pointXs,
cutXs[cutj],
true
).second() & faceNormals[facei];
}
// Cut off anything after the right point
if (faceMaxXs[facei] > cutXs[cutj + 1])
{
dynWeights.last().value -=
cutPoly::faceCutAreaIntegral
(
faces[facei],
faceAreas[facei],
faceF,
cutPoly::faceCuts
(
faces[facei],
pointXs,
cutXs[cutj + 1]
),
points,
pointFs,
pointXs,
cutXs[cutj + 1],
false
).second() & faceNormals[facei];
}
}
cutj ++;
}
}
// Transfer to non-dynamic storage
List<weight> weights;
weights.transfer(dynWeights);
// Normalise, if requested. Otherwise, double the weight values on the ends
// to account for the fact that these points only have half a basis function
// contributing to their sums.
if (normalise)
{
scalarField cutWeightSums(cutXs.size(), scalar(0));
forAll(weights, weighti)
{
cutWeightSums[weights[weighti].cuti] += weights[weighti].value;
}
Pstream::listCombineGather(cutWeightSums, addEqOp());
Pstream::listCombineScatter(cutWeightSums);
forAll(weights, weighti)
{
weights[weighti].value /=
(cutWeightSums[weights[weighti].cuti] + vSmall);
}
}
else
{
forAll(weights, weighti)
{
if
(
weights[weighti].cuti == 0
|| weights[weighti].cuti == cutXs.size() - 1
)
{
weights[weighti].value *= 2;
}
}
}
return weights;
}
List<weight> calcWeights
(
const faceList& faces,
const UList<vector>& faceAreas,
const UList<vector>& faceNormals,
const pointField& points,
const scalarField& pointXs,
const scalarField& faceMinXs,
const scalarField& faceMaxXs,
const labelList& faceMinOrder,
const scalarField& cutXs,
const bool interpolate,
const bool normalise
)
{
return
(
interpolate
? calcInterpolatingWeights
: calcNonInterpolatingWeights
)
(
faces,
faceAreas,
faceNormals,
points,
pointXs,
faceMinXs,
faceMaxXs,
faceMinOrder,
cutXs,
normalise
);
}
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
} // End namespace patchCutPlot
} // End namespace Foam
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
Foam::List<Foam::patchCutPlot::weight> Foam::patchCutPlot::calcWeights
(
const faceList& faces,
const UList<vector>& faceAreas,
const UList<vector>& faceNormals,
const pointField& points,
const scalarField& pointXs,
const scalarField& cutXs,
const bool interpolate,
const bool normalise
)
{
// Determine face min and max coordinates
scalarField faceMinXs(faces.size(), vGreat);
scalarField faceMaxXs(faces.size(), -vGreat);
forAll(faces, facei)
{
forAll(faces[facei], facePointi)
{
const label pointi = faces[facei][facePointi];
faceMinXs[facei] = min(faceMinXs[facei], pointXs[pointi]);
faceMaxXs[facei] = max(faceMaxXs[facei], pointXs[pointi]);
}
}
// Create orderings of the faces based on their min and max coordinates
labelList faceMinOrder(faces.size());
sortedOrder(faceMinXs, faceMinOrder);
// Calculate and return the weights
return
calcWeights
(
faces,
faceAreas,
faceNormals,
points,
pointXs,
faceMinXs,
faceMaxXs,
faceMinOrder,
cutXs,
interpolate,
normalise
);
}
Foam::tmp<Foam::scalarField> Foam::patchCutPlot::calcCutXs
(
const faceList& faces,
const Field<vector>& faceAreas,
const Field<vector>& faceNormals,
const pointField& points,
const scalarField& pointXs,
const bool interpolate,
const label nCuts,
const label nIter,
const bool debug,
const word& functionName,
const polyMesh& functionMesh,
const setWriter& functionFormatter
)
{
const label nIntervals = interpolate ? nCuts : nCuts - 1;
const scalarField faceMagAreas(mag(faceAreas));
// Determine face min and max coordinates
scalarField faceMinXs(faces.size(), vGreat);
scalarField faceMaxXs(faces.size(), -vGreat);
forAll(faces, facei)
{
forAll(faces[facei], facePointi)
{
const label pointi = faces[facei][facePointi];
faceMinXs[facei] = min(faceMinXs[facei], pointXs[pointi]);
faceMaxXs[facei] = max(faceMaxXs[facei], pointXs[pointi]);
}
}
// Create orderings of the faces based on their min and max coordinates
labelList faceMinOrder(faces.size());
sortedOrder(faceMinXs, faceMinOrder);
// Assume equal spacing to begin with
scalar xMin = gMin(pointXs), xMax = gMax(pointXs);
xMin -= max(rootVSmall, 2*small*mag(xMin));
xMax += max(rootVSmall, 2*small*mag(xMax));
tmp<scalarField> tcutXs = xMin + linearSequence01(nCuts)*(xMax - xMin);
scalarField& cutXs = tcutXs.ref();
cutXs.first() = xMin;
cutXs.last() = xMax;
// Names and fields for debug output of the counts, to observe the effect
// of iterative improvement of the spacing
wordList fieldNames;
#define DeclareTypeFieldValues(Type, nullArg) \
PtrList<Field<Type>> Type##FieldValues;
FOR_ALL_FIELD_TYPES(DeclareTypeFieldValues);
#undef DeclareTypeFieldValues
// Iteratively optimise the spacing between the cut points to achieve an
// approximately equal number of data points in each interval
for (label iteri = 0; iteri < nIter + debug; ++ iteri)
{
// Determine the count of faces that contribute to each interval
const List<patchCutPlot::weight> weights =
patchCutPlot::calcWeights
(
faces,
faceAreas,
faceNormals,
points,
pointXs,
faceMinXs,
faceMaxXs,
faceMinOrder,
cutXs,
interpolate,
false
);
const scalarField intervalCounts
(
cutPlot::applyWeights(nIntervals, weights, faceMagAreas)
);
if (debug)
{
const label nFields0 = (2 + !interpolate)*iteri;
const label nFields = (2 + !interpolate)*(iteri + 1);
fieldNames.resize(nFields);
#define ResizeTypeFieldValues(Type, nullArg) \
Type##FieldValues.resize(nFields);
FOR_ALL_FIELD_TYPES(ResizeTypeFieldValues);
#undef ResizeTypeFieldValues
if (!interpolate)
{
const SubField<scalar> distance0s(cutXs, nIntervals);
const SubField<scalar> distance1s(cutXs, nIntervals, 1);
fieldNames[nFields0] = "distance-" + Foam::name(iteri);
scalarFieldValues.set(nFields0, (distance0s + distance1s)/2);
fieldNames[nFields0 + 1] = "thickness-" + Foam::name(iteri);
scalarFieldValues.set(nFields0 + 1, distance1s - distance0s);
}
else
{
fieldNames[nFields0] = "distance-" + Foam::name(iteri);
scalarFieldValues.set(nFields0, new scalarField(cutXs));
}
fieldNames[nFields - 1] = "count-" + Foam::name(iteri);
scalarFieldValues.set(nFields - 1, new scalarField(intervalCounts));
if (iteri == nIter) break;
}
// Do a cumulative sum of the interval counts across all cut points
scalarField cutSumCounts(nCuts, 0);
for (label cuti = 0; cuti < nCuts - 1; ++ cuti)
{
cutSumCounts[cuti + 1] =
cutSumCounts[cuti]
+ (
interpolate
? (intervalCounts[cuti + 1] + intervalCounts[cuti])/2
: intervalCounts[cuti]
);
}
// Compute the desired count in each interval
const scalar intervalCount = cutSumCounts.last()/(nCuts - 1);
// Compute the new spacing between the points
scalarField cut0Xs(cutXs);
cutXs = -vGreat;
cutXs.first() = xMin;
label cuti = 1;
for (label cuti0 = 0; cuti0 < nCuts - 1; ++ cuti0)
{
while
(
cuti < nCuts
&& cutSumCounts[cuti0 + 1] > cuti*intervalCount
)
{
const scalar f =
(cuti*intervalCount - cutSumCounts[cuti0])
/(cutSumCounts[cuti0 + 1] - cutSumCounts[cuti0]);
cutXs[cuti] = (1 - f)*cut0Xs[cuti0] + f*cut0Xs[cuti0 + 1];
cuti ++;
}
}
cutXs.last() = xMax;
}
if (debug)
{
const fileName outputPath =
functionMesh.time().globalPath()
/functionObjects::writeFile::outputPrefix
/(
functionMesh.name() != polyMesh::defaultRegion
? functionMesh.name()
: word()
)
/functionName
/functionMesh.time().name();
mkDir(outputPath);
functionFormatter.write
(
outputPath,
functionName + "_count",
coordSet(labelList(nIntervals, 1)),
fieldNames
#define TypeFieldValuesParameter(Type, nullArg) \
, Type##FieldValues
FOR_ALL_FIELD_TYPES(TypeFieldValuesParameter)
#undef TypeFieldValuesParameter
);
}
// Finally, calculate and return the actual normalised weights
return tcutXs;
}
void Foam::patchCutPlot::writeLayers
(
const SubList<face>& faces,
const List<patchCutPlot::weight>& weights,
const word& functionName,
const fvMesh& functionMesh
)
{
volTensorField layers
(
IOobject
(
functionName + ":layers",
functionMesh.time().name(),
functionMesh
),
functionMesh,
dimensionedTensor(dimless, tensor::uniform(-1))
);
label meshFacei0 = -1;
forAll(functionMesh.faces(), meshFacei)
{
if (&functionMesh.faces()[meshFacei] == &faces[0])
{
meshFacei0 = meshFacei;
break;
}
}
forAll(weights, weighti)
{
const patchCutPlot::weight& w = weights[weighti];
const label facei = meshFacei0 + w.elementi;
const label patchi =
functionMesh.poly().boundary().patchIndices()
[w.elementi + meshFacei0 - functionMesh.nInternalFaces()];
const label patchFacei =
facei - functionMesh.poly().boundary()[patchi].start();
layers.boundaryFieldRef()[patchi][patchFacei] = tensor::zero;
}
forAll(weights, weighti)
{
const patchCutPlot::weight& w = weights[weighti];
const label facei = meshFacei0 + w.elementi;
const label patchi =
functionMesh.poly().boundary().patchIndices()
[w.elementi + meshFacei0 - functionMesh.nInternalFaces()];
const label patchFacei =
facei - functionMesh.poly().boundary()[patchi].start();
const direction i = w.cuti % tensor::nComponents;
layers.boundaryFieldRef()[patchi][patchFacei][i] =
w.value/functionMesh.magFaceAreas()[facei];
}
Info<< functionName << ": Writing " << layers.name() << endl;
layers.write();
}
void Foam::patchCutPlot::writeLayers
(
const UIndirectList<face>& faces,
const List<patchCutPlot::weight>& weights,
const word& functionName,
const fvMesh& functionMesh
)
{
volTensorField layers
(
IOobject
(
functionName + ":layers",
functionMesh.time().name(),
functionMesh
),
functionMesh,
dimensionedTensor(dimless, tensor::uniform(-1))
);
forAll(weights, weighti)
{
const patchCutPlot::weight& w = weights[weighti];
const label facei = faces.addressing()[w.elementi];
const label patchi =
functionMesh.poly().boundary().patchIndices()
[w.elementi - functionMesh.nInternalFaces()];
const label patchFacei =
facei - functionMesh.poly().boundary()[patchi].start();
layers.boundaryFieldRef()[patchi][patchFacei] = tensor::zero;
}
forAll(weights, weighti)
{
const patchCutPlot::weight& w = weights[weighti];
const label facei = faces.addressing()[w.elementi];
const label patchi =
functionMesh.poly().boundary().patchIndices()
[w.elementi - functionMesh.nInternalFaces()];
const label patchFacei =
facei - functionMesh.poly().boundary()[patchi].start();
const direction i = w.cuti % tensor::nComponents;
layers.boundaryFieldRef()[patchi][patchFacei][i] =
w.value/functionMesh.magFaceAreas()[facei];
}
Info<< functionName << ": Writing " << layers.name() << endl;
layers.write();
}
// ************************************************************************* //
|