File size: 14,997 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 | /*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Copyright (C) 2011-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 <http://www.gnu.org/licenses/>.
Class
Foam::PrimitivePatch
Description
A list of faces which address into the list of points.
The class is templated on the face type (e.g. triangle, polygon etc.)
and on the list type of faces and points so that it can refer to
existing lists using UList and const pointField& or hold the storage
using List and pointField.
SourceFiles
PrimitivePatchAddressing.C
PrimitivePatchBdryPoints.C
PrimitivePatch.C
PrimitivePatchCheck.C
PrimitivePatchClear.C
PrimitivePatchEdgeLoops.C
PrimitivePatchLocalPointOrder.C
PrimitivePatchMeshData.C
PrimitivePatchMeshEdges.C
PrimitivePatchName.C
PrimitivePatchPointAddressing.C
PrimitivePatchProjectPoints.C
\*---------------------------------------------------------------------------*/
#ifndef PrimitivePatch_H
#define PrimitivePatch_H
#include "boolList.H"
#include "labelList.H"
#include "edgeList.H"
#include "point.H"
#include "intersection.H"
#include "HashSet.H"
#include "Map.H"
#include "objectHit.H"
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
namespace Foam
{
/*---------------------------------------------------------------------------*\
Class PrimitivePatchName Declaration
\*---------------------------------------------------------------------------*/
TemplateName(PrimitivePatch);
/*---------------------------------------------------------------------------*\
Class PrimitivePatch Declaration
\*---------------------------------------------------------------------------*/
template<class FaceList, class PointField>
class PrimitivePatch
:
public PrimitivePatchName,
public FaceList
{
public:
// Public Typedefs
typedef FaceList FaceListType;
typedef typename std::remove_reference<FaceList>::type::value_type
FaceType;
typedef PointField PointFieldType;
typedef typename std::remove_reference<PointField>::type::value_type
PointType;
// Public data types
//- Enumeration defining the surface type. Used in check routines.
enum surfaceTopo
{
MANIFOLD,
OPEN,
ILLEGAL
};
private:
// Private Data
//- Reference to global list of points
PointField points_;
// Demand driven private data
//- Edges of the patch; address into local point list;
// sorted with internal edges first in upper-triangular order
// and external edges last.
mutable edgeList* edgesPtr_;
//- Which part of edgesPtr_ is internal edges.
mutable label nInternalEdges_;
//- Boundary point labels, addressing into local point list
mutable labelList* boundaryPointsPtr_;
//- Face-face addressing
mutable labelListList* faceFacesPtr_;
//- Edge-face addressing
mutable labelListList* edgeFacesPtr_;
//- Face-edge addressing
mutable labelListList* faceEdgesPtr_;
//- Point-edge addressing
mutable labelListList* pointEdgesPtr_;
//- Point-face addressing
mutable labelListList* pointFacesPtr_;
//- Faces addressing into local point list
mutable List<FaceType>* localFacesPtr_;
//- Labels of mesh points
mutable labelList* meshPointsPtr_;
//- Mesh point map. Given the global point index find its
// location in the patch
mutable Map<label>* meshPointMapPtr_;
//- Outside edge loops
mutable labelListList* edgeLoopsPtr_;
//- Points local to patch
mutable Field<PointType>* localPointsPtr_;
//- Local point order for most efficient search
mutable labelList* localPointOrderPtr_;
//- Face centres
mutable Field<PointType>* faceCentresPtr_;
//- Face areas
mutable Field<PointType>* faceAreasPtr_;
//- Face unit normals
mutable Field<PointType>* faceNormalsPtr_;
//- Point unit normals
mutable Field<PointType>* pointNormalsPtr_;
// Private Member Functions
//- Calculate edges of the patch
void calcIntBdryEdges() const;
//- Calculated boundary points on a patch
void calcBdryPoints() const;
//- Calculate addressing
void calcAddressing() const;
//- Calculate point-edge addressing
void calcPointEdges() const;
//- Calculate point-face addressing
void calcPointFaces() const;
//- Calculate mesh addressing
void calcMeshData() const;
//- Calculate mesh point map
void calcMeshPointMap() const;
//- Calculate outside edge loops
void calcEdgeLoops() const;
//- Calculate local points
void calcLocalPoints() const;
//- Calculate local point order
void calcLocalPointOrder() const;
//- Calculate face centres
void calcFaceCentres() const;
//- Calculate face areas
void calcFaceAreas() const;
//- Calculate unit face normals
void calcFaceNormals() const;
//- Calculate unit point normals
void calcPointNormals() const;
//- Calculate edge owner
void calcEdgeOwner() const;
//- Face-edge-face walk while remaining on a patch point.
// Used to determine if surface multiply connected through point.
void visitPointRegion
(
const label pointi,
const labelList& pFaces,
const label startFacei,
const label startEdgeI,
boolList& pFacesHad
) const;
public:
// Constructors
//- Construct from components
PrimitivePatch
(
const FaceList& faces,
const Field<PointType>& points
);
//- Move constructor from components
PrimitivePatch
(
FaceList&& faces,
Field<PointType>&& points
);
//- Construct from components, reuse storage
PrimitivePatch
(
FaceList& faces,
Field<PointType>& points,
const bool reuse
);
//- Copy constructor
PrimitivePatch
(
const PrimitivePatch<FaceList, PointField>&
);
//- Move constructor
PrimitivePatch
(
PrimitivePatch<FaceList, PointField>&&
);
//- Construct and return a clone
autoPtr<PrimitivePatch<FaceList, PointField>> clone() const
{
return autoPtr<PrimitivePatch<FaceList, PointField>>
(
new PrimitivePatch<FaceList, PointField>(*this)
);
}
//- Destructor
~PrimitivePatch();
// Member Functions
// Access
//- Return reference to global points
const Field<PointType>& points() const
{
return points_;
}
// Access functions for Topological data; no mesh required.
//- Return number of points supporting patch faces
label nPoints() const
{
return meshPoints().size();
}
//- Return number of edges in patch
label nEdges() const
{
return edges().size();
}
//- Return list of edges, address into LOCAL point list
const edgeList& edges() const;
//- Number of internal edges
label nInternalEdges() const;
//- Is internal edge?
bool isInternalEdge(const label edgeI) const
{
return edgeI < nInternalEdges();
}
//- Return list of boundary points,
// address into LOCAL point list
const labelList& boundaryPoints() const;
//- Return face-face addressing
const labelListList& faceFaces() const;
//- Return edge-face addressing
const labelListList& edgeFaces() const;
//- Return face-edge addressing
const labelListList& faceEdges() const;
//- Return point-edge addressing
const labelListList& pointEdges() const;
//- Return point-face addressing
const labelListList& pointFaces() const;
//- Return patch faces addressing into local point list
const List<FaceType>& localFaces() const;
// Addressing into mesh
//- Return labelList of mesh points in patch. They are constructed
// walking through the faces in incremental order and not sorted
// anymore.
const labelList& meshPoints() const;
//- Mesh point map. Given the global point index find its
// location in the patch
const Map<label>& meshPointMap() const;
//- Return pointField of points in patch
const Field<PointType>& localPoints() const;
//- Return orders the local points for most efficient search
const labelList& localPointOrder() const;
//- Given a global point index, return the local point index.
// If the point is not found, return -1
label whichPoint(const label gp) const;
//- Given an edge in local point labels, return its
// index in the edge list. If the edge is not found, return -1
label whichEdge(const edge&) const;
//- Return labels of patch edges in the global edge list using
// cell addressing
labelList meshEdges
(
const edgeList& allEdges,
const labelListList& cellEdges,
const labelList& faceCells
) const;
//- Return labels of patch edges in the global edge list using
// basic edge addressing.
labelList meshEdges
(
const edgeList& allEdges,
const labelListList& pointEdges
) const;
//- Return face centres for patch
const Field<PointType>& faceCentres() const;
//- Return face areas for patch
const Field<PointType>& faceAreas() const;
//- Return face normals for patch
const Field<PointType>& faceNormals() const;
//- Return point normals for patch
const Field<PointType>& pointNormals() const;
// Other patch operations
//- Project vertices of patch onto another patch
template<class ToPatch>
List<objectHit> projectPoints
(
const ToPatch& targetPatch,
const Field<PointType>& projectionDirection,
const intersection::algorithm =
intersection::algorithm::fullRay,
const intersection::direction =
intersection::direction::vector
) const;
//- Project vertices of patch onto another patch
template<class ToPatch>
List<objectHit> projectFaceCentres
(
const ToPatch& targetPatch,
const Field<PointType>& projectionDirection,
const intersection::algorithm =
intersection::algorithm::fullRay,
const intersection::direction =
intersection::direction::vector
) const;
//- Return list of closed loops of boundary vertices.
// Edge loops are given as ordered lists of vertices
// in local addressing
const labelListList& edgeLoops() const;
// Check
//- Calculate surface type formed by patch.
// Types:
// - all edges have two neighbours (manifold)
// - some edges have more than two neighbours (illegal)
// - other (open)
surfaceTopo surfaceType() const;
//- Check surface formed by patch for manifoldness (see above).
// Return true if any incorrect edges are found.
// Insert vertices of incorrect edges into set.
bool checkTopology
(
const bool report = false,
labelHashSet* setPtr = nullptr
) const;
//- Checks primitivePatch for faces sharing point but not edge.
// This denotes a surface that is pinched at a single point
// (test for pinched at single edge is already in PrimitivePatch)
// Returns true if this situation found and puts conflicting
// (mesh)point in set. Based on all the checking routines in
// primitiveMesh.
bool checkPointManifold
(
const bool report = false,
labelHashSet* setPtr = nullptr
) const;
// Edit
void clearOut();
void clearGeom();
void clearTopology();
void clearPatchMeshAddr();
// Member Operators
//- Assignment operator
void operator=
(
const PrimitivePatch<FaceList, PointField>&
);
//- Move assignment operator
void operator=
(
PrimitivePatch<FaceList, PointField>&&
);
};
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
} // End namespace Foam
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
#ifdef NoRepository
#include "PrimitivePatch.C"
#endif
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
#endif
// ************************************************************************* //
|