enrichedPatchFaces.C

Go to the documentation of this file.

/*---------------------------------------------------------------------------*\
  =========                 |
  \\      /  F ield         | OpenFOAM: The Open Source CFD Toolbox
   \\    /   O peration     | Website:  https://openfoam.org
    \\  /    A nd           | Copyright (C) 2011-2018 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 "enrichedPatch.H"
#include "DynamicList.H"


// * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //

const Foam::label Foam::enrichedPatch::enrichedFaceRatio_ = 3;

// * * * * * * * * * * * * * Private Member Functions  * * * * * * * * * * * //

void Foam::enrichedPatch::calcEnrichedFaces
(
    const labelListList& pointsIntoMasterEdges,
    const labelListList& pointsIntoSlaveEdges,
    const pointField& projectedSlavePoints
)
{
    if (enrichedFacesPtr_)
    {
        FatalErrorInFunction
            << "Enriched faces already calculated."
            << abort(FatalError);
    }

    // Create a list of enriched faces
    // Algorithm:
    // 1) Grab the original face and start from point zero.
    // 2) If the point has been merged away, grab the merge label;
    //    otherwise, keep the original label.
    // 3) Go to the next edge. Collect all the points to be added along
    //    the edge; order them in the necessary direction and insert onto the
    //    face.
    // 4) Grab the next point and return on step 2.
    enrichedFacesPtr_ = new faceList(masterPatch_.size() + slavePatch_.size());
    faceList& enrichedFaces = *enrichedFacesPtr_;

    label nEnrichedFaces = 0;

    const pointField& masterLocalPoints = masterPatch_.localPoints();
    const faceList& masterLocalFaces = masterPatch_.localFaces();
    const labelListList& masterFaceEdges = masterPatch_.faceEdges();

    const faceList& slaveLocalFaces = slavePatch_.localFaces();
    const labelListList& slaveFaceEdges = slavePatch_.faceEdges();

    // For correct functioning of the enrichedPatch class, the slave
    // faces need to be inserted first.  See comments in
    // enrichedPatch.H

    // Get reference to the point merge map
    const Map<label>& pmm = pointMergeMap();

    // Add slave faces into the enriched faces list

    forAll(slavePatch_, facei)
    {
        const face oldFace = slavePatch_[facei];
        const face oldLocalFace = slaveLocalFaces[facei];
//         Info<< "old slave face " << facei << ": " << oldFace << endl;
        const labelList& curEdges = slaveFaceEdges[facei];

        DynamicList<label> newFace(oldFace.size()*enrichedFaceRatio_);

        // Note: The number of points and edges in a face is always identical
        // so both can be done is the same loop
        forAll(oldFace, i)
        {
            // Add the point
            Map<label>::const_iterator mpIter =
                pmm.find(oldFace[i]);

            if (mpIter == pmm.end())
            {
                // Point not mapped
                newFace.append(oldFace[i]);

                // Add the projected point into the patch support
                pointMap().insert
                (
                    oldFace[i],    // Global label of point
                    projectedSlavePoints[oldLocalFace[i]] // Projected position
                );
            }
            else
            {
                // Point mapped
                newFace.append(mpIter());

                // Add the projected point into the patch support
                pointMap().insert
                (
                    mpIter(),    // Merged global label of point
                    projectedSlavePoints[oldLocalFace[i]] // Projected position
                );
            }

            // Grab the edge points

            const labelList& slavePointsOnEdge =
                pointsIntoSlaveEdges[curEdges[i]];

            // Info<< "slavePointsOnEdge for "
            //     << curEdges[i] << ": " << slavePointsOnEdge
            //     << endl;

            // If there are no points on the edge, skip everything
            // If there is only one point, no need for sorting
            if (slavePointsOnEdge.size())
            {
                // Sort edge points in order
                scalarField edgePointWeights(slavePointsOnEdge.size());
                const point& startPoint = projectedSlavePoints[oldLocalFace[i]];

                vector e =
                    projectedSlavePoints[oldLocalFace.nextLabel(i)]
                  - startPoint;

                scalar magSqrE = magSqr(e);

                if (magSqrE > small)
                {
                    e /= magSqrE;
                }
                else
                {
                    FatalErrorInFunction
                        << "Zero length edge in slave patch for face " << i
                        << ".  This is not allowed."
                        << abort(FatalError);
                }

                pointField slavePosOnEdge(slavePointsOnEdge.size());

                forAll(slavePointsOnEdge, edgePointi)
                {
                    slavePosOnEdge[edgePointi] =
                        pointMap().find(slavePointsOnEdge[edgePointi])();

                    edgePointWeights[edgePointi] =
                        (e & (slavePosOnEdge[edgePointi] - startPoint));
                }

                if (debug)
                {
                    // Check weights: all new points should be on the edge
                    if (min(edgePointWeights) < 0 || max(edgePointWeights) > 1)
                    {
                        FatalErrorInFunction
                            << " not on the edge for edge " << curEdges[i]
                            << " of face " << facei << " in slave patch." << nl
                            << "Min weight: " << min(edgePointWeights)
                            << " Max weight: " << max(edgePointWeights)
                            << abort(FatalError);
                    }
                }

                // Go through the points and collect them based on
                // weights from lower to higher.  This gives the
                // correct order of points along the edge.
                forAll(edgePointWeights, passI)
                {
                    // Max weight can only be one, so the sorting is
                    // done by elimination.
                    label nextPoint = -1;
                    scalar dist = 2;

                    forAll(edgePointWeights, wI)
                    {
                        if (edgePointWeights[wI] < dist)
                        {
                            dist = edgePointWeights[wI];
                            nextPoint = wI;
                        }
                    }

                    // Insert the next point and reset its weight to exclude it
                    // from future picks
                    newFace.append(slavePointsOnEdge[nextPoint]);
                    edgePointWeights[nextPoint] = great;

                    // Add the point into patch support
                    pointMap().insert
                    (
                        slavePointsOnEdge[nextPoint],
                        slavePosOnEdge[nextPoint]
                    );
                }
            }
        }
        // Info<< "New slave face " << facei << ": " << newFace << endl;

        // Add the new face to the list
        enrichedFaces[nEnrichedFaces].transfer(newFace);
        nEnrichedFaces++;
    }

    // Add master faces into the enriched faces list

    forAll(masterPatch_, facei)
    {
        const face& oldFace = masterPatch_[facei];
        const face& oldLocalFace = masterLocalFaces[facei];
//         Info<< "old master face: " << oldFace << endl;
        const labelList& curEdges = masterFaceEdges[facei];

        DynamicList<label> newFace(oldFace.size()*enrichedFaceRatio_);

        // Note: The number of points and edges in a face is always identical
        // so both can be done is the same loop
        forAll(oldFace, i)
        {
            // Add the point
            Map<label>::const_iterator mpIter =
                pmm.find(oldFace[i]);

            if (mpIter == pmm.end())
            {
                // Point not mapped
                newFace.append(oldFace[i]);

                // Add the point into patch support
                pointMap().insert
                (
                    oldFace[i],
                    masterLocalPoints[oldLocalFace[i]]
                );
            }
            else
            {
                // Point mapped
                newFace.append(mpIter());

                // Add the point into support
                pointMap().insert(mpIter(), masterLocalPoints[oldLocalFace[i]]);
            }

            // Grab the edge points

            const labelList& masterPointsOnEdge =
                pointsIntoMasterEdges[curEdges[i]];

            // If there are no points on the edge, skip everything
            // If there is only one point, no need for sorting
            if (masterPointsOnEdge.size())
            {
                // Sort edge points in order
                scalarField edgePointWeights(masterPointsOnEdge.size());
                const point& startPoint = masterLocalPoints[oldLocalFace[i]];

                vector e =
                    masterLocalPoints[oldLocalFace.nextLabel(i)]
                  - startPoint;

                scalar magSqrE = magSqr(e);

                if (magSqrE > small)
                {
                    e /= magSqrE;
                }
                else
                {
                    FatalErrorInFunction
                        << "Zero length edge in master patch for face " << i
                        << ".  This is not allowed."
                        << abort(FatalError);
                }

                pointField masterPosOnEdge(masterPointsOnEdge.size());

                forAll(masterPointsOnEdge, edgePointi)
                {
                    masterPosOnEdge[edgePointi] =
                        pointMap().find(masterPointsOnEdge[edgePointi])();

                    edgePointWeights[edgePointi] =
                        (e & (masterPosOnEdge[edgePointi] - startPoint));
                }

                if (debug)
                {
                    // Check weights: all new points should be on the edge
                    if (min(edgePointWeights) < 0 || max(edgePointWeights) > 1)
                    {
                        FatalErrorInFunction
                            << " not on the edge for edge " << curEdges[i]
                            << " of face " << facei << " in master patch." << nl
                            << "Min weight: " << min(edgePointWeights)
                            << " Max weight: " << max(edgePointWeights)
                            << abort(FatalError);
                    }
                }

                // Go through the points and collect them based on
                // weights from lower to higher.  This gives the
                // correct order of points along the edge.
                forAll(edgePointWeights, passI)
                {
                    // Max weight can only be one, so the sorting is
                    // done by elimination.
                    label nextPoint = -1;
                    scalar dist = 2;

                    forAll(edgePointWeights, wI)
                    {
                        if (edgePointWeights[wI] < dist)
                        {
                            dist = edgePointWeights[wI];
                            nextPoint = wI;
                        }
                    }

                    // Insert the next point and reset its weight to exclude it
                    // from future picks
                    newFace.append(masterPointsOnEdge[nextPoint]);
                    edgePointWeights[nextPoint] = great;

                    // Add the point into patch support
                    pointMap().insert
                    (
                        masterPointsOnEdge[nextPoint],
                        masterPosOnEdge[nextPoint]
                    );
                }
            }
        }
        // Info<< "New master face: " << newFace << endl;

        // Add the new face to the list
        enrichedFaces[nEnrichedFaces].transfer(newFace);
        nEnrichedFaces++;
    }

    // Check the support for the enriched patch
    if (debug)
    {
        if (!checkSupport())
        {
            Info<< "Enriched patch support OK. Slave faces: "
                << slavePatch_.size() << " Master faces: "
                << masterPatch_.size() << endl;
        }
        else
        {
            FatalErrorInFunction
                << "Error in enriched patch support"
                << abort(FatalError);
        }
    }
}


// * * * * * * * * * * * * * * * Member Functions  * * * * * * * * * * * * * //

const Foam::faceList& Foam::enrichedPatch::enrichedFaces() const
{
    if (!enrichedFacesPtr_)
    {
        FatalErrorInFunction
            << "void enrichedPatch::calcEnrichedFaces\n"
            << "(\n"
            << "    const labelListList& pointsIntoMasterEdges,\n"
            << "    const labelListList& pointsIntoSlaveEdges,\n"
            << "    const pointField& projectedSlavePoints\n"
            << ")"
            << " before trying to access faces."
            << abort(FatalError);
    }

    return *enrichedFacesPtr_;
}


// ************************************************************************* //