156 lines
4.1 KiB
C
156 lines
4.1 KiB
C
/*---------------------------------------------------------------------------*\
|
|
========= |
|
|
\\ / F ield | foam-extend: Open Source CFD
|
|
\\ / O peration |
|
|
\\ / A nd | For copyright notice see file Copyright
|
|
\\/ M anipulation |
|
|
-------------------------------------------------------------------------------
|
|
License
|
|
This file is part of foam-extend.
|
|
|
|
foam-extend 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.
|
|
|
|
foam-extend 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 foam-extend. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
Application
|
|
datToFoam
|
|
|
|
Description
|
|
Reads in a datToFoam mesh file and outputs a points file. Used in
|
|
conjunction with blockMesh.
|
|
|
|
\*---------------------------------------------------------------------------*/
|
|
|
|
#include "argList.H"
|
|
#include "objectRegistry.H"
|
|
#include "Time.H"
|
|
#include "IFstream.H"
|
|
#include "OFstream.H"
|
|
#include "meshTools.H"
|
|
#include "polyMesh.H"
|
|
#include "wallPolyPatch.H"
|
|
#include "symmetryPolyPatch.H"
|
|
#include "preservePatchTypes.H"
|
|
#include "cellShape.H"
|
|
#include "cellModeller.H"
|
|
#include "mergePoints.H"
|
|
#include "mathematicalConstants.H"
|
|
|
|
using namespace Foam;
|
|
|
|
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
|
|
// Main program:
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
argList::noParallel();
|
|
argList::validArgs.append("dat file");
|
|
|
|
argList args(argc, argv);
|
|
|
|
if (!args.check())
|
|
{
|
|
FatalError.exit();
|
|
}
|
|
|
|
# include "createTime.H"
|
|
|
|
std::ifstream plot3dFile(args.args()[1].c_str());
|
|
|
|
string line;
|
|
std::getline(plot3dFile, line);
|
|
std::getline(plot3dFile, line);
|
|
|
|
IStringStream Istring(line);
|
|
word block;
|
|
string zoneName;
|
|
token punctuation;
|
|
label iPoints;
|
|
label jPoints;
|
|
|
|
Istring >> block;
|
|
Istring >> block;
|
|
Istring >> zoneName;
|
|
Istring >> punctuation;
|
|
Istring >> block;
|
|
Istring >> iPoints;
|
|
Istring >> block;
|
|
Istring >> jPoints;
|
|
|
|
Info<< "Number of vertices in i direction = " << iPoints << endl
|
|
<< "Number of vertices in j direction = " << jPoints << endl;
|
|
|
|
// We ignore the first layer of points in i and j the biconic meshes
|
|
label nPointsij = (iPoints - 1)*(jPoints - 1);
|
|
|
|
pointField points(nPointsij, vector::zero);
|
|
|
|
for (direction comp = 0; comp < 2; comp++)
|
|
{
|
|
label p(0);
|
|
|
|
for (label j = 0; j < jPoints; j++)
|
|
{
|
|
for (label i = 0; i < iPoints; i++)
|
|
{
|
|
double coord;
|
|
plot3dFile >> coord;
|
|
|
|
// if statement ignores the first layer in i and j
|
|
if(i>0 && j>0)
|
|
{
|
|
points[p++][comp] = coord;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// correct error in biconic meshes
|
|
forAll(points, i)
|
|
{
|
|
if(points[i][1] < 1e-07)
|
|
{
|
|
points[i][1] = 0.0;
|
|
}
|
|
}
|
|
|
|
pointField pointsWedge(nPointsij*2, vector::zero);
|
|
|
|
fileName pointsFile(runTime.constantPath()/"points.tmp");
|
|
OFstream pFile(pointsFile);
|
|
|
|
scalar a(0.1*mathematicalConstant::pi/180.0);
|
|
tensor rotateZ =
|
|
tensor
|
|
(
|
|
1.0, 0.0, 0.0,
|
|
0.0, 1.0, 0.0,
|
|
0.0, -::sin(a), ::cos(a)
|
|
);
|
|
|
|
forAll(points, i)
|
|
{
|
|
pointsWedge[i] = (rotateZ & points[i]);
|
|
pointsWedge[i+nPointsij] = cmptMultiply(vector(1.0, 1.0, -1.0), pointsWedge[i]);
|
|
}
|
|
|
|
Info << "Writing points to: " << nl
|
|
<< " " << pointsFile << endl;
|
|
pFile << pointsWedge;
|
|
|
|
Info << "End" << endl;
|
|
|
|
return 0;
|
|
}
|
|
|
|
|
|
// ************************************************************************* //
|