Go to the documentation of this file.
52 #ifndef booleanSurface_H
53 #define booleanSurface_H
65 class triSurfaceSearch;
66 class intersectedSurface;
101 static void checkIncluded
105 const label includedFace
109 static label index(
const labelList& elems,
const label elem);
112 static label findEdge
120 static label findNearest
138 static void propagateEdgeSide
141 const label prevVert0,
142 const label prevFacei,
143 const label prevState,
150 static void propagateSide
153 const label prevState,
195 const label includeFace1,
196 const label includeFace2
207 const label booleanOp
222 return faceMap_[facei] >= 0;
230 <<
"face " << facei <<
" not from surface 1"
233 return faceMap_[facei];
241 <<
"face " << facei <<
" not from surface 2"
244 return -faceMap_[facei]-1;
const edgeList & edges() const
ClassName("booleanSurface")
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
static const Enum< booleanOpType > booleanOpTypeNames
bool surf1Face(const label facei) const
Given triSurface and intersection creates the intersected (properly triangulated) surface....
Basic surface-surface intersection description. Constructed from two surfaces it creates a descriptio...
Triangulated surface description with patch information.
A subset of mesh faces organised as a primitive patch.
Surface-surface intersection. Given two surfaces construct combined surface.
const labelList & faceMap() const
bool from1(const label facei) const
errorManip< error > abort(error &err)
#define FatalErrorInFunction
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
bool surf2Face(const label facei) const
const dimensionedScalar e