188 lines
6.1 KiB
C++
188 lines
6.1 KiB
C++
/*---------------------------------------------------------------------------*\
|
|
========= |
|
|
\\ / F ield | foam-extend: Open Source CFD
|
|
\\ / O peration | Version: 4.1
|
|
\\ / A nd | Web: http://www.foam-extend.org
|
|
\\/ M anipulation | For copyright notice see file Copyright
|
|
-------------------------------------------------------------------------------
|
|
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/>.
|
|
|
|
Description
|
|
Create intermediate mesh files from SAMM files
|
|
|
|
\*---------------------------------------------------------------------------*/
|
|
|
|
#include "sammMesh.H"
|
|
|
|
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
|
|
|
|
void sammMesh::createPolyCells()
|
|
{
|
|
// loop through all cell faces and create connectivity. This will produce
|
|
// a global face list and will describe all cells as lists of face labels
|
|
|
|
// count the maximum number of faces and set the size of the cellPolys_
|
|
cellPolys_.setSize(cellShapes_.size());
|
|
|
|
label maxFaces = 0;
|
|
|
|
forAll (cellPolys_, cellI)
|
|
{
|
|
cell& curCell = cellPolys_[cellI];
|
|
|
|
curCell.setSize(cellFaces_[cellI].size());
|
|
|
|
forAll (curCell, fI)
|
|
{
|
|
curCell[fI] = -1;
|
|
}
|
|
|
|
maxFaces += cellFaces_[cellI].size();
|
|
}
|
|
|
|
Info << "Maximum possible number of faces in mesh: " << maxFaces << endl;
|
|
|
|
meshFaces_.setSize(maxFaces);
|
|
|
|
// set reference to point-cell addressing
|
|
const labelListList& PointCells = pointCells();
|
|
|
|
bool found = false;
|
|
|
|
nInternalFaces_ = 0;
|
|
|
|
forAll(cellFaces_, cellI)
|
|
{
|
|
// Note:
|
|
// Insertion cannot be done in one go as the faces need to be
|
|
// added into the list in the increasing order of neighbour
|
|
// cells. Therefore, all neighbours will be detected first
|
|
// and then added in the correct order.
|
|
|
|
const faceList& curFaces = cellFaces_[cellI];
|
|
|
|
// Record the neighbour cell
|
|
labelList neiCells(curFaces.size(), -1);
|
|
|
|
// Record the face of neighbour cell
|
|
labelList faceOfNeiCell(curFaces.size(), -1);
|
|
|
|
label nNeighbours = 0;
|
|
|
|
// For all faces ...
|
|
forAll(curFaces, faceI)
|
|
{
|
|
// Skip faces that have already been matched
|
|
if (cellPolys_[cellI][faceI] >= 0) continue;
|
|
|
|
found = false;
|
|
|
|
const face& curFace = curFaces[faceI];
|
|
|
|
// get the list of labels
|
|
const labelList& curPoints = curFace;
|
|
|
|
// For all points
|
|
forAll(curPoints, pointI)
|
|
{
|
|
// get the list of cells sharing this point
|
|
const labelList& curNeighbours = PointCells[curPoints[pointI]];
|
|
|
|
// For all neighbours
|
|
forAll(curNeighbours, neiI)
|
|
{
|
|
label curNei = curNeighbours[neiI];
|
|
|
|
// reject neighbours with the lower label. This should
|
|
// also reject current cell.
|
|
if (curNei > cellI)
|
|
{
|
|
// get the list of search faces
|
|
const faceList& searchFaces = cellFaces_[curNei];
|
|
|
|
forAll(searchFaces, neiFaceI)
|
|
{
|
|
if (searchFaces[neiFaceI] == curFace)
|
|
{
|
|
// match!!
|
|
found = true;
|
|
|
|
// Record the neighbour cell and face
|
|
neiCells[faceI] = curNei;
|
|
faceOfNeiCell[faceI] = neiFaceI;
|
|
nNeighbours++;
|
|
|
|
break;
|
|
}
|
|
}
|
|
if (found) break;
|
|
}
|
|
if (found) break;
|
|
}
|
|
if (found) break;
|
|
} // End of current points
|
|
} // End of current faces
|
|
|
|
// Add the faces in the increasing order of neighbours
|
|
for (label neiSearch = 0; neiSearch < nNeighbours; neiSearch++)
|
|
{
|
|
// Find the lowest neighbour which is still valid
|
|
label nextNei = -1;
|
|
label minNei = cellPolys_.size();
|
|
|
|
forAll (neiCells, ncI)
|
|
{
|
|
if (neiCells[ncI] > -1 && neiCells[ncI] < minNei)
|
|
{
|
|
nextNei = ncI;
|
|
minNei = neiCells[ncI];
|
|
}
|
|
}
|
|
|
|
if (nextNei > -1)
|
|
{
|
|
// Add the face to the list of faces
|
|
meshFaces_[nInternalFaces_] = curFaces[nextNei];
|
|
|
|
// Mark for owner
|
|
cellPolys_[cellI][nextNei] = nInternalFaces_;
|
|
|
|
// Mark for neighbour
|
|
cellPolys_[neiCells[nextNei]][faceOfNeiCell[nextNei]] =
|
|
nInternalFaces_;
|
|
|
|
// Stop the neighbour from being used again
|
|
neiCells[nextNei] = -1;
|
|
|
|
// Increment number of faces counter
|
|
nInternalFaces_++;
|
|
}
|
|
else
|
|
{
|
|
FatalErrorIn("void starMesh::createPolyCells()")
|
|
<< "Error in internal face insertion"
|
|
<< abort(FatalError);
|
|
}
|
|
}
|
|
}
|
|
|
|
// I won't reset the size of internal faces, because more faces will be
|
|
// added in createPolyBoundary()
|
|
}
|
|
|
|
|
|
// ************************************************************************* //
|