Surface-surface intersection. Given two surfaces construct combined surface. More...
#include <meshTools/booleanSurface.H>
Surface-surface intersection. Given two surfaces construct combined surface.
Called 'boolean' since the volume of resulting surface will encompass the volumes of the original surface according to some boolean operation:
Algorithm:
Definition at line 69 of file booleanSurface.H.
Public Types | |
enum | booleanOpType { OR, AND, XOR, ALL } |
Enumeration listing the possible volume operator types. More... | |
![]() | |
typedef bool | BoundaryMesh |
Placeholder only, but do not remove - it is needed for GeoMesh. | |
![]() | |
enum | surfaceTopo |
Enumeration defining the surface type. Used in check routines. More... | |
typedef labelledTri | FaceType |
typedef ::Foam::List< labelledTri > | FaceListType |
typedef pointField | PointFieldType |
![]() | |
typedef SubList< labelledTri > | subList |
Declare type of subList. | |
![]() | |
typedef labelledTri | value_type |
Type of values the UList contains. | |
typedef labelledTri & | reference |
Type that can be used for storing into. | |
typedef const labelledTri & | const_reference |
Type that can be used for storing into. | |
typedef label | difference_type |
The type that can represent the difference between any two. | |
typedef label | size_type |
The type that can represent the size of a UList. | |
typedef labelledTri * | iterator |
Random access iterator for traversing UList. | |
typedef const labelledTri * | const_iterator |
Random access iterator for traversing UList. | |
typedef labelledTri * | reverse_iterator |
Reverse iterator for reverse traversal of UList. | |
typedef const labelledTri * | const_reverse_iterator |
Reverse iterator for reverse traversal of constant UList. |
Public Member Functions | |
ClassName ("booleanSurface") | |
booleanSurface () | |
Construct null. | |
booleanSurface (const triSurface &surf1, const triSurface &surf2, const surfaceIntersection &inter, const label includeFace1, const label includeFace2) | |
Construct from surfaces and face labels to keep. | |
booleanSurface (const triSurface &surf1, const triSurface &surf2, const surfaceIntersection &inter, const label booleanOp) | |
Construct from surfaces and operation. Surfaces need to be closed. | |
const labelList & | faceMap () const |
new to old face map. >0: surface 1 face label. <0: surface 2. Negate | |
bool | from1 (const label faceI) const |
bool | surf1Face (const label faceI) const |
bool | surf2Face (const label faceI) const |
![]() | |
ClassName ("triSurface") | |
Runtime type information. | |
triSurface () | |
Construct null. | |
triSurface (const List< labelledTri > &, const geometricSurfacePatchList &, const pointField &) | |
Construct from triangles, patches, points. | |
triSurface (List< labelledTri > &, const geometricSurfacePatchList &, pointField &, const bool reUse) | |
Construct from triangles, patches, points. Reuse storage. | |
triSurface (const List< labelledTri > &, const pointField &) | |
Construct from triangles, points. Set patchnames to default. | |
triSurface (const triFaceList &, const pointField &) | |
Construct from triangles, points. Set region to 0 and default. | |
triSurface (const fileName &) | |
Construct from file name (uses extension to determine type) | |
triSurface (Istream &) | |
Construct from Istream. | |
triSurface (const Time &d) | |
Construct from objectRegistry. | |
triSurface (const triSurface &) | |
Construct as copy. | |
~triSurface () | |
void | clearOut () |
void | clearTopology () |
void | clearPatchMeshAddr () |
const geometricSurfacePatchList & | patches () const |
geometricSurfacePatchList & | patches () |
const labelListList & | sortedEdgeFaces () const |
Return edge-face addressing sorted (for edges with more than. | |
const labelList & | edgeOwner () const |
If 2 face neighbours: label of face where ordering of edge. | |
virtual void | movePoints (const pointField &) |
Move points. | |
virtual void | scalePoints (const scalar &) |
Scale points. A non-positive factor is ignored. | |
void | checkTriangles (const bool verbose) |
Check/remove duplicate/degenerate triangles. | |
void | checkEdges (const bool verbose) |
Check triply (or more) connected edges. | |
void | cleanup (const bool verbose) |
Remove non-valid triangles. | |
void | markZone (const boolList &borderEdge, const label faceI, const label currentZone, labelList &faceZone) const |
Fill faceZone with currentZone for every face reachable. | |
label | markZones (const boolList &borderEdge, labelList &faceZone) const |
(size and) fills faceZone with zone of face. Zone is area | |
void | subsetMeshMap (const boolList &include, labelList &pointMap, labelList &faceMap) const |
'Create' sub mesh, including only faces for which | |
triSurface | subsetMesh (const boolList &include, labelList &pointMap, labelList &faceMap) const |
Return new surface. Returns pointMap, faceMap from. | |
void | write (Ostream &) const |
Write to Ostream in simple FOAM format. | |
void | write (const fileName &, const bool sortByRegion=false) const |
Generic write routine. Chooses writer based on extension. | |
void | write (const Time &) const |
Write to database. | |
void | writeDX (const scalarField &, Ostream &) const |
Write to Ostream in OpenDX format. | |
void | writeDX (const vectorField &, Ostream &) const |
void | writeStats (Ostream &) const |
Write some statistics. | |
void | operator= (const triSurface &) |
![]() | |
PrimitivePatch (const ::Foam::List< labelledTri > &faces, const Field< point > &points) | |
Construct from components. | |
PrimitivePatch (::Foam::List< labelledTri > &faces, Field< point > &points, const bool reUse) | |
Construct from components, reuse storage. | |
PrimitivePatch (const PrimitivePatch< labelledTri,::Foam::List, pointField, point > &) | |
Construct as copy. | |
virtual | ~PrimitivePatch () |
void | clearGeom () |
const Field< point > & | points () const |
Return reference to global points. | |
label | nPoints () const |
Return number of points supporting patch faces. | |
label | nEdges () const |
Return number of edges in patch. | |
const edgeList & | edges () const |
Return list of edges, address into LOCAL point list. | |
label | nInternalEdges () const |
Number of internal edges. | |
bool | isInternalEdge (const label edgeI) const |
Is internal edge? | |
const labelList & | boundaryPoints () const |
Return list of boundary points,. | |
const labelListList & | faceFaces () const |
Return face-face addressing. | |
const labelListList & | edgeFaces () const |
Return edge-face addressing. | |
const labelListList & | faceEdges () const |
Return face-edge addressing. | |
const labelListList & | pointEdges () const |
Return point-edge addressing. | |
const labelListList & | pointFaces () const |
Return point-face addressing. | |
const List< labelledTri > & | localFaces () const |
Return patch faces addressing into local point list. | |
const labelList & | meshPoints () const |
Return labelList of mesh points in patch. They are constructed. | |
const Map< label > & | meshPointMap () const |
Mesh point map. Given the global point index find its. | |
const Field< point > & | localPoints () const |
Return pointField of points in patch. | |
const labelList & | localPointOrder () const |
Return orders the local points for most efficient search. | |
label | whichPoint (const label gp) const |
Given a global point index, return the local point index. | |
label | whichEdge (const edge &) const |
Given an edge in local point labels, return its. | |
labelList | meshEdges (const edgeList &allEdges, const labelListList &cellEdges, const labelList &faceCells) const |
Return labels of patch edges in the global edge list using. | |
labelList | meshEdges (const edgeList &allEdges, const labelListList &pointEdges) const |
Return labels of patch edges in the global edge list using. | |
const Field< point > & | faceCentres () const |
Return face centres for patch. | |
const Field< point > & | faceNormals () const |
Return face normals for patch. | |
const Field< point > & | pointNormals () const |
Return point normals for patch. | |
List< objectHit > | projectPoints (const ToPatch &targetPatch, const Field< point > &projectionDirection, const intersection::algorithm=intersection::FULL_RAY, const intersection::direction=intersection::VECTOR) const |
Project vertices of patch onto another patch. | |
List< objectHit > | projectFaceCentres (const ToPatch &targetPatch, const Field< point > &projectionDirection, const intersection::algorithm=intersection::FULL_RAY, const intersection::direction=intersection::VECTOR) const |
Project vertices of patch onto another patch. | |
const labelListList & | edgeLoops () const |
Return list of closed loops of boundary vertices. | |
surfaceTopo | surfaceType () const |
Calculate surface type formed by patch. | |
bool | checkTopology (const bool report=false, labelHashSet *setPtr=NULL) const |
Check surface formed by patch for manifoldness (see above). | |
bool | checkPointManifold (const bool report=false, labelHashSet *setPtr=NULL) const |
Checks primitivePatch for faces sharing point but not edge. | |
virtual void | movePoints (const Field< point > &) |
Correct patch after moving points. | |
void | operator= (const PrimitivePatch< labelledTri,::Foam::List, pointField, point > &) |
Assignment. | |
![]() | |
label | size () const |
Return the number of elements in the UList. | |
List () | |
Null constructor. | |
List (const label) | |
Construct with given size. | |
List (const label, const labelledTri &) | |
Construct with given size and value for all elements. | |
List (const List< labelledTri > &) | |
Copy constructor. | |
List (const Xfer< List< labelledTri > > &) | |
Construct by transferring the parameter contents. | |
List (List< labelledTri > &, bool reUse) | |
Construct as copy or re-use as specified. | |
List (const UList< labelledTri > &, const unallocLabelList &mapAddressing) | |
Construct as subset. | |
List (InputIterator first, InputIterator last) | |
Construct given start and end iterators. | |
List (const FixedList< labelledTri, Size > &) | |
Construct as copy of FixedList<T, Size> | |
List (const PtrList< labelledTri > &) | |
Construct as copy of PtrList<T> | |
List (const SLList< labelledTri > &) | |
Construct as copy of SLList<T> | |
List (const IndirectList< labelledTri > &) | |
Construct as copy of IndirectList<T> | |
List (const UIndirectList< labelledTri > &) | |
Construct as copy of UIndirectList<T> | |
List (const BiIndirectList< labelledTri > &) | |
Construct as copy of BiIndirectList<T> | |
List (Istream &) | |
Construct from Istream. | |
autoPtr< List< labelledTri > > | clone () const |
Clone. | |
~List () | |
void | resize (const label) |
Reset size of List. | |
void | resize (const label, const labelledTri &) |
Reset size of List and value for new elements. | |
void | setSize (const label) |
Reset size of List. | |
void | setSize (const label, const labelledTri &) |
Reset size of List and value for new elements. | |
void | clear () |
Clear the list, i.e. set size to zero. | |
void | append (const UList< labelledTri > &) |
Append a List at the end of this list. | |
void | append (const UIndirectList< labelledTri > &) |
Append a UIndirectList at the end of this list. | |
void | transfer (List< labelledTri > &) |
Transfer the contents of the argument List into this list. | |
void | transfer (DynamicList< labelledTri, SizeInc, SizeMult, SizeDiv > &) |
Transfer the contents of the argument List into this list. | |
void | transfer (SortableList< labelledTri > &) |
Transfer the contents of the argument List into this list. | |
Xfer< List< labelledTri > > | xfer () |
Transfer contents to the Xfer container. | |
labelledTri & | newElmt (const label) |
Return subscript-checked element of UList. | |
void | operator= (const UList< labelledTri > &) |
Assignment from UList operator. Takes linear time. | |
void | operator= (const List< labelledTri > &) |
Assignment operator. Takes linear time. | |
void | operator= (const SLList< labelledTri > &) |
Assignment from SLList operator. Takes linear time. | |
void | operator= (const IndirectList< labelledTri > &) |
Assignment from IndirectList operator. Takes linear time. | |
void | operator= (const UIndirectList< labelledTri > &) |
Assignment from UIndirectList operator. Takes linear time. | |
void | operator= (const BiIndirectList< labelledTri > &) |
Assignment from BiIndirectList operator. Takes linear time. | |
void | operator= (const labelledTri &) |
Assignment of all entries to the given value. | |
![]() | |
UList () | |
Null constructor. | |
UList (labelledTri *__restrict__ v, label size) | |
Construct from components. | |
label | fcIndex (const label i) const |
Return the forward circular index, i.e. the next index. | |
label | rcIndex (const label i) const |
Return the reverse circular index, i.e. the previous index. | |
label | byteSize () const |
Return the binary size in number of characters of the UList. | |
const labelledTri * | cdata () const |
Return a const pointer to the first data element,. | |
labelledTri * | data () |
Return a pointer to the first data element,. | |
void | checkStart (const label start) const |
Check start is within valid range (0 ... size-1). | |
void | checkSize (const label size) const |
Check size is within valid range (0 ... size). | |
void | checkIndex (const label i) const |
Check index i is within valid range (0 ... size-1). | |
void | writeEntry (Ostream &) const |
Write the UList as a dictionary entry. | |
void | writeEntry (const word &keyword, Ostream &) const |
Write the UList as a dictionary entry with keyword. | |
void | assign (const UList< labelledTri > &) |
Assign elements to those from UList. | |
labelledTri & | operator[] (const label) |
Return element of UList. | |
const labelledTri & | operator[] (const label) const |
Return element of constant UList. | |
operator const Foam::List< labelledTri > & () const | |
Allow cast to a const List<T>&. | |
iterator | begin () |
Return an iterator to begin traversing the UList. | |
const_iterator | begin () const |
Return const_iterator to begin traversing the constant UList. | |
iterator | end () |
Return an iterator to end traversing the UList. | |
const_iterator | end () const |
Return const_iterator to end traversing the constant UList. | |
const_iterator | cbegin () const |
Return const_iterator to begin traversing the constant UList. | |
const_iterator | cend () const |
Return const_iterator to end traversing the constant UList. | |
reverse_iterator | rbegin () |
Return reverse_iterator to begin reverse traversing the UList. | |
const_reverse_iterator | rbegin () const |
Return const_reverse_iterator to begin reverse traversing the UList. | |
reverse_iterator | rend () |
Return reverse_iterator to end reverse traversing the UList. | |
const_reverse_iterator | rend () const |
Return const_reverse_iterator to end reverse traversing the UList. | |
const_reverse_iterator | crbegin () const |
Return const_reverse_iterator to begin reverse traversing the UList. | |
const_reverse_iterator | crend () const |
Return const_reverse_iterator to end reverse traversing the UList. | |
label | max_size () const |
Return size of the largest possible UList. | |
bool | empty () const |
Return true if the UList is empty (ie, size() is zero). | |
void | swap (UList< labelledTri > &) |
Swap two ULists of the same type in constant time. | |
bool | operator== (const UList< labelledTri > &) const |
Equality operation on ULists of the same type. | |
bool | operator!= (const UList< labelledTri > &) const |
The opposite of the equality operation. Takes linear time. | |
bool | operator< (const UList< labelledTri > &) const |
Compare two ULists lexicographically. Takes linear time. | |
bool | operator> (const UList< labelledTri > &) const |
Compare two ULists lexicographically. Takes linear time. | |
bool | operator<= (const UList< labelledTri > &) const |
Return true if !(a > b). Takes linear time. | |
bool | operator>= (const UList< labelledTri > &) const |
Return true if !(a < b). Takes linear time. |
Additional Inherited Members | |
![]() | |
static fileName | triSurfInstance (const Time &) |
Name of triSurface directory to use. | |
![]() | |
pointField & | storedPoints () |
Non-const access to global points. | |
List< Face > & | storedFaces () |
Non-const access to the faces. |
enum booleanOpType |
Enumeration listing the possible volume operator types.
Definition at line 161 of file booleanSurface.H.
booleanSurface | ( | ) |
Construct null.
Definition at line 381 of file booleanSurface.C.
booleanSurface | ( | const triSurface & | surf1, |
const triSurface & | surf2, | ||
const surfaceIntersection & | inter, | ||
const label | includeFace1, | ||
const label | includeFace2 | ||
) |
Construct from surfaces and face labels to keep.
Walks from provided seed faces without crossing intersection line to determine faces to keep.
Definition at line 389 of file booleanSurface.C.
References Foam::endl(), Foam::exit(), f(), intersectedSurface::faceMap(), Foam::FatalError, FatalErrorIn, forAll, intersectedSurface::intersectionEdges(), intersectedSurface::isSurfacePoint(), triSurface::markZones(), PrimitivePatch< Face, FaceList, PointField, PointType >::nEdges(), PrimitivePatch< Face, FaceList, PointField, PointType >::nPoints(), intersectedSurface::nSurfacePoints(), UList< labelledTri >::operator, Foam::Pout, List< T >::setSize(), List< T >::size(), triSurface::subsetMesh(), triSurface::write(), and triSurface::writeStats().
booleanSurface | ( | const triSurface & | surf1, |
const triSurface & | surf2, | ||
const surfaceIntersection & | inter, | ||
const label | booleanOp | ||
) |
Construct from surfaces and operation. Surfaces need to be closed.
for this to make any sense since uses inside/outside to determine which part of combined surface to include.
Definition at line 705 of file booleanSurface.C.
References booleanSurface::ALL, booleanSurface::AND, PointHit< Point >::distance(), PrimitivePatch< Face, FaceList, PointField, PointType >::edgeFaces(), PrimitivePatch< Face, FaceList, PointField, PointType >::edges(), Foam::endl(), Foam::exit(), f(), intersectedSurface::faceMap(), Foam::FatalError, FatalErrorIn, forAll, intersectedSurface::isSurfacePoint(), PrimitivePatch< Face, FaceList, PointField, PointType >::localPoints(), Foam::nl, PrimitivePatch< Face, FaceList, PointField, PointType >::nPoints(), intersectedSurface::nSurfacePoints(), triSurface::operator=(), booleanSurface::OR, PrimitivePatch< Face, FaceList, PointField, PointType >::points(), Foam::Pout, PointHit< Point >::rawPoint(), labelledTri::region(), List< T >::setSize(), List< T >::size(), triSurface::subsetMesh(), WarningIn, triSurface::write(), triSurface::writeStats(), and Vector< scalar >::zero.
ClassName | ( | "booleanSurface" | ) |
|
inline |
new to old face map. >0: surface 1 face label. <0: surface 2. Negate
and subtract 1 to get face label on surface 2.
Definition at line 204 of file booleanSurface.H.
|
inline |
Definition at line 209 of file booleanSurface.H.
Referenced by booleanSurface::surf1Face(), and booleanSurface::surf2Face().
|
inline |
Definition at line 214 of file booleanSurface.H.
References Foam::abort(), Foam::FatalError, FatalErrorIn, and booleanSurface::from1().
|
inline |
Definition at line 225 of file booleanSurface.H.
References Foam::abort(), Foam::FatalError, FatalErrorIn, and booleanSurface::from1().