Go to the documentation of this file.
56 const edge&
e = featureEdges[feI];
60 const label eI = pEdges(
e.start(), peI);
90 const constRow fEdges = faceEdges[fLabel];
94 const label edgeI = fEdges[feI];
100 const constRow eFaces = edgeFaces[edgeI];
103 if( eFaces.size() != 2 )
106 label neiTri = eFaces[0];
107 if( neiTri == fLabel )
111 if(
surf_[fLabel].region() !=
surf_[neiTri].region() )
void append(const T &e)
Append an element at the end of the list.
label nPatches_
number of patches
#define forAll(list, i)
Loop across all elements in list.
Template functions to aid in the implementation of demand driven data.
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
Ostream & endl(Ostream &os)
Add newline and flush stream.
label size() const
Size of the active part of the list.
const edgeLongList & featureEdges() const
access to feature edges
const typedef graphRow< const VRWGraph > constRow
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
List< direction > featureEdges_
detected feature edges
#define forAllRow(graph, rowI, index)
void allocateFeatureEdges()
allocate and fill the feature edges list
const double e
Elementary charge.
labelList facetInPatch_
surface patches
void setSize(const label)
Reset size of List.
label size() const
return the number of triangles
const VRWGraph & facetEdges() const
return facet-edges addressing
const LongList< edge > & edges() const
return edges
void createPatches()
create patches bounded by a set of feature edges
const triSurf & surf_
const reference to triSurf
const VRWGraph & edgeFacets() const
return edge-facets addressing
const VRWGraph & pointEdges() const
return point-edges addressing