mirror of
https://develop.openfoam.com/Development/openfoam.git
synced 2025-11-28 03:28:01 +00:00
95dcb6ded7
- can use 'XX.empty()' instead of 'XX.size() == 0', 'XX.size() < 1' or 'XX.size() <= 0' or for simpler coding. It also has the same number of characters as '!XX.size()' and /might/ be more readable - many size checking had 'XX.size() > 0', 'XX.size() != 0', or 'XX.size() >= 1' when a simple 'XX.size()' suffices
142 lines
4.1 KiB
C
142 lines
4.1 KiB
C
/*---------------------------------------------------------------------------*\
|
|
========= |
|
|
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
|
|
\\ / O peration |
|
|
\\ / A nd | Copyright (C) 1991-2009 OpenCFD Ltd.
|
|
\\/ 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 2 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, write to the Free Software Foundation,
|
|
Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
\*---------------------------------------------------------------------------*/
|
|
|
|
#include "matchPoints.H"
|
|
#include "SortableList.H"
|
|
#include "ListOps.H"
|
|
|
|
// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
|
|
|
|
bool Foam::matchPoints
|
|
(
|
|
const UList<point>& pts0,
|
|
const UList<point>& pts1,
|
|
const UList<scalar>& matchDistances,
|
|
const bool verbose,
|
|
labelList& from0To1,
|
|
const point& origin
|
|
)
|
|
{
|
|
from0To1.setSize(pts0.size());
|
|
from0To1 = -1;
|
|
|
|
bool fullMatch = true;
|
|
|
|
point compareOrigin = origin;
|
|
|
|
if (origin == point(VGREAT, VGREAT, VGREAT))
|
|
{
|
|
if (pts1.size())
|
|
{
|
|
compareOrigin = sum(pts1)/pts1.size();
|
|
}
|
|
}
|
|
|
|
SortableList<scalar> pts0MagSqr(magSqr(pts0 - compareOrigin));
|
|
|
|
SortableList<scalar> pts1MagSqr(magSqr(pts1 - compareOrigin));
|
|
|
|
forAll(pts0MagSqr, i)
|
|
{
|
|
scalar dist0 = pts0MagSqr[i];
|
|
|
|
label face0I = pts0MagSqr.indices()[i];
|
|
|
|
scalar matchDist = matchDistances[face0I];
|
|
|
|
label startI = findLower(pts1MagSqr, 0.99999*dist0 - matchDist);
|
|
|
|
if (startI == -1)
|
|
{
|
|
startI = 0;
|
|
}
|
|
|
|
|
|
// Go through range of equal mag and find nearest vector.
|
|
scalar minDistSqr = VGREAT;
|
|
label minFaceI = -1;
|
|
|
|
for
|
|
(
|
|
label j = startI;
|
|
(
|
|
(j < pts1MagSqr.size())
|
|
&& (pts1MagSqr[j] < 1.00001*dist0 + matchDist)
|
|
);
|
|
j++
|
|
)
|
|
{
|
|
label faceI = pts1MagSqr.indices()[j];
|
|
// Compare actual vectors
|
|
scalar distSqr = magSqr(pts0[face0I] - pts1[faceI]);
|
|
|
|
if (distSqr <= sqr(matchDist) && distSqr < minDistSqr)
|
|
{
|
|
minDistSqr = distSqr;
|
|
minFaceI = faceI;
|
|
}
|
|
}
|
|
|
|
if (minFaceI == -1)
|
|
{
|
|
fullMatch = false;
|
|
|
|
if (verbose)
|
|
{
|
|
Pout<< "Cannot find point in pts1 matching point " << face0I
|
|
<< " coord:" << pts0[face0I]
|
|
<< " in pts0 when using tolerance " << matchDist << endl;
|
|
|
|
// Go through range of equal mag and find equal vector.
|
|
Pout<< "Searching started from:" << startI << " in pts1"
|
|
<< endl;
|
|
for
|
|
(
|
|
label j = startI;
|
|
(
|
|
(j < pts1MagSqr.size())
|
|
&& (pts1MagSqr[j] < 1.00001*dist0 + matchDist)
|
|
);
|
|
j++
|
|
)
|
|
{
|
|
label faceI = pts1MagSqr.indices()[j];
|
|
|
|
Pout<< "Compared coord:" << pts1[faceI]
|
|
<< " with difference to point "
|
|
<< mag(pts1[faceI] - pts0[face0I]) << endl;
|
|
}
|
|
}
|
|
}
|
|
|
|
from0To1[face0I] = minFaceI;
|
|
}
|
|
|
|
return fullMatch;
|
|
}
|
|
|
|
// ************************************************************************* //
|