49 #ifndef booleanSurface_H
50 #define booleanSurface_H
62 class triSurfaceSearch;
63 class intersectedSurface;
98 static void checkIncluded
102 const label includedFace
109 static label findEdge
117 static label findNearest
135 static void propagateEdgeSide
138 const label prevVert0,
139 const label prevFacei,
140 const label prevState,
147 static void propagateSide
150 const label prevState,
187 const label includeFace1,
188 const label includeFace2
199 const label booleanOp
214 return faceMap_[facei] >= 0;
222 <<
"face " << facei <<
" not from surface 1"
225 return faceMap_[facei];
233 <<
"face " << facei <<
" not from surface 2"
236 return -faceMap_[facei]-1;
const edgeList & edges() const
Return list of edges, address into LOCAL point list.
Surface-surface intersection. Given two surfaces construct combined surface.
bool surf2Face(const label facei) const
bool surf1Face(const label facei) const
booleanSurface()
Construct null.
booleanOpType
Enumeration listing the possible volume operator types.
ClassName("booleanSurface")
bool from1(const label facei) const
const labelList & faceMap() const
New to old face map. >0: surface 1 face label. <0: surface 2. Negate.
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
A subset of mesh faces organised as a primitive patch.
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.
#define FatalErrorInFunction
Report an error message using Foam::FatalError.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
errorManip< error > abort(error &err)