PatchToolsSortPoints.C

Go to the documentation of this file.

/*---------------------------------------------------------------------------*\
  =========                 |
  \\      /  F ield         | OpenFOAM: The Open Source CFD Toolbox
   \\    /   O peration     |
    \\  /    A nd           | Copyright (C) 2011-2015 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 "PatchTools.H"
 
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
 
template
<
    class Face,
    template<class> class FaceList,
    class PointField,
    class PointType
>
 
Foam::labelListList
Foam::PatchTools::sortedPointEdges
(
    const PrimitivePatch<Face, FaceList, PointField, PointType>& p
)
{
    // Now order the edges of each point according to whether they share a
    // face
    const labelListList& pointEdges = p.pointEdges();
    const edgeList& edges = p.edges();
    const labelListList& edgeFaces = p.edgeFaces();
    const labelListList& faceEdges = p.faceEdges();
 
    // create the lists for the various results. (resized on completion)
    labelListList sortedPointEdges(pointEdges);
 
    DynamicList<label> newEdgeList;
 
    forAll(pointEdges, pointI)
    {
        const labelList& pEdges = pointEdges[pointI];
 
        label nPointEdges = pEdges.size();
 
        label edgeI = pEdges[0];
 
        label prevFaceI = edgeFaces[edgeI][0];
 
        newEdgeList.clear();
        newEdgeList.setCapacity(nPointEdges);
 
        label nVisitedEdges = 0;
 
        do
        {
            newEdgeList.append(edgeI);
 
            // Cross edge to next face
            const labelList& eFaces = edgeFaces[edgeI];
 
            if (eFaces.size() != 2)
            {
                break;
            }
 
            label faceI = eFaces[0];
            if (faceI == prevFaceI)
            {
                faceI = eFaces[1];
            }
 
            // Cross face to next edge
            const labelList& fEdges = faceEdges[faceI];
 
            forAll(fEdges, feI)
            {
                const label nextEdgeI = fEdges[feI];
                const edge& nextEdge = edges[nextEdgeI];
 
                if
                (
                    nextEdgeI != edgeI
                 && (nextEdge.start() == pointI || nextEdge.end() == pointI)
                )
                {
                    edgeI = nextEdgeI;
                    break;
                }
            }
 
            prevFaceI = faceI;
 
            nVisitedEdges++;
            if (nVisitedEdges > nPointEdges)
            {
                WarningInFunction
                    << "Unable to order pointEdges as the face connections "
                    << "are not circular" << nl
                    << "    Original pointEdges = " << pEdges << nl
                    << "    New pointEdges = " << newEdgeList
                    << endl;
 
                newEdgeList = pEdges;
 
                break;
            }
 
        } while (edgeI != pEdges[0]);
 
        if (newEdgeList.size() == nPointEdges)
        {
            forAll(pEdges, eI)
            {
                if (findIndex(newEdgeList, pEdges[eI]) == -1)
                {
                    WarningInFunction
                        << "Cannot find all original edges in the new list"
                        << nl
                        << "    Original pointEdges = " << pEdges << nl
                        << "    New pointEdges = " << newEdgeList
                        << endl;
 
                    newEdgeList = pEdges;
 
                    break;
                }
            }
 
            sortedPointEdges[pointI] = newEdgeList;
        }
    }
 
    return sortedPointEdges;
}
 
 
// ************************************************************************* //