Datasets:

introvoyz042
/

OpenFOAM-dev

License:

Dataset card Files Files and versions

xet

Community

OpenFOAM-dev / data /src /meshTools /cellsToCells /nearest /nearestCellsToCells.C

introvoyz042

Migrated from GitHub

5a600cf verified 29 days ago

Raw History Blame Contribute Delete

10.9 kB

/*---------------------------------------------------------------------------*\
  =========                 |
  \\      /  F ield         | OpenFOAM: The Open Source CFD Toolbox
   \\    /   O peration     | Website:  https://openfoam.org
    \\  /    A nd           | Copyright (C) 2013-2025 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 "nearestCellsToCells.H"
#include "pointIndexHit.H"
#include "meshSearch.H"
#include "addToRunTimeSelectionTable.H"

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

namespace Foam
{
namespace cellsToCellss
{
    defineTypeNameAndDebug(nearest, 0);
    addToRunTimeSelectionTable(cellsToCells, nearest, word);
}
}


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

bool Foam::cellsToCellss::nearest::findInitialSeeds
(
    const polyMesh& srcMesh,
    const polyMesh& tgtMesh,
    const labelList& srcCellIDs,
    const boolList& mapFlag,
    const label startSeedI,
    label& srcSeedI,
    label& tgtSeedI
) const
{
    const vectorField& srcCcs = srcMesh.cellCentres();

    const meshSearch& tgtSearchEngine = meshSearch::New(tgtMesh);

    for (label i = startSeedI; i < srcCellIDs.size(); i++)
    {
        label srcI = srcCellIDs[i];

        if (mapFlag[srcI])
        {
            const point& srcCc = srcCcs[srcI];

            pointIndexHit hit =
                tgtSearchEngine.cellTree().findNearest(srcCc, great);

            if (hit.hit())
            {
                srcSeedI = srcI;
                tgtSeedI = hit.index();

                return true;
            }
            else
            {
                FatalErrorInFunction
                    << "Unable to find nearest target cell"
                    << " for source cell " << srcI
                    << " with centre " << srcCc
                    << abort(FatalError);
            }

            break;
        }
    }

    if (debug)
    {
        Pout<< "could not find starting seed" << endl;
    }

    return false;
}


Foam::scalar Foam::cellsToCellss::nearest::calculateAddressing
(
    const polyMesh& srcMesh,
    const polyMesh& tgtMesh,
    labelListList& srcToTgtCellAddr,
    scalarListList& srcToTgtCellWght,
    labelListList& tgtToSrcCellAddr,
    scalarListList& tgtToSrcCellWght,
    const label srcSeedI,
    const label tgtSeedI,
    const labelList& srcCellIDs,
    boolList& mapFlag,
    label& startSeedI
)
{
    scalar V = 0;

    List<DynamicList<label>> srcToTgt(srcMesh.nCells());
    List<DynamicList<label>> tgtToSrc(tgtMesh.nCells());

    const scalarField& srcVc = srcMesh.cellVolumes();

    {
        label srcCelli = srcSeedI;
        label tgtCelli = tgtSeedI;

        do
        {
            // find nearest tgt cell
            findNearestCell(srcMesh, tgtMesh, srcCelli, tgtCelli);

           // store src/tgt cell pair
            srcToTgt[srcCelli].append(tgtCelli);
            tgtToSrc[tgtCelli].append(srcCelli);

            // mark source cell srcCelli and tgtCelli as matched
            mapFlag[srcCelli] = false;

            // accumulate intersection volume
            V += srcVc[srcCelli];

            // find new source cell
            setNextNearestCells
            (
                srcMesh,
                tgtMesh,
                startSeedI,
                srcCelli,
                tgtCelli,
                mapFlag,
                srcCellIDs
            );
        }
        while (srcCelli >= 0);
    }

    // for the case of multiple source cells per target cell, select the
    // nearest source cell only and discard the others
    const vectorField& srcCc = srcMesh.cellCentres();
    const vectorField& tgtCc = tgtMesh.cellCentres();

    forAll(tgtToSrc, targetCelli)
    {
        if (tgtToSrc[targetCelli].size() > 1)
        {
            const vector& tgtC = tgtCc[targetCelli];

            DynamicList<label>& srcCells = tgtToSrc[targetCelli];

            label srcCelli = srcCells[0];
            scalar d = magSqr(tgtC - srcCc[srcCelli]);

            for (label i = 1; i < srcCells.size(); i++)
            {
                label srcI = srcCells[i];
                scalar dNew = magSqr(tgtC - srcCc[srcI]);
                if (dNew < d)
                {
                    d = dNew;
                    srcCelli = srcI;
                }
            }

            srcCells.clear();
            srcCells.append(srcCelli);
        }
    }

    // If there are more target cells than source cells, some target cells
    // might not yet be mapped
    forAll(tgtToSrc, tgtCelli)
    {
        if (tgtToSrc[tgtCelli].empty())
        {
            label srcCelli =
                findMappedSrcCell(srcMesh, tgtMesh, tgtCelli, tgtToSrc);

            findNearestCell(tgtMesh, srcMesh, tgtCelli, srcCelli);

            tgtToSrc[tgtCelli].append(srcCelli);
        }
    }

    // transfer addressing into persistent storage
    forAll(srcToTgtCellAddr, i)
    {
        srcToTgtCellWght[i] = scalarList(srcToTgt[i].size(), scalar(1));
        srcToTgtCellAddr[i].transfer(srcToTgt[i]);
    }

    forAll(tgtToSrcCellAddr, i)
    {
        tgtToSrcCellWght[i] = scalarList(tgtToSrc[i].size(), scalar(1));
        tgtToSrcCellAddr[i].transfer(tgtToSrc[i]);
    }

    return V;
}


void Foam::cellsToCellss::nearest::findNearestCell
(
    const polyMesh& mesh1,
    const polyMesh& mesh2,
    const label cell1,
    label& cell2
) const
{
    const vectorField& Cc1 = mesh1.cellCentres();
    const vectorField& Cc2 = mesh2.cellCentres();

    const vector& p1 = Cc1[cell1];

    DynamicList<label> cells2(10);
    cells2.append(cell2);

    DynamicList<label> visitedCells(10);

    scalar d = great;

    do
    {
        label c2 = cells2.remove();
        visitedCells.append(c2);

        scalar dTest = magSqr(Cc2[c2] - p1);
        if (dTest < d)
        {
            cell2 = c2;
            d = dTest;
            appendNbrCells(cell2, mesh2, visitedCells, cells2);
        }

    } while (cells2.size() > 0);
}


void Foam::cellsToCellss::nearest::setNextNearestCells
(
    const polyMesh& srcMesh,
    const polyMesh& tgtMesh,
    label& startSeedI,
    label& srcCelli,
    label& tgtCelli,
    boolList& mapFlag,
    const labelList& srcCellIDs
) const
{
    const labelList& srcNbr = srcMesh.cellCells()[srcCelli];

    srcCelli = -1;
    forAll(srcNbr, i)
    {
        label celli = srcNbr[i];
        if (mapFlag[celli])
        {
            srcCelli = celli;
            return;
        }
    }

    for (label i = startSeedI; i < srcCellIDs.size(); i++)
    {
        label celli = srcCellIDs[i];
        if (mapFlag[celli])
        {
            startSeedI = i;
            break;
        }
    }

    findInitialSeeds
    (
        srcMesh,
        tgtMesh,
        srcCellIDs,
        mapFlag,
        startSeedI,
        srcCelli,
        tgtCelli
    );
}


Foam::label Foam::cellsToCellss::nearest::findMappedSrcCell
(
    const polyMesh& srcMesh,
    const polyMesh& tgtMesh,
    const label tgtCelli,
    const List<DynamicList<label>>& tgtToSrc
) const
{
    DynamicList<label> testCells(10);
    DynamicList<label> visitedCells(10);

    testCells.append(tgtCelli);

    do
    {
        // search target tgtCelli neighbours for match with source cell
        label tgtI = testCells.remove();

        if (findIndex(visitedCells, tgtI) == -1)
        {
            visitedCells.append(tgtI);

            if (tgtToSrc[tgtI].size())
            {
                return tgtToSrc[tgtI][0];
            }
            else
            {
                const labelList& nbrCells = tgtMesh.cellCells()[tgtI];

                forAll(nbrCells, i)
                {
                    if (findIndex(visitedCells, nbrCells[i]) == -1)
                    {
                        testCells.append(nbrCells[i]);
                    }
                }
            }
        }
    } while (testCells.size());

    // did not find any match - should not be possible to get here!
    return -1;
}


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

Foam::scalar Foam::cellsToCellss::nearest::calculate
(
    const polyMesh& srcMesh,
    const polyMesh& tgtMesh
)
{
    initialise(srcMesh, tgtMesh);

    // Determine (potentially) participating source mesh cells
    const labelList srcCellIDs(maskCells(srcMesh, tgtMesh));

    // Initialise list to keep track of whether src cell can be mapped
    boolList mapFlag(srcMesh.nCells(), false);
    UIndirectList<bool>(mapFlag, srcCellIDs) = true;

    // Find initial point in tgt mesh
    label srcSeedI = -1;
    label tgtSeedI = -1;
    label startSeedI = 0;
    bool startWalk =
        findInitialSeeds
        (
            srcMesh,
            tgtMesh,
            srcCellIDs,
            mapFlag,
            startSeedI,
            srcSeedI,
            tgtSeedI
        );

    if (startWalk)
    {
        return
            calculateAddressing
            (
                srcMesh,
                tgtMesh,
                srcLocalTgtCells_,
                srcWeights_,
                tgtLocalSrcCells_,
                tgtWeights_,
                srcSeedI,
                tgtSeedI,
                srcCellIDs,
                mapFlag,
                startSeedI
            );
    }
    else
    {
        return 0;
    }
}


void Foam::cellsToCellss::nearest::normalise
(
    const polyMesh& srcMesh,
    labelListList& srcToTgtAddr,
    scalarListList& srcToTgtWght
) const
{
    forAll(srcToTgtWght, srcCelli)
    {
        if (srcToTgtWght[srcCelli].size() > 1)
        {
            srcToTgtAddr[srcCelli].resize(1);
            srcToTgtWght[srcCelli].resize(1);
        }
    }
}


// * * * * * * * * * * * * * * * * Constructors  * * * * * * * * * * * * * * //

Foam::cellsToCellss::nearest::nearest()
:
    cellsToCells()
{}


// * * * * * * * * * * * * * * * * Destructor * * * * * * * * * * * * * * * //

Foam::cellsToCellss::nearest::~nearest()
{}


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

	/---------------------------------------------------------------------------\
	========= \|
	\\ / F ield \| OpenFOAM: The Open Source CFD Toolbox
	\\ / O peration \| Website: https://openfoam.org
	\\ / A nd \| Copyright (C) 2013-2025 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 "nearestCellsToCells.H"
	#include "pointIndexHit.H"
	#include "meshSearch.H"
	#include "addToRunTimeSelectionTable.H"

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

	namespace Foam
	{
	namespace cellsToCellss
	{
	defineTypeNameAndDebug(nearest, 0);
	addToRunTimeSelectionTable(cellsToCells, nearest, word);
	}
	}


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

	bool Foam::cellsToCellss::nearest::findInitialSeeds
	(
	const polyMesh& srcMesh,
	const polyMesh& tgtMesh,
	const labelList& srcCellIDs,
	const boolList& mapFlag,
	const label startSeedI,
	label& srcSeedI,
	label& tgtSeedI
	) const
	{
	const vectorField& srcCcs = srcMesh.cellCentres();

	const meshSearch& tgtSearchEngine = meshSearch::New(tgtMesh);

	for (label i = startSeedI; i < srcCellIDs.size(); i++)
	{
	label srcI = srcCellIDs[i];

	if (mapFlag[srcI])
	{
	const point& srcCc = srcCcs[srcI];

	pointIndexHit hit =
	tgtSearchEngine.cellTree().findNearest(srcCc, great);

	if (hit.hit())
	{
	srcSeedI = srcI;
	tgtSeedI = hit.index();

	return true;
	}
	else
	{
	FatalErrorInFunction
	<< "Unable to find nearest target cell"
	<< " for source cell " << srcI
	<< " with centre " << srcCc
	<< abort(FatalError);
	}

	break;
	}
	}

	if (debug)
	{
	Pout<< "could not find starting seed" << endl;
	}

	return false;
	}


	Foam::scalar Foam::cellsToCellss::nearest::calculateAddressing
	(
	const polyMesh& srcMesh,
	const polyMesh& tgtMesh,
	labelListList& srcToTgtCellAddr,
	scalarListList& srcToTgtCellWght,
	labelListList& tgtToSrcCellAddr,
	scalarListList& tgtToSrcCellWght,
	const label srcSeedI,
	const label tgtSeedI,
	const labelList& srcCellIDs,
	boolList& mapFlag,
	label& startSeedI
	)
	{
	scalar V = 0;

	List<DynamicList<label>> srcToTgt(srcMesh.nCells());
	List<DynamicList<label>> tgtToSrc(tgtMesh.nCells());

	const scalarField& srcVc = srcMesh.cellVolumes();

	{
	label srcCelli = srcSeedI;
	label tgtCelli = tgtSeedI;

	do
	{
	// find nearest tgt cell
	findNearestCell(srcMesh, tgtMesh, srcCelli, tgtCelli);

	// store src/tgt cell pair
	srcToTgt[srcCelli].append(tgtCelli);
	tgtToSrc[tgtCelli].append(srcCelli);

	// mark source cell srcCelli and tgtCelli as matched
	mapFlag[srcCelli] = false;

	// accumulate intersection volume
	V += srcVc[srcCelli];

	// find new source cell
	setNextNearestCells
	(
	srcMesh,
	tgtMesh,
	startSeedI,
	srcCelli,
	tgtCelli,
	mapFlag,
	srcCellIDs
	);
	}
	while (srcCelli >= 0);
	}

	// for the case of multiple source cells per target cell, select the
	// nearest source cell only and discard the others
	const vectorField& srcCc = srcMesh.cellCentres();
	const vectorField& tgtCc = tgtMesh.cellCentres();

	forAll(tgtToSrc, targetCelli)
	{
	if (tgtToSrc[targetCelli].size() > 1)
	{
	const vector& tgtC = tgtCc[targetCelli];

	DynamicList<label>& srcCells = tgtToSrc[targetCelli];

	label srcCelli = srcCells[0];
	scalar d = magSqr(tgtC - srcCc[srcCelli]);

	for (label i = 1; i < srcCells.size(); i++)
	{
	label srcI = srcCells[i];
	scalar dNew = magSqr(tgtC - srcCc[srcI]);
	if (dNew < d)
	{
	d = dNew;
	srcCelli = srcI;
	}
	}

	srcCells.clear();
	srcCells.append(srcCelli);
	}
	}

	// If there are more target cells than source cells, some target cells
	// might not yet be mapped
	forAll(tgtToSrc, tgtCelli)
	{
	if (tgtToSrc[tgtCelli].empty())
	{
	label srcCelli =
	findMappedSrcCell(srcMesh, tgtMesh, tgtCelli, tgtToSrc);

	findNearestCell(tgtMesh, srcMesh, tgtCelli, srcCelli);

	tgtToSrc[tgtCelli].append(srcCelli);
	}
	}

	// transfer addressing into persistent storage
	forAll(srcToTgtCellAddr, i)
	{
	srcToTgtCellWght[i] = scalarList(srcToTgt[i].size(), scalar(1));
	srcToTgtCellAddr[i].transfer(srcToTgt[i]);
	}

	forAll(tgtToSrcCellAddr, i)
	{
	tgtToSrcCellWght[i] = scalarList(tgtToSrc[i].size(), scalar(1));
	tgtToSrcCellAddr[i].transfer(tgtToSrc[i]);
	}

	return V;
	}


	void Foam::cellsToCellss::nearest::findNearestCell
	(
	const polyMesh& mesh1,
	const polyMesh& mesh2,
	const label cell1,
	label& cell2
	) const
	{
	const vectorField& Cc1 = mesh1.cellCentres();
	const vectorField& Cc2 = mesh2.cellCentres();

	const vector& p1 = Cc1[cell1];

	DynamicList<label> cells2(10);
	cells2.append(cell2);

	DynamicList<label> visitedCells(10);

	scalar d = great;

	do
	{
	label c2 = cells2.remove();
	visitedCells.append(c2);

	scalar dTest = magSqr(Cc2[c2] - p1);
	if (dTest < d)
	{
	cell2 = c2;
	d = dTest;
	appendNbrCells(cell2, mesh2, visitedCells, cells2);
	}

	} while (cells2.size() > 0);
	}


	void Foam::cellsToCellss::nearest::setNextNearestCells
	(
	const polyMesh& srcMesh,
	const polyMesh& tgtMesh,
	label& startSeedI,
	label& srcCelli,
	label& tgtCelli,
	boolList& mapFlag,
	const labelList& srcCellIDs
	) const
	{
	const labelList& srcNbr = srcMesh.cellCells()[srcCelli];

	srcCelli = -1;
	forAll(srcNbr, i)
	{
	label celli = srcNbr[i];
	if (mapFlag[celli])
	{
	srcCelli = celli;
	return;
	}
	}

	for (label i = startSeedI; i < srcCellIDs.size(); i++)
	{
	label celli = srcCellIDs[i];
	if (mapFlag[celli])
	{
	startSeedI = i;
	break;
	}
	}

	findInitialSeeds
	(
	srcMesh,
	tgtMesh,
	srcCellIDs,
	mapFlag,
	startSeedI,
	srcCelli,
	tgtCelli
	);
	}


	Foam::label Foam::cellsToCellss::nearest::findMappedSrcCell
	(
	const polyMesh& srcMesh,
	const polyMesh& tgtMesh,
	const label tgtCelli,
	const List<DynamicList<label>>& tgtToSrc
	) const
	{
	DynamicList<label> testCells(10);
	DynamicList<label> visitedCells(10);

	testCells.append(tgtCelli);

	do
	{
	// search target tgtCelli neighbours for match with source cell
	label tgtI = testCells.remove();

	if (findIndex(visitedCells, tgtI) == -1)
	{
	visitedCells.append(tgtI);

	if (tgtToSrc[tgtI].size())
	{
	return tgtToSrc[tgtI][0];
	}
	else
	{
	const labelList& nbrCells = tgtMesh.cellCells()[tgtI];

	forAll(nbrCells, i)
	{
	if (findIndex(visitedCells, nbrCells[i]) == -1)
	{
	testCells.append(nbrCells[i]);
	}
	}
	}
	}
	} while (testCells.size());

	// did not find any match - should not be possible to get here!
	return -1;
	}


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

	Foam::scalar Foam::cellsToCellss::nearest::calculate
	(
	const polyMesh& srcMesh,
	const polyMesh& tgtMesh
	)
	{
	initialise(srcMesh, tgtMesh);

	// Determine (potentially) participating source mesh cells
	const labelList srcCellIDs(maskCells(srcMesh, tgtMesh));

	// Initialise list to keep track of whether src cell can be mapped
	boolList mapFlag(srcMesh.nCells(), false);
	UIndirectList<bool>(mapFlag, srcCellIDs) = true;

	// Find initial point in tgt mesh
	label srcSeedI = -1;
	label tgtSeedI = -1;
	label startSeedI = 0;
	bool startWalk =
	findInitialSeeds
	(
	srcMesh,
	tgtMesh,
	srcCellIDs,
	mapFlag,
	startSeedI,
	srcSeedI,
	tgtSeedI
	);

	if (startWalk)
	{
	return
	calculateAddressing
	(
	srcMesh,
	tgtMesh,
	srcLocalTgtCells_,
	srcWeights_,
	tgtLocalSrcCells_,
	tgtWeights_,
	srcSeedI,
	tgtSeedI,
	srcCellIDs,
	mapFlag,
	startSeedI
	);
	}
	else
	{
	return 0;
	}
	}


	void Foam::cellsToCellss::nearest::normalise
	(
	const polyMesh& srcMesh,
	labelListList& srcToTgtAddr,
	scalarListList& srcToTgtWght
	) const
	{
	forAll(srcToTgtWght, srcCelli)
	{
	if (srcToTgtWght[srcCelli].size() > 1)
	{
	srcToTgtAddr[srcCelli].resize(1);
	srcToTgtWght[srcCelli].resize(1);
	}
	}
	}


	// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //

	Foam::cellsToCellss::nearest::nearest()
	:
	cellsToCells()
	{}


	// * * * * * * * * * * * * * * * * Destructor * * * * * * * * * * * * * * * //

	Foam::cellsToCellss::nearest::~nearest()
	{}


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