/*---------------------------------------------------------------------------*\ ========= | \\ / F ield | OpenFOAM: The Open Source CFD Toolbox \\ / O peration | Website: https://openfoam.org \\ / A nd | Copyright (C) 2012-2024 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 . \*---------------------------------------------------------------------------*/ #include "pointToPointPlanarInterpolation.H" #include "boundBox.H" #include "randomGenerator.H" #include "vector2D.H" #include "triSurface.H" #include "triSurfaceTools.H" #include "OBJstream.H" #include "Time.H" #include "matchPoints.H" // * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * // namespace Foam { defineTypeNameAndDebug(pointToPointPlanarInterpolation, 0); } // * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * // Foam::coordinateSystem Foam::pointToPointPlanarInterpolation::calcCoordinateSystem ( const pointField& points ) const { if (points.size() < 3) { FatalErrorInFunction << "Only " << points.size() << " provided." << nl << "Need at least three non-colinear points" << " to be able to interpolate." << exit(FatalError); } const point& p0 = points[0]; // Find furthest away point vector e1; label index1 = -1; scalar maxDist = -great; for (label i = 1; i < points.size(); i++) { const vector d = points[i] - p0; scalar magD = mag(d); if (magD > maxDist) { e1 = d/magD; index1 = i; maxDist = magD; } } // Find point that is furthest away from line p0-p1 const point& p1 = points[index1]; label index2 = -1; maxDist = -great; for (label i = 1; i < points.size(); i++) { if (i != index1) { const point& p2 = points[i]; vector e2(p2 - p0); e2 -= (e2&e1)*e1; scalar magE2 = mag(e2); if (magE2 > maxDist) { index2 = i; maxDist = magE2; } } } if (index2 == -1) { FatalErrorInFunction << "Cannot find points that make valid normal." << nl << "Have so far points " << p0 << " and " << p1 << "Need at least three points which are not in a line." << exit(FatalError); } vector n = e1^(points[index2]-p0); n /= mag(n); if (debug) { InfoInFunction << " Used points " << p0 << ' ' << points[index1] << ' ' << points[index2] << " to define coordinate system with normal " << n << endl; } return coordinateSystem ( "reference", p0, // origin n, // normal e1 // 0-axis ); } void Foam::pointToPointPlanarInterpolation::calcWeights ( const pointField& sourcePoints, const pointField& destPoints ) { if (nearestOnly_) { labelList destToSource; bool fullMatch = matchPoints ( destPoints, sourcePoints, scalarField(destPoints.size(), great), true, // verbose destToSource ); if (!fullMatch) { FatalErrorInFunction << "Did not find a corresponding sourcePoint for every face" << " centre" << exit(FatalError); } nearestVertex_.setSize(destPoints.size()); nearestVertexWeight_.setSize(destPoints.size()); forAll(nearestVertex_, i) { nearestVertex_[i][0] = destToSource[i]; nearestVertex_[i][1] = -1; nearestVertex_[i][2] = -1; nearestVertexWeight_[i][0] = 1.0; nearestVertexWeight_[i][1] = 0.0; nearestVertexWeight_[i][2] = 0.0; } if (debug) { forAll(destPoints, i) { label v0 = nearestVertex_[i][0]; Pout<< "For location " << destPoints[i] << " sampling vertex " << v0 << " at:" << sourcePoints[v0] << " distance:" << mag(sourcePoints[v0]-destPoints[i]) << endl; } OBJstream str("destToSource.obj"); Pout<< "pointToPointPlanarInterpolation::calcWeights :" << " Dumping lines from face centres to original points to " << str.name() << endl; forAll(destPoints, i) { label v0 = nearestVertex_[i][0]; str.write(linePointRef(destPoints[i], sourcePoints[v0])); } } } else { tmp tlocalVertices ( referenceCS_.localPosition(sourcePoints) ); vectorField& localVertices = tlocalVertices.ref(); const boundBox bb(localVertices, true); const point bbMid(bb.midpoint()); if (debug) { InfoInFunction << " Perturbing points with " << perturb_ << " fraction of a random position inside " << bb << " to break any ties on regular meshes." << nl << endl; } randomGenerator rndGen(123456); forAll(localVertices, i) { localVertices[i] += perturb_ *(rndGen.sampleAB(bb.min(), bb.max()) - bbMid); } // Determine triangulation List localVertices2D(localVertices.size()); forAll(localVertices, i) { localVertices2D[i][0] = localVertices[i][0]; localVertices2D[i][1] = localVertices[i][1]; } triSurface s(triSurfaceTools::delaunay2D(localVertices2D)); tmp tlocalFaceCentres ( referenceCS_.localPosition ( destPoints ) ); const pointField& localFaceCentres = tlocalFaceCentres(); if (debug) { Pout<< "pointToPointPlanarInterpolation::calcWeights :" <<" Dumping triangulated surface to triangulation.stl" << endl; s.write("triangulation.stl"); OBJstream str("localFaceCentres.obj"); Pout<< "pointToPointPlanarInterpolation::calcWeights :" << " Dumping face centres to " << str.name() << endl; forAll(localFaceCentres, i) { str.write(localFaceCentres[i]); } } // Determine interpolation onto face centres. triSurfaceTools::calcInterpolationWeights ( s, localFaceCentres, // points to interpolate to nearestVertex_, nearestVertexWeight_ ); if (debug) { forAll(sourcePoints, i) { Pout<< "source:" << i << " at:" << sourcePoints[i] << " 2d:" << localVertices[i] << endl; } forAll(destPoints, i) { label v0 = nearestVertex_[i][0]; label v1 = nearestVertex_[i][1]; label v2 = nearestVertex_[i][2]; Pout<< "For location " << destPoints[i] << " 2d:" << localFaceCentres[i] << " sampling vertices" << nl << " " << v0 << " at:" << sourcePoints[v0] << " weight:" << nearestVertexWeight_[i][0] << nl; if (v1 != -1) { Pout<< " " << v1 << " at:" << sourcePoints[v1] << " weight:" << nearestVertexWeight_[i][1] << nl; } if (v2 != -1) { Pout<< " " << v2 << " at:" << sourcePoints[v2] << " weight:" << nearestVertexWeight_[i][2] << nl; } Pout<< endl; } } } } // * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * // Foam::pointToPointPlanarInterpolation::pointToPointPlanarInterpolation ( const pointField& sourcePoints, const pointField& destPoints, const scalar perturb, const bool nearestOnly ) : perturb_(perturb), nearestOnly_(nearestOnly), referenceCS_(calcCoordinateSystem(sourcePoints)), nPoints_(sourcePoints.size()) { calcWeights(sourcePoints, destPoints); } Foam::pointToPointPlanarInterpolation::pointToPointPlanarInterpolation ( const coordinateSystem& referenceCS, const pointField& sourcePoints, const pointField& destPoints, const scalar perturb ) : perturb_(perturb), nearestOnly_(false), referenceCS_(referenceCS), nPoints_(sourcePoints.size()) { calcWeights(sourcePoints, destPoints); } // * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * * // Foam::wordList Foam::pointToPointPlanarInterpolation::timeNames ( const instantList& times ) { wordList names(times.size()); forAll(times, i) { names[i] = times[i].name(); } return names; } bool Foam::pointToPointPlanarInterpolation::findTime ( const instantList& times, const label startSampleTime, const scalar timeVal, label& lo, label& hi ) { lo = startSampleTime; hi = -1; for (label i = startSampleTime+1; i < times.size(); i++) { if (times[i].value() > timeVal) { break; } else { lo = i; } } if (lo == -1) { // FatalErrorInFunction // << "Cannot find starting sampling values for current time " // << timeVal << nl // << "Have sampling values for times " // << timeNames(times) << nl // << exit(FatalError); return false; } if (lo < times.size()-1) { hi = lo+1; } if (debug) { if (hi == -1) { Pout<< "findTime : Found time " << timeVal << " after" << " index:" << lo << " time:" << times[lo].value() << endl; } else { Pout<< "findTime : Found time " << timeVal << " in between" << " index:" << lo << " time:" << times[lo].value() << " and index:" << hi << " time:" << times[hi].value() << endl; } } return true; } // ************************************************************************* //