File size: 2,952 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 | /*---------------------------------------------------------------------------*\
========= |
\\ / 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/>.
\*---------------------------------------------------------------------------*/
#include "primitiveMeshCheck.H"
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
bool Foam::meshCheck::checkEdgeLength
(
const primitiveMesh& mesh,
const bool report,
const scalar reportLenSqr,
labelHashSet* setPtr
)
{
const pointField& points = mesh.points();
const faceList& faces = mesh.faces();
scalar minLenSqr = sqr(great);
scalar maxLenSqr = -sqr(great);
labelHashSet smallEdgeSet(mesh.nPoints()/100);
forAll(faces, facei)
{
const face& f = faces[facei];
forAll(f, fp)
{
label fp1 = f.fcIndex(fp);
scalar magSqrE = magSqr(points[f[fp]] - points[f[fp1]]);
if (magSqrE < reportLenSqr)
{
smallEdgeSet.insert(f[fp]);
smallEdgeSet.insert(f[fp1]);
}
minLenSqr = min(minLenSqr, magSqrE);
maxLenSqr = max(maxLenSqr, magSqrE);
}
}
reduce(minLenSqr, minOp());
reduce(maxLenSqr, maxOp());
label nSmall = smallEdgeSet.size();
reduce(nSmall, sumOp());
if (setPtr)
{
setPtr->transfer(smallEdgeSet);
}
if (nSmall > 0)
{
if (report)
{
Info<< " *Edges too small, min/max edge length = "
<< sqrt(minLenSqr) << " " << sqrt(maxLenSqr)
<< ", number too small: " << nSmall << endl;
}
return true;
}
else
{
if (report)
{
Info<< " Min/max edge length = "
<< sqrt(minLenSqr) << " " << sqrt(maxLenSqr)
<< " OK." << endl;
}
return false;
}
}
// ************************************************************************* //
|