File size: 8,428 Bytes
5a600cf | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 | /*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Copyright (C) 2022-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 "cutPolyValue.H"
#include "OBJstream.H"
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
namespace Foam
{
template<class Type>
Type min(const UIndirectList<Type>& l)
{
Type result = pTraits<Type>::max;
forAll(l, i)
{
result = min(result, l[i]);
}
return result;
}
template<class Type>
Type max(const UIndirectList<Type>& l)
{
Type result = pTraits<Type>::min;
forAll(l, i)
{
result = max(result, l[i]);
}
return result;
}
}
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
Foam::List<Foam::labelPair> Foam::cutPoly::faceCuts
(
const face& f,
const scalarField& pAlphas,
const scalar isoAlpha
)
{
UIndirectList<scalar> fAlphas(pAlphas, f);
// Quick reject if all alpha values are above or below the iso value
if (min(fAlphas) > isoAlpha || isoAlpha > max(fAlphas))
{
return List<labelPair>();
}
// Find the starting point
label fpi0 = 0;
while ((fAlphas[fpi0] < isoAlpha) == separatedBelow)
{
++ fpi0;
}
// Create cuts on every edge for which there is a sign change
DynamicList<labelPair> cuts(1);
label cuti = 0;
forAll(f, i)
{
const label fpi1 = f.fcIndex(fpi0);
if ((fAlphas[fpi0] < isoAlpha) != (fAlphas[fpi1] < isoAlpha))
{
if (cuti == 0)
{
cuts.append({fpi0, -1});
}
else
{
cuts.last()[1] = fpi0;
}
cuti = !cuti;
}
fpi0 = fpi1;
}
// There should have been an even number of cuts
if (cuti != 0)
{
FatalErrorInFunction
<< "Cutting values " << fAlphas << " with iso-value " << isoAlpha
<< " resulted in an odd number of cuts"
<< exit(FatalError);
}
cuts.shrink();
return cuts;
}
Foam::labelListList Foam::cutPoly::cellCuts
(
const cell& c,
const cellEdgeAddressing& cAddr,
const faceUList& fs,
const List<List<labelPair>>& fCuts,
const scalarField& pAlphas,
const scalar isoAlpha
)
{
// Quick return if not cut
label nCellFaceCuts = 0;
forAll(c, cfi)
{
nCellFaceCuts += fCuts[c[cfi]].size();
}
if (nCellFaceCuts == 0)
{
return labelListList();
}
// Get local cell-face-edge addressing
const CompactListList<label>& cfiAndFeiToCei = cAddr.cfiAndFeiToCei();
const List<Pair<labelPair>>& ceiToCfiAndFei = cAddr.ceiToCfiAndFei();
const boolList& cOwns = cAddr.cOwns();
// For each cell-face and face-edge, get the face-edge at the other end of
// the edge's cut, or -1 if the edge is not cut. This allows us to walk
// along face cuts. It also doubles as the "visited" array during the walk.
// As cuts are visited, the relevant label in this array is set to -1 to
// ensure that the cut is not considered twice.
labelListList cellFaceAndFaceEdgeCutToFaceEdge(c.size());
forAll(c, cfi)
{
cellFaceAndFaceEdgeCutToFaceEdge[cfi] =
labelList(fs[c[cfi]].size(), -1);
forAll(fCuts[c[cfi]], fci)
{
const label fei0 = fCuts[c[cfi]][fci].first();
const label fei1 = fCuts[c[cfi]][fci].second();
if (cOwns[cfi])
{
cellFaceAndFaceEdgeCutToFaceEdge[cfi][fei0] = fei1;
}
else
{
cellFaceAndFaceEdgeCutToFaceEdge[cfi][fei1] = fei0;
}
}
}
// Walk around the face cuts to generate the cell cuts
DynamicList<labelList> cuts;
{
label nCellFaceCutsVisited = 0;
label cfi0 = 0, fei0 = 0;
while (nCellFaceCutsVisited < nCellFaceCuts)
{
// Find the next unvisited connection
bool found = false;
for (label cfj0 = cfi0; cfj0 < c.size(); ++ cfj0)
{
for (label fej0 = fei0; fej0 < fs[c[cfj0]].size(); ++ fej0)
{
const label fej1 =
cellFaceAndFaceEdgeCutToFaceEdge[cfj0][fej0];
if (fej1 != -1)
{
cfi0 = cfj0;
fei0 = fej0;
found = true;
}
if (found) break;
}
if (found) break;
fei0 = 0;
}
if (!found)
{
FatalErrorInFunction
<< "Could not find next unvisited connection for cell cut"
<< exit(FatalError);
}
// Walk around the cell from face to face to form a cut
label cfi = cfi0, fei = fei0;
DynamicList<label> cut(8);
while (cellFaceAndFaceEdgeCutToFaceEdge[cfi][fei] != -1)
{
++ nCellFaceCutsVisited;
const label otherFei =
cellFaceAndFaceEdgeCutToFaceEdge[cfi][fei];
cellFaceAndFaceEdgeCutToFaceEdge[cfi][fei] = -1;
const label cei = cfiAndFeiToCei[cfi][otherFei];
cut.append(cei);
const labelPair next =
ceiToCfiAndFei[cei].other({cfi, otherFei});
cfi = next.first();
fei = next.second();
}
// Copy the data over into the result list
cuts.append(labelList());
cuts.last().transfer(cut);
}
}
cuts.shrink();
return cuts;
}
void Foam::cutPoly::writeFaceCuts
(
const face& f,
const List<labelPair>& fCuts,
const pointField& ps,
const scalarField& pAlphas,
const scalar isoAlpha,
OBJstream& obj
)
{
forAll(fCuts, cuti)
{
pointField cutPs(2);
forAll(fCuts[cuti], i)
{
const edge e = f.faceEdge(fCuts[cuti][i]);
cutPs[i] = edgeCutValue(e, pAlphas, isoAlpha, ps);
}
obj.write(edge(0, 1), cutPs);
}
}
void Foam::cutPoly::writeCellCuts
(
const cell& c,
const cellEdgeAddressing& cAddr,
const List<List<label>>& cCuts,
const faceList& fs,
const pointField& ps,
const scalarField& pAlphas,
const scalar isoAlpha,
OBJstream& obj
)
{
// Quick return if not cut
if (cCuts.size() == 0)
{
return;
}
// Get local cell-face-edge addressing
const List<Pair<labelPair>>& ceiToCfiAndFei = cAddr.ceiToCfiAndFei();
// Write out each cut as a single face
forAll(cCuts, cuti)
{
if (cCuts[cuti].size() < 3) continue;
pointField cutPs(cCuts[cuti].size());
forAll(cCuts[cuti], i)
{
const label cei = cCuts[cuti][i];
const label cfi = ceiToCfiAndFei[cei][0][0];
const label fei = ceiToCfiAndFei[cei][0][1];
const edge e = fs[c[cfi]].faceEdge(fei);
cutPs[i] = edgeCutValue(e, pAlphas, isoAlpha, ps);
}
obj.write(face(identityMap(cCuts[cuti].size())), cutPs, false);
}
}
// ************************************************************************* //
|