FreeFOAM The Cross-Platform CFD Toolkit
Hosted by SourceForge:
Get FreeFOAM at SourceForge.net.
            Fast, secure and Free Open Source software downloads

primitiveMeshCheckEdgeLength.C

Go to the documentation of this file.
00001 /*---------------------------------------------------------------------------*\
00002   =========                 |
00003   \\      /  F ield         | OpenFOAM: The Open Source CFD Toolbox
00004    \\    /   O peration     |
00005     \\  /    A nd           | Copyright (C) 1991-2010 OpenCFD Ltd.
00006      \\/     M anipulation  |
00007 -------------------------------------------------------------------------------
00008 License
00009     This file is part of OpenFOAM.
00010 
00011     OpenFOAM is free software: you can redistribute it and/or modify it
00012     under the terms of the GNU General Public License as published by
00013     the Free Software Foundation, either version 3 of the License, or
00014     (at your option) any later version.
00015 
00016     OpenFOAM is distributed in the hope that it will be useful, but WITHOUT
00017     ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
00018     FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
00019     for more details.
00020 
00021     You should have received a copy of the GNU General Public License
00022     along with OpenFOAM.  If not, see <http://www.gnu.org/licenses/>.
00023 
00024 \*---------------------------------------------------------------------------*/
00025 
00026 #include <OpenFOAM/primitiveMesh.H>
00027 
00028 // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
00029 
00030 bool Foam::primitiveMesh::checkEdgeLength
00031 (
00032     const bool report,
00033     const scalar reportLenSqr,
00034     labelHashSet* setPtr
00035 ) const
00036 {
00037     const pointField& points = this->points();
00038     const faceList& faces = this->faces();
00039 
00040     scalar minLenSqr = sqr(GREAT);
00041     scalar maxLenSqr = -sqr(GREAT);
00042 
00043     labelHashSet smallEdgeSet(nPoints()/100);
00044 
00045     forAll(faces, faceI)
00046     {
00047         const face& f = faces[faceI];
00048 
00049         forAll(f, fp)
00050         {
00051             label fp1 = f.fcIndex(fp);
00052 
00053             scalar magSqrE = magSqr(points[f[fp]] - points[f[fp1]]);
00054 
00055             if (magSqrE < reportLenSqr)
00056             {
00057                 smallEdgeSet.insert(f[fp]);
00058                 smallEdgeSet.insert(f[fp1]);
00059             }
00060 
00061             minLenSqr = min(minLenSqr, magSqrE);
00062             maxLenSqr = max(maxLenSqr, magSqrE);
00063         }
00064     }
00065 
00066     reduce(minLenSqr, minOp<scalar>());
00067     reduce(maxLenSqr, maxOp<scalar>());
00068 
00069     label nSmall = smallEdgeSet.size();
00070     reduce(nSmall, sumOp<label>());
00071 
00072     if (setPtr)
00073     {
00074         setPtr->transfer(smallEdgeSet);
00075     }
00076 
00077     if (nSmall > 0)
00078     {
00079         if (report)
00080         {
00081             Info<< "   *Edges too small, min/max edge length = "
00082                 << sqrt(minLenSqr) << " " << sqrt(maxLenSqr)
00083                 << ", number too small: " << nSmall << endl;
00084         }
00085 
00086         return true;
00087     }
00088     else
00089     {
00090         if (report)
00091         {
00092             Info<< "    Min/max edge length = "
00093                 << sqrt(minLenSqr) << " " << sqrt(maxLenSqr)
00094                 << " OK." << endl;
00095         }
00096 
00097         return false;
00098     }
00099 }
00100 
00101 
00102 // ************************ vim: set sw=4 sts=4 et: ************************ //
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines