40 #ifndef cellFeatures_H 41 #define cellFeatures_H 86 bool faceAlignedEdge(
const label,
const label)
const;
91 const label superFacei,
92 const label thisEdgeI,
96 bool isCellFeatureEdge(
const scalar,
const label)
const;
101 const label superFacei,
105 void calcSuperFaces()
const;
Cell-face mesh analysis engine.
bool isFeatureVertex(const label facei, const label vertI) const
Is vertexI on facei used by two edges that form feature.
bool isFeatureEdge(const label edgeI) const
Is edge a feature edge (uniquely determined since on cell.
void operator=(const cellFeatures &)=delete
Disallow default bitwise assignment.
const labelHashSet & featureEdge() const
const List< DynamicList< label > > & faceMap() const
New to old faceMap. Guaranteed to be shrunk.
bool found(const Key &) const
Return true if hashedEntry is found in table.
~cellFeatures()
Destructor.
const faceList & faces() const
bool isFeaturePoint(const label edge0, const label edge1) const
Are two edges connected at feature point?
cellFeatures(const primitiveMesh &, const scalar minCos, const label celli)
Construct from cell in mesh.