File size: 19,180 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 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 | /*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Copyright (C) 2011-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 "primitiveMesh.H"
#include "DynamicList.H"
#include "demandDrivenData.H"
#include "SortableList.H"
#include "ListOps.H"
// * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * //
Foam::label Foam::primitiveMesh::getEdge
(
List<DynamicList<label>>& pe,
DynamicList<edge>& es,
const label pointi,
const label nextPointi
)
{
// Find connection between pointi and nextPointi
forAll(pe[pointi], ppI)
{
label eI = pe[pointi][ppI];
const edge& e = es[eI];
if (e.start() == nextPointi || e.end() == nextPointi)
{
return eI;
}
}
// Make new edge.
label edgeI = es.size();
pe[pointi].append(edgeI);
if (nextPointi != pointi)
{
// Very occasionally (e.g. blockMesh) a face can have duplicate
// vertices. Make sure we register pointEdges only once.
pe[nextPointi].append(edgeI);
}
if (pointi < nextPointi)
{
es.append(edge(pointi, nextPointi));
}
else
{
es.append(edge(nextPointi, pointi));
}
return edgeI;
}
void Foam::primitiveMesh::calcEdges(const bool doFaceEdges) const
{
if (debug)
{
Pout<< "primitiveMesh::calcEdges(const bool) : "
<< "calculating edges, pointEdges and optionally faceEdges"
<< endl;
}
// It is an error to attempt to recalculate edges
// if the pointer is already set
if ((edgesPtr_ || pePtr_) || (doFaceEdges && fePtr_))
{
FatalErrorInFunction
<< "edges or pointEdges or faceEdges already calculated"
<< abort(FatalError);
}
else
{
// ALGORITHM:
// Go through the faces list. Search pointEdges for existing edge.
// If not found create edge and add to pointEdges.
// In second loop sort edges in order of increasing neighbouring
// point.
// This algorithm replaces the one using pointFaces which used more
// allocations but less memory and was on practical cases
// quite a bit slower.
const faceList& fcs = faces();
// Size up lists
// ~~~~~~~~~~~~~
// Estimate pointEdges storage
List<DynamicList<label>> pe(nPoints());
forAll(pe, pointi)
{
pe[pointi].setCapacity(primitiveMesh::edgesPerPoint_);
}
// Estimate edges storage
DynamicList<edge> es(pe.size()*primitiveMesh::edgesPerPoint_/2);
// Estimate faceEdges storage
if (doFaceEdges)
{
fePtr_ = new labelListList(fcs.size());
labelListList& faceEdges = *fePtr_;
forAll(fcs, facei)
{
faceEdges[facei].setSize(fcs[facei].size());
}
}
// Find consecutive face points in edge list
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// Edges on boundary faces
label nExtEdges = 0;
// Edges using no boundary point
nInternal0Edges_ = 0;
// Edges using 1 boundary point
label nInt1Edges = 0;
// Edges using two boundary points but not on boundary face:
// edges.size()-nExtEdges-nInternal0Edges_-nInt1Edges
// Ordering is different if points are ordered.
if (nInternalPoints_ == -1)
{
// No ordering. No distinction between types.
forAll(fcs, facei)
{
const face& f = fcs[facei];
forAll(f, fp)
{
label pointi = f[fp];
label nextPointi = f[f.fcIndex(fp)];
label edgeI = getEdge(pe, es, pointi, nextPointi);
if (doFaceEdges)
{
(*fePtr_)[facei][fp] = edgeI;
}
}
}
// Assume all edges internal
nExtEdges = 0;
nInternal0Edges_ = es.size();
nInt1Edges = 0;
}
else
{
// 1. Do external faces first. This creates external edges.
for (label facei = nInternalFaces_; facei < fcs.size(); facei++)
{
const face& f = fcs[facei];
forAll(f, fp)
{
label pointi = f[fp];
label nextPointi = f[f.fcIndex(fp)];
label oldNEdges = es.size();
label edgeI = getEdge(pe, es, pointi, nextPointi);
if (es.size() > oldNEdges)
{
nExtEdges++;
}
if (doFaceEdges)
{
(*fePtr_)[facei][fp] = edgeI;
}
}
}
// 2. Do internal faces. This creates internal edges.
for (label facei = 0; facei < nInternalFaces_; facei++)
{
const face& f = fcs[facei];
forAll(f, fp)
{
label pointi = f[fp];
label nextPointi = f[f.fcIndex(fp)];
label oldNEdges = es.size();
label edgeI = getEdge(pe, es, pointi, nextPointi);
if (es.size() > oldNEdges)
{
if (pointi < nInternalPoints_)
{
if (nextPointi < nInternalPoints_)
{
nInternal0Edges_++;
}
else
{
nInt1Edges++;
}
}
else
{
if (nextPointi < nInternalPoints_)
{
nInt1Edges++;
}
else
{
// Internal edge with two points on boundary
}
}
}
if (doFaceEdges)
{
(*fePtr_)[facei][fp] = edgeI;
}
}
}
}
// For unsorted meshes the edges will be in order of occurrence inside
// the faces. For sorted meshes the first nExtEdges will be the external
// edges.
if (nInternalPoints_ != -1)
{
nInternalEdges_ = es.size()-nExtEdges;
nInternal1Edges_ = nInternal0Edges_+nInt1Edges;
// Pout<< "Edge overview:" << nl
// << " total number of edges : " << es.size()
// << nl
// << " boundary edges : " << nExtEdges
// << nl
// << " edges using no boundary point : "
// << nInternal0Edges_
// << nl
// << " edges using one boundary points : " << nInt1Edges
// << nl
// << " edges using two boundary points : "
// << es.size()-nExtEdges-nInternal0Edges_-nInt1Edges << endl;
}
// Like faces sort edges in order of increasing neighbouring point.
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// Automatically if points are sorted into internal and external points
// the edges will be sorted into
// - internal point to internal point
// - internal point to external point
// - external point to external point
// The problem is that the last one mixes external edges with internal
// edges with two points on the boundary.
// Map to sort into new upper-triangular order
labelList oldToNew(es.size());
if (debug)
{
oldToNew = -1;
}
// start of edges with 0 boundary points
label internal0EdgeI = 0;
// start of edges with 1 boundary points
label internal1EdgeI = nInternal0Edges_;
// start of edges with 2 boundary points
label internal2EdgeI = nInternal1Edges_;
// start of external edges
label externalEdgeI = nInternalEdges_;
// To sort neighbouring points in increasing order. Defined outside
// for optimisation reasons: if all connectivity size same will need
// no reallocations
SortableList<label> nbrPoints(primitiveMesh::edgesPerPoint_);
forAll(pe, pointi)
{
const DynamicList<label>& pEdges = pe[pointi];
nbrPoints.setSize(pEdges.size());
forAll(pEdges, i)
{
const edge& e = es[pEdges[i]];
label nbrPointi = e.otherVertex(pointi);
if (nbrPointi < pointi)
{
nbrPoints[i] = -1;
}
else
{
nbrPoints[i] = nbrPointi;
}
}
nbrPoints.sort();
if (nInternalPoints_ == -1)
{
// Sort all upper-triangular
forAll(nbrPoints, i)
{
if (nbrPoints[i] != -1)
{
label edgeI = pEdges[nbrPoints.indices()[i]];
oldToNew[edgeI] = internal0EdgeI++;
}
}
}
else
{
if (pointi < nInternalPoints_)
{
forAll(nbrPoints, i)
{
label nbrPointi = nbrPoints[i];
label edgeI = pEdges[nbrPoints.indices()[i]];
if (nbrPointi != -1)
{
if (edgeI < nExtEdges)
{
// External edge
oldToNew[edgeI] = externalEdgeI++;
}
else if (nbrPointi < nInternalPoints_)
{
// Both points inside
oldToNew[edgeI] = internal0EdgeI++;
}
else
{
// One points inside, one outside
oldToNew[edgeI] = internal1EdgeI++;
}
}
}
}
else
{
forAll(nbrPoints, i)
{
label nbrPointi = nbrPoints[i];
label edgeI = pEdges[nbrPoints.indices()[i]];
if (nbrPointi != -1)
{
if (edgeI < nExtEdges)
{
// External edge
oldToNew[edgeI] = externalEdgeI++;
}
else if (nbrPointi < nInternalPoints_)
{
// Not possible!
FatalErrorInFunction
<< abort(FatalError);
}
else
{
// Both points outside
oldToNew[edgeI] = internal2EdgeI++;
}
}
}
}
}
}
if (debug)
{
label edgeI = findIndex(oldToNew, -1);
if (edgeI != -1)
{
const edge& e = es[edgeI];
FatalErrorInFunction
<< "Did not sort edge " << edgeI << " points:" << e
<< " coords:" << points()[e[0]] << points()[e[1]]
<< endl
<< "Current buckets:" << endl
<< " internal0EdgeI:" << internal0EdgeI << endl
<< " internal1EdgeI:" << internal1EdgeI << endl
<< " internal2EdgeI:" << internal2EdgeI << endl
<< " externalEdgeI:" << externalEdgeI << endl
<< abort(FatalError);
}
}
// Renumber and transfer.
// Edges
edgesPtr_ = new edgeList(es.size());
edgeList& edges = *edgesPtr_;
forAll(es, edgeI)
{
edges[oldToNew[edgeI]] = es[edgeI];
}
// pointEdges
pePtr_ = new labelListList(nPoints());
labelListList& pointEdges = *pePtr_;
forAll(pe, pointi)
{
DynamicList<label>& pEdges = pe[pointi];
pEdges.shrink();
inplaceRenumber(oldToNew, pEdges);
pointEdges[pointi].transfer(pEdges);
Foam::sort(pointEdges[pointi]);
}
// faceEdges
if (doFaceEdges)
{
labelListList& faceEdges = *fePtr_;
forAll(faceEdges, facei)
{
inplaceRenumber(oldToNew, faceEdges[facei]);
}
}
}
}
Foam::label Foam::primitiveMesh::findFirstCommonElementFromSortedLists
(
const labelList& list1,
const labelList& list2
)
{
label result = -1;
labelList::const_iterator iter1 = list1.begin();
labelList::const_iterator iter2 = list2.begin();
while (iter1 != list1.end() && iter2 != list2.end())
{
if (*iter1 < *iter2)
{
++iter1;
}
else if (*iter1 > *iter2)
{
++iter2;
}
else
{
result = *iter1;
break;
}
}
if (result == -1)
{
FatalErrorInFunction
<< "No common elements in lists " << list1 << " and " << list2
<< abort(FatalError);
}
return result;
}
// * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
const Foam::edgeList& Foam::primitiveMesh::edges() const
{
if (!edgesPtr_)
{
// calcEdges(true);
calcEdges(false);
}
return *edgesPtr_;
}
const Foam::labelListList& Foam::primitiveMesh::pointEdges() const
{
if (!pePtr_)
{
// calcEdges(true);
calcEdges(false);
}
return *pePtr_;
}
const Foam::labelListList& Foam::primitiveMesh::faceEdges() const
{
if (!fePtr_)
{
if (debug)
{
Pout<< "primitiveMesh::faceEdges() : "
<< "calculating faceEdges" << endl;
}
// calcEdges(true);
const faceList& fcs = faces();
const labelListList& pe = pointEdges();
const edgeList& es = edges();
fePtr_ = new labelListList(fcs.size());
labelListList& faceEdges = *fePtr_;
forAll(fcs, facei)
{
const face& f = fcs[facei];
labelList& fEdges = faceEdges[facei];
fEdges.setSize(f.size());
forAll(f, fp)
{
label pointi = f[fp];
label nextPointi = f[f.fcIndex(fp)];
// Find edge between pointi, nextPontI
const labelList& pEdges = pe[pointi];
forAll(pEdges, i)
{
label edgeI = pEdges[i];
if (es[edgeI].otherVertex(pointi) == nextPointi)
{
fEdges[fp] = edgeI;
break;
}
}
}
}
}
return *fePtr_;
}
void Foam::primitiveMesh::clearOutEdges()
{
deleteDemandDrivenData(edgesPtr_);
deleteDemandDrivenData(pePtr_);
deleteDemandDrivenData(fePtr_);
labels_.clear();
labelSet_.clear();
}
const Foam::labelList& Foam::primitiveMesh::faceEdges
(
const label facei,
DynamicList<label>& storage
) const
{
if (fePtr_)
{
return faceEdges()[facei];
}
else
{
const labelListList& pointEs = pointEdges();
const face& f = faces()[facei];
storage.clear();
if (f.size() > storage.capacity())
{
storage.setCapacity(f.size());
}
forAll(f, fp)
{
storage.append
(
findFirstCommonElementFromSortedLists
(
pointEs[f[fp]],
pointEs[f.nextLabel(fp)]
)
);
}
return storage;
}
}
const Foam::labelList& Foam::primitiveMesh::faceEdges(const label facei) const
{
return faceEdges(facei, labels_);
}
const Foam::labelList& Foam::primitiveMesh::cellEdges
(
const label celli,
DynamicList<label>& storage
) const
{
if (cePtr_)
{
return cellEdges()[celli];
}
else
{
const labelList& cFaces = cells()[celli];
labelSet_.clear();
forAll(cFaces, i)
{
const labelList& fe = faceEdges(cFaces[i]);
forAll(fe, feI)
{
labelSet_.insert(fe[feI]);
}
}
storage.clear();
if (labelSet_.size() > storage.capacity())
{
storage.setCapacity(labelSet_.size());
}
forAllConstIter(labelHashSet, labelSet_, iter)
{
storage.append(iter.key());
}
return storage;
}
}
const Foam::labelList& Foam::primitiveMesh::cellEdges(const label celli) const
{
return cellEdges(celli, labels_);
}
// ************************************************************************* //
|