hierarchGeomDecomp.C

Go to the documentation of this file.

/*---------------------------------------------------------------------------*\
  =========                 |
  \\      /  F ield         | OpenFOAM: The Open Source CFD Toolbox
   \\    /   O peration     |
    \\  /    A nd           | www.openfoam.com
     \\/     M anipulation  |
-------------------------------------------------------------------------------
    Copyright (C) 2011-2016 OpenFOAM Foundation
    Copyright (C) 2015-2021 OpenCFD Ltd.
-------------------------------------------------------------------------------
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 "hierarchGeomDecomp.H"
#include "addToRunTimeSelectionTable.H"
#include "PstreamReduceOps.H"
#include "SortableList.H"
 
// * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //
 
namespace Foam
{
    defineTypeNameAndDebug(hierarchGeomDecomp, 0);
    addToRunTimeSelectionTable
    (
        decompositionMethod,
        hierarchGeomDecomp,
        dictionary
    );
}
 
 
// * * * * * * * * * * * * * Private Member Functions  * * * * * * * * * * * //
 
Foam::label Foam::hierarchGeomDecomp::findLower
(
    const UList<scalar>& list,
    const scalar val,
    const label first,
    const label last
)
{
    label low = first;
    label high = last;
 
    if (high <= low)
    {
        return low;
    }
 
    while ((high - low) > 1)
    {
        const label mid = (low + high)/2;
 
        if (list[mid] < val)
        {
            low = mid;
        }
        else
        {
            high = mid;
        }
    }
 
    // high and low can still differ by one. Choose best.
 
    if (list[high-1] < val)
    {
        return high;
    }
    else
    {
        return low;
    }
}
 
 
// Create a mapping between the index and the weighted size.
// For convenience, sortedWeightedSize is one size bigger than current. This
// avoids extra tests.
void Foam::hierarchGeomDecomp::calculateSortedWeightedSizes
(
    const labelList& current,
    const labelList& indices,
    const scalarField& weights,
    const label globalCurrentSize,
 
    scalarField& sortedWeightedSizes
)
{
    // Evaluate cumulative weights.
    sortedWeightedSizes[0] = 0;
    forAll(current, i)
    {
        const label pointi = current[indices[i]];
        sortedWeightedSizes[i + 1] = sortedWeightedSizes[i] + weights[pointi];
    }
    // Non-dimensionalise and multiply by size.
    scalar globalCurrentLength = returnReduce
    (
        sortedWeightedSizes[current.size()],
        sumOp<scalar>()
    );
    // Normalise weights by global sum of weights and multiply through
    // by global size.
    sortedWeightedSizes *= (globalCurrentSize/globalCurrentLength);
}
 
 
// Find position in values so between minIndex and this position there
// are wantedSize elements.
bool Foam::hierarchGeomDecomp::findBinary
(
    const label sizeTol,
    const List<scalar>& values,
    const label minIndex,       // index of previous value
    const scalar minValue,      // value at minIndex
    const scalar maxValue,      // global max of values
    const scalar wantedSize,    // wanted size
 
    label& mid,                 // index where size of bin is
                                // wantedSize (to within sizeTol)
    scalar& midValue            // value at mid
)
{
    scalar lowValue = minValue;
    scalar highValue = maxValue;
 
    label low = minIndex;
    label high = values.size();  // (one beyond) index of highValue
 
    // Safeguards to avoid infinite loop.
    scalar midValuePrev = VGREAT;
 
    while (true)
    {
        label size = returnReduce(mid-minIndex, sumOp<label>());
 
        if (debug)
        {
            Pout<< "    low:" << low << " lowValue:" << lowValue
                << " high:" << high << " highValue:" << highValue
                << " mid:" << mid << " midValue:" << midValue << endl
                << "    globalSize:" << size << " wantedSize:" << wantedSize
                << " sizeTol:" << sizeTol << endl;
        }
 
        if (wantedSize < size - sizeTol)
        {
            high = mid;
            highValue = midValue;
        }
        else if (wantedSize > size + sizeTol)
        {
            low = mid;
            lowValue = midValue;
        }
        else
        {
            break;
        }
 
        // Update mid, midValue
        midValue = 0.5*(lowValue+highValue);
        mid = findLower(values, midValue, low, high);
 
        // Safeguard if same as previous.
        bool hasNotChanged = (mag(midValue-midValuePrev) < SMALL);
 
        if (returnReduce(hasNotChanged, andOp<bool>()))
        {
            if (debug)
            {
                WarningInFunction
                    << "unable to find desired decomposition split, making do!"
                    << endl;
            }
 
            return false;
        }
 
        midValuePrev = midValue;
    }
 
    return true;
}
 
 
// Find position in values so between minIndex and this position there
// are wantedSize elements.
bool Foam::hierarchGeomDecomp::findBinary
(
    const label sizeTol,
    const List<scalar>& sortedWeightedSizes,
    const List<scalar>& values,
    const label minIndex,       // index of previous value
    const scalar minValue,      // value at minIndex
    const scalar maxValue,      // global max of values
    const scalar wantedSize,    // wanted size
 
    label& mid,                 // index where size of bin is
                                // wantedSize (to within sizeTol)
    scalar& midValue            // value at mid
)
{
    label low = minIndex;
    scalar lowValue = minValue;
 
    scalar highValue = maxValue;
    // (one beyond) index of highValue
    label high = values.size();
 
    // Safeguards to avoid infinite loop.
    scalar midValuePrev = VGREAT;
 
    while (true)
    {
        scalar weightedSize = returnReduce
        (
            sortedWeightedSizes[mid] - sortedWeightedSizes[minIndex],
            sumOp<scalar>()
        );
 
        if (debug)
        {
            Pout<< "    low:" << low << " lowValue:" << lowValue
                << " high:" << high << " highValue:" << highValue
                << " mid:" << mid << " midValue:" << midValue << endl
                << "    globalSize:" << weightedSize
                << " wantedSize:" << wantedSize
                << " sizeTol:" << sizeTol << endl;
        }
 
        if (wantedSize < weightedSize - sizeTol)
        {
            high = mid;
            highValue = midValue;
        }
        else if (wantedSize > weightedSize + sizeTol)
        {
            low = mid;
            lowValue = midValue;
        }
        else
        {
            break;
        }
 
        // Update mid, midValue
        midValue = 0.5*(lowValue+highValue);
        mid = findLower(values, midValue, low, high);
 
        // Safeguard if same as previous.
        bool hasNotChanged = (mag(midValue-midValuePrev) < SMALL);
 
        if (returnReduce(hasNotChanged, andOp<bool>()))
        {
            if (debug)
            {
                WarningInFunction
                    << "Unable to find desired decomposition split, making do!"
                    << endl;
            }
 
            return false;
        }
 
        midValuePrev = midValue;
    }
 
    return true;
}
 
 
// Sort points into bins according to one component. Recurses to next component.
Foam::label Foam::hierarchGeomDecomp::sortComponent
(
    const label sizeTol,
    const pointField& points,
    const labelList& current,       // slice of points to decompose
    const direction componentIndex, // index in order_
    const label mult,               // multiplication factor for finalDecomp
    labelList& finalDecomp
) const
{
    // Current component
    const label compI = order_[componentIndex];
 
    // Track the number of times that findBinary() did not converge
    label nWarnings = 0;
 
    if (debug)
    {
        Pout<< "sortComponent : Sorting slice of size " << current.size()
            << " in component " << compI << endl;
    }
 
    // Storage for sorted component compI
    SortableList<scalar> sortedCoord(current.size());
 
    forAll(current, i)
    {
        const label pointi = current[i];
 
        sortedCoord[i] = points[pointi][compI];
    }
    sortedCoord.sort();
 
    label globalCurrentSize = returnReduce(current.size(), sumOp<label>());
 
    scalar minCoord = returnReduce
    (
        (
            sortedCoord.size()
          ? sortedCoord.first()
          : GREAT
        ),
        minOp<scalar>()
    );
 
    scalar maxCoord = returnReduce
    (
        (
            sortedCoord.size()
          ? sortedCoord.last()
          : -GREAT
        ),
        maxOp<scalar>()
    );
 
    if (debug)
    {
        Pout<< "sortComponent : minCoord:" << minCoord
            << " maxCoord:" << maxCoord << endl;
    }
 
    // starting index (in sortedCoord) of bin (= local)
    label leftIndex = 0;
    // starting value of bin (= global since coordinate)
    scalar leftCoord = minCoord;
 
    // Sort bins of size n
    for (label bin = 0; bin < n_[compI]; bin++)
    {
        // Now we need to determine the size of the bin (dx). This is
        // determined by the 'pivot' values - everything to the left of this
        // value goes in the current bin, everything to the right into the next
        // bins.
 
        // Local number of elements
        label localSize = -1;     // offset from leftOffset
 
        // Value at right of bin (leftIndex+localSize-1)
        scalar rightCoord = -GREAT;
 
        if (bin == n_[compI]-1)
        {
            // Last bin. Copy all.
            localSize = current.size()-leftIndex;
            rightCoord = maxCoord;                  // note: not used anymore
        }
        else if (Pstream::nProcs() == 1)
        {
            // No need for binary searching of bin size
            localSize = label(current.size()/n_[compI]);
            if (leftIndex+localSize < sortedCoord.size())
            {
                rightCoord = sortedCoord[leftIndex+localSize];
            }
            else
            {
                rightCoord = maxCoord;
            }
        }
        else
        {
            // For the current bin (starting at leftCoord) we want a rightCoord
            // such that the sum of all sizes are globalCurrentSize/n_[compI].
            // We have to iterate to obtain this.
 
            label rightIndex = current.size();
            rightCoord = maxCoord;
 
            // Calculate rightIndex/rightCoord to have wanted size
            bool ok = findBinary
            (
                sizeTol,
                sortedCoord,
                leftIndex,
                leftCoord,
                maxCoord,
                globalCurrentSize/n_[compI],  // wanted size
 
                rightIndex,
                rightCoord
            );
            localSize = rightIndex - leftIndex;
 
            if (!ok)
            {
                ++nWarnings;
            }
        }
 
        if (debug)
        {
            Pout<< "For component " << compI << ", bin " << bin
                << " copying" << endl
                << "from " << leftCoord << " at local index "
                << leftIndex << endl
                << "to " << rightCoord << " localSize:"
                << localSize << endl
                << endl;
        }
 
 
        // Copy localSize elements starting from leftIndex.
        labelList slice(localSize);
 
        forAll(slice, i)
        {
            label pointi = current[sortedCoord.indices()[leftIndex+i]];
 
            // Mark point into correct bin
            finalDecomp[pointi] += bin*mult;
 
            // And collect for next sorting action
            slice[i] = pointi;
        }
 
        // Sort slice in next component
        if (componentIndex < 2)
        {
            string oldPrefix;
            if (debug)
            {
                oldPrefix = Pout.prefix();
                Pout.prefix() = "  " + oldPrefix;
            }
 
            nWarnings += sortComponent
            (
                sizeTol,
                points,
                slice,
                componentIndex+1,
                mult*n_[compI],     // Multiplier to apply to decomposition.
                finalDecomp
            );
 
            if (debug)
            {
                Pout.prefix() = oldPrefix;
            }
        }
 
        // Step to next bin.
        leftIndex += localSize;
        leftCoord = rightCoord;
    }
 
    return nWarnings;
}
 
 
// Sort points into bins according to one component. Recurses to next component.
Foam::label Foam::hierarchGeomDecomp::sortComponent
(
    const label sizeTol,
    const scalarField& weights,
    const pointField& points,
    const labelList& current,       // slice of points to decompose
    const direction componentIndex, // index in order_
    const label mult,               // multiplication factor for finalDecomp
    labelList& finalDecomp
) const
{
    // Current component
    const label compI = order_[componentIndex];
 
    // Track the number of times that findBinary() did not converge
    label nWarnings = 0;
 
    if (debug)
    {
        Pout<< "sortComponent : Sorting slice of size " << current.size()
            << " in component " << compI << endl;
    }
 
    // Storage for sorted component compI
    SortableList<scalar> sortedCoord(current.size());
 
    forAll(current, i)
    {
        label pointi = current[i];
 
        sortedCoord[i] = points[pointi][compI];
    }
    sortedCoord.sort();
 
    label globalCurrentSize = returnReduce(current.size(), sumOp<label>());
 
    // Now evaluate local cumulative weights, based on the sorting.
    // Make one bigger than the nodes.
    scalarField sortedWeightedSizes(current.size()+1, Zero);
    calculateSortedWeightedSizes
    (
        current,
        sortedCoord.indices(),
        weights,
        globalCurrentSize,
        sortedWeightedSizes
    );
 
    scalar minCoord = returnReduce
    (
        (
            sortedCoord.size()
          ? sortedCoord.first()
          : GREAT
        ),
        minOp<scalar>()
    );
 
    scalar maxCoord = returnReduce
    (
        (
            sortedCoord.size()
          ? sortedCoord.last()
          : -GREAT
        ),
        maxOp<scalar>()
    );
 
    if (debug)
    {
        Pout<< "sortComponent : minCoord:" << minCoord
            << " maxCoord:" << maxCoord << endl;
    }
 
    // starting index (in sortedCoord) of bin (= local)
    label leftIndex = 0;
    // starting value of bin (= global since coordinate)
    scalar leftCoord = minCoord;
 
    // Sort bins of size n
    for (label bin = 0; bin < n_[compI]; bin++)
    {
        // Now we need to determine the size of the bin (dx). This is
        // determined by the 'pivot' values - everything to the left of this
        // value goes in the current bin, everything to the right into the next
        // bins.
 
        // Local number of elements
        label localSize = -1;     // offset from leftOffset
 
        // Value at right of bin (leftIndex+localSize-1)
        scalar rightCoord = -GREAT;
 
        if (bin == n_[compI]-1)
        {
            // Last bin. Copy all.
            localSize = current.size()-leftIndex;
            rightCoord = maxCoord;                  // note: not used anymore
        }
        else
        {
            // For the current bin (starting at leftCoord) we want a rightCoord
            // such that the sum of all weighted sizes are
            // globalCurrentLength/n_[compI].
            // We have to iterate to obtain this.
 
            label rightIndex = current.size();
            rightCoord = maxCoord;
 
            // Calculate rightIndex/rightCoord to have wanted size
            bool ok = findBinary
            (
                sizeTol,
                sortedWeightedSizes,
                sortedCoord,
                leftIndex,
                leftCoord,
                maxCoord,
                globalCurrentSize/n_[compI],  // wanted size
 
                rightIndex,
                rightCoord
            );
            localSize = rightIndex - leftIndex;
 
            if (!ok)
            {
                ++nWarnings;
            }
        }
 
        if (debug)
        {
            Pout<< "For component " << compI << ", bin " << bin
                << " copying" << endl
                << "from " << leftCoord << " at local index "
                << leftIndex << endl
                << "to " << rightCoord << " localSize:"
                << localSize << endl
                << endl;
        }
 
 
        // Copy localSize elements starting from leftIndex.
        labelList slice(localSize);
 
        forAll(slice, i)
        {
            label pointi = current[sortedCoord.indices()[leftIndex+i]];
 
            // Mark point into correct bin
            finalDecomp[pointi] += bin*mult;
 
            // And collect for next sorting action
            slice[i] = pointi;
        }
 
        // Sort slice in next component
        if (componentIndex < 2)
        {
            string oldPrefix;
            if (debug)
            {
                oldPrefix = Pout.prefix();
                Pout.prefix() = "  " + oldPrefix;
            }
 
            nWarnings += sortComponent
            (
                sizeTol,
                weights,
                points,
                slice,
                componentIndex+1,
                mult*n_[compI],     // Multiplier to apply to decomposition.
                finalDecomp
            );
 
            if (debug)
            {
                Pout.prefix() = oldPrefix;
            }
        }
 
        // Step to next bin.
        leftIndex += localSize;
        leftCoord = rightCoord;
    }
 
    return nWarnings;
}
 
 
// * * * * * * * * * * * * * * * * Constructors  * * * * * * * * * * * * * * //
 
Foam::hierarchGeomDecomp::hierarchGeomDecomp
(
    const dictionary& decompDict,
    const word& regionName
)
:
    geomDecomp(typeName, decompDict, regionName)
{}
 
 
// * * * * * * * * * * * * * * * Member Functions  * * * * * * * * * * * * * //
 
Foam::labelList Foam::hierarchGeomDecomp::decompose
(
    const pointField& points
) const
{
    // construct a list for the final result
    labelList finalDecomp(points.size(), Zero);
 
    // Start off with every point sorted onto itself.
    labelList slice(identity(points.size()));
 
    const pointField rotatedPoints(adjustPoints(points));
 
    // Calculate tolerance of cell distribution. For large cases finding
    // distribution to the cell exact would cause too many iterations so allow
    // some slack.
    const label allSize = returnReduce(points.size(), sumOp<label>());
    const label sizeTol = max(1, label(1e-3*allSize/nDomains_));
 
    // Sort recursive
    const label nWarnings = sortComponent
    (
        sizeTol,
        rotatedPoints,
        slice,
        0,              // Sort first component in order_
        1,              // Offset for different x bins.
        finalDecomp
    );
 
    if (nWarnings)
    {
        WarningInFunction
            << "\nEncountered " << nWarnings << " occurrences where the desired"
               " decomposition split could not be properly satisfied" << endl;
    }
 
    return finalDecomp;
}
 
 
Foam::labelList Foam::hierarchGeomDecomp::decompose
(
    const pointField& points,
    const scalarField& weights
) const
{
    // Construct a list for the final result
    labelList finalDecomp(points.size(), Zero);
 
    // Start off with every point sorted onto itself.
    labelList slice(identity(points.size()));
 
    const pointField rotatedPoints(adjustPoints(points));
 
    // Calculate tolerance of cell distribution. For large cases finding
    // distribution to the cell exact would cause too many iterations so allow
    // some slack.
    const label allSize = returnReduce(points.size(), sumOp<label>());
    const label sizeTol = max(1, label(1e-3*allSize/nDomains_));
 
    // Sort recursive
    const label nWarnings = sortComponent
    (
        sizeTol,
        weights,
        rotatedPoints,
        slice,
        0,              // Sort first component in order_
        1,              // Offset for different x bins.
        finalDecomp
    );
 
    if (nWarnings)
    {
        WarningInFunction
            << "\nEncountered " << nWarnings << " occurrences where the desired"
               " decomposition split could not be properly satisfied" << endl;
    }
 
    return finalDecomp;
}
 
 
// ************************************************************************* //