Go to the documentation of this file.
54 #ifndef PrimitivePatch_H
55 #define PrimitivePatch_H
71 template<
class T>
class Map;
87 template<
class>
class FaceList,
93 public PrimitivePatchName,
132 mutable label nInternalEdges_;
190 void calcIntBdryEdges()
const;
193 void calcBdryPoints()
const;
196 void calcAddressing()
const;
199 void calcPointEdges()
const;
202 void calcPointFaces()
const;
205 void calcMeshData()
const;
208 void calcMeshPointMap()
const;
211 void calcEdgeLoops()
const;
214 void calcLocalPoints()
const;
217 void calcLocalPointOrder()
const;
220 void calcFaceCentres()
const;
223 void calcFaceAreas()
const;
226 void calcMagFaceAreas()
const;
229 void calcFaceNormals()
const;
232 void calcPointNormals()
const;
237 void visitPointRegion
241 const label startFacei,
242 const label startEdgeI,
254 const FaceList<Face>& faces,
261 FaceList<Face>&& faces,
268 FaceList<Face>& faces,
320 return edges().size();
426 template<
class ToPatch>
429 const ToPatch& targetPatch,
430 const Field<PointType>& projectionDirection,
436 template<
class ToPatch>
439 const ToPatch& targetPatch,
440 const Field<PointType>& projectionDirection,
465 const bool report =
false,
477 const bool report =
false,
485 virtual void movePoints(
const Field<PointType>&);
493 const PrimitivePatch<Face, FaceList, PointField, PointType>&
List< objectHit > projectFaceCentres(const ToPatch &targetPatch, const Field< PointType > &projectionDirection, const intersection::algorithm=intersection::FULL_RAY, const intersection::direction=intersection::VECTOR) const
Project vertices of patch onto another patch.
const labelListList & pointFaces() const
Return point-face addressing.
label whichPoint(const label gp) const
Given a global point index, return the local point index.
const Field< PointType > & points() const
Return reference to global points.
const labelListList & edgeFaces() const
Return edge-face addressing.
const edgeList & edges() const
Return list of edges, address into LOCAL point list.
List< objectHit > projectPoints(const ToPatch &targetPatch, const Field< PointType > &projectionDirection, const intersection::algorithm=intersection::FULL_RAY, const intersection::direction=intersection::VECTOR) const
Project vertices of patch onto another patch.
PrimitivePatch(const FaceList< Face > &faces, const Field< PointType > &points)
Construct from components.
const Field< PointType > & localPoints() const
Return pointField of points in patch.
label nEdges() const
Return number of edges in patch.
bool hasFaceCentres() const
labelList meshEdges(const edgeList &allEdges, const labelListList &cellEdges, const labelList &faceCells) const
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
virtual ~PrimitivePatch()
Destructor.
const labelListList & faceEdges() const
Return face-edge addressing.
surfaceTopo surfaceType() const
Calculate surface type formed by patch.
bool hasPointNormals() const
const Field< PointType > & faceAreas() const
Return face area vectors for patch.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
Info<< "Finished reading KIVA file"<< endl;cellShapeList cellShapes(nPoints);labelList cellZoning(nPoints, -1);const cellModel &hex=cellModel::ref(cellModel::HEX);labelList hexLabels(8);label activeCells=0;labelList pointMap(nPoints);forAll(pointMap, i){ pointMap[i]=i;}for(label i=0;i< nPoints;i++){ if(f[i] > 0.0) { hexLabels[0]=i;hexLabels[1]=i1tab[i];hexLabels[2]=i3tab[i1tab[i]];hexLabels[3]=i3tab[i];hexLabels[4]=i8tab[i];hexLabels[5]=i1tab[i8tab[i]];hexLabels[6]=i3tab[i1tab[i8tab[i]]];hexLabels[7]=i3tab[i8tab[i]];cellShapes[activeCells]=cellShape(hex, hexLabels);edgeList edges=cellShapes[activeCells].edges();forAll(edges, ei) { if(edges[ei].mag(points)< SMALL) { label start=pointMap[edges[ei].start()];while(start !=pointMap[start]) { start=pointMap[start];} label end=pointMap[edges[ei].end()];while(end !=pointMap[end]) { end=pointMap[end];} label minLabel=min(start, end);pointMap[start]=pointMap[end]=minLabel;} } cellZoning[activeCells]=idreg[i];activeCells++;}}cellShapes.setSize(activeCells);cellZoning.setSize(activeCells);forAll(cellShapes, celli){ cellShape &cs=cellShapes[celli];forAll(cs, i) { cs[i]=pointMap[cs[i]];} cs.collapse();}label bcIDs[11]={-1, 0, 2, 4, -1, 5, -1, 6, 7, 8, 9};const label nBCs=12;const word *kivaPatchTypes[nBCs]={ &wallPolyPatch::typeName, &wallPolyPatch::typeName, &wallPolyPatch::typeName, &wallPolyPatch::typeName, &symmetryPolyPatch::typeName, &wedgePolyPatch::typeName, &polyPatch::typeName, &polyPatch::typeName, &polyPatch::typeName, &polyPatch::typeName, &symmetryPolyPatch::typeName, &oldCyclicPolyPatch::typeName};enum patchTypeNames{ PISTON, VALVE, LINER, CYLINDERHEAD, AXIS, WEDGE, INFLOW, OUTFLOW, PRESIN, PRESOUT, SYMMETRYPLANE, CYCLIC};const char *kivaPatchNames[nBCs]={ "piston", "valve", "liner", "cylinderHead", "axis", "wedge", "inflow", "outflow", "presin", "presout", "symmetryPlane", "cyclic"};List< SLList< face > > pFaces[nBCs]
PointField PointFieldType
const labelListList & pointEdges() const
Return point-edge addressing.
TemplateName(blendedSchemeBase)
virtual void movePoints(const Field< PointType > &)
Correct patch after moving points.
label nPoints() const
Return number of points supporting patch faces.
surfaceTopo
Enumeration defining the surface type. Used in check routines.
FaceList< Face > FaceListType
const labelList & boundaryPoints() const
Return list of boundary points, address into LOCAL point list.
label nInternalEdges() const
Number of internal edges.
const Field< PointType > & pointNormals() const
Return point normals for patch.
List< labelList > labelListList
A List of labelList.
bool checkPointManifold(const bool report=false, labelHashSet *setPtr=nullptr) const
Checks primitivePatch for faces sharing point but not edge.
bool hasFaceAreas() const
const Field< PointType > & faceNormals() const
Return face unit normals for patch.
bool isInternalEdge(const label edgei) const
Is internal edge?
const labelListList & edgeLoops() const
Return list of closed loops of boundary vertices.
const Field< PointType > & faceCentres() const
Return face centres for patch.
const labelList & localPointOrder() const
Return orders the local points for most efficient search.
label whichEdge(const edge &) const
const Field< scalar > & magFaceAreas() const
Return face area magnitudes for patch.
const List< Face > & localFaces() const
Return patch faces addressing into local point list.
void clearPatchMeshAddr()
bool hasFaceNormals() const
vector point
Point is a vector.
const Map< label > & meshPointMap() const
Mesh point map.
const labelListList & faceFaces() const
Return face-face addressing.
HashSet< label, Hash< label > > labelHashSet
A HashSet with label keys and label hasher.
const labelList & meshPoints() const
Return labelList of mesh points in patch.
bool checkTopology(const bool report=false, labelHashSet *setPtr=nullptr) const
Check surface formed by patch for manifoldness (see above).
void swap(PrimitivePatch &)=delete
Suppress direct swapping, since storage containers may be const.
Smooth ATC in cells next to a set of patches supplied by type.
A list of faces which address into the list of points.