Holder of intersections of edges of a surface with another surface. Optionally shuffles around points on surface to resolve any 'conflicts' (edge hitting triangle edge, edge hitting point etc.). More...
Public Member Functions | |
ClassName ("edgeIntersections") | |
edgeIntersections () | |
Construct null. More... | |
edgeIntersections (const triSurface &surf1, const triSurfaceSearch &query2, const scalarField &surf1PointTol) | |
Construct from surface and tolerance. More... | |
edgeIntersections (const List< List< pointIndexHit >> &, const labelListList &) | |
Construct from components. More... | |
const labelListList & | classification () const |
For every intersection the classification status. More... | |
label | removeDegenerates (const label nIters, const triSurface &surf1, const triSurfaceSearch &query2, const scalarField &surf1PointTol, pointField &points1) |
Resolve ties. Shuffles points so all edge - face intersections. More... | |
void | merge (const edgeIntersections &, const labelList &edgeMap, const labelList &faceMap, const bool merge=true) |
Merge (or override) edge intersection for a subset. More... | |
Public Member Functions inherited from List< List< pointIndexHit > > | |
List () | |
Null constructor. More... | |
List (const label) | |
Construct with given size. More... | |
List (const label, const List< pointIndexHit > &) | |
Construct with given size and value for all elements. More... | |
List (const label, const zero) | |
Construct with given size initializing all elements to zero. More... | |
List (const List< List< pointIndexHit > > &) | |
Copy constructor. More... | |
List (const List< T2 > &) | |
Copy constructor from list containing another type. More... | |
List (List< List< pointIndexHit > > &&) | |
Move constructor. More... | |
List (List< List< pointIndexHit > > &, bool reuse) | |
Construct as copy or re-use as specified. More... | |
List (const UList< List< pointIndexHit > > &, const labelUList &mapAddressing) | |
Construct as subset. More... | |
List (InputIterator first, InputIterator last) | |
Construct given start and end iterators. More... | |
List (const FixedList< List< pointIndexHit >, Size > &) | |
Construct as copy of FixedList<T, Size> More... | |
List (const PtrList< List< pointIndexHit > > &) | |
Construct as copy of PtrList<T> More... | |
List (const SLList< List< pointIndexHit > > &) | |
Construct as copy of SLList<T> More... | |
List (const UIndirectList< List< pointIndexHit > > &) | |
Construct as copy of UIndirectList<T> More... | |
List (const BiIndirectList< List< pointIndexHit > > &) | |
Construct as copy of BiIndirectList<T> More... | |
List (std::initializer_list< List< pointIndexHit > >) | |
Construct from an initializer list. More... | |
List (Istream &) | |
Construct from Istream. More... | |
label | size () const |
Return the number of elements in the UList. More... | |
autoPtr< List< List< pointIndexHit > > > | clone () const |
Clone. More... | |
~List () | |
Destructor. More... | |
void | resize (const label) |
Alias for setSize(const label) More... | |
void | resize (const label, const List< pointIndexHit > &) |
Alias for setSize(const label, const T&) More... | |
void | setSize (const label) |
Reset size of List. More... | |
void | setSize (const label, const List< pointIndexHit > &) |
Reset size of List and value for new elements. More... | |
void | clear () |
Clear the list, i.e. set size to zero. More... | |
void | append (const List< pointIndexHit > &) |
Append an element at the end of the list. More... | |
void | append (const UList< List< pointIndexHit > > &) |
Append a List at the end of this list. More... | |
void | append (const UIndirectList< List< pointIndexHit > > &) |
Append a UIndirectList at the end of this list. More... | |
void | transfer (List< List< pointIndexHit > > &) |
Transfer the contents of the argument List into this list. More... | |
void | transfer (DynamicList< List< pointIndexHit >, SizeInc, SizeMult, SizeDiv > &) |
Transfer the contents of the argument List into this list. More... | |
void | transfer (SortableList< List< pointIndexHit > > &) |
Transfer the contents of the argument List into this list. More... | |
List< pointIndexHit > & | newElmt (const label) |
Return subscript-checked element of UList. More... | |
void | shallowCopy (const UList< List< pointIndexHit > > &)=delete |
Disallow implicit shallowCopy. More... | |
void | operator= (const UList< List< pointIndexHit > > &) |
Assignment to UList operator. Takes linear time. More... | |
void | operator= (const List< List< pointIndexHit > > &) |
Assignment operator. Takes linear time. More... | |
void | operator= (List< List< pointIndexHit > > &&) |
Move assignment operator. More... | |
void | operator= (const SLList< List< pointIndexHit > > &) |
Assignment to SLList operator. Takes linear time. More... | |
void | operator= (const UIndirectList< List< pointIndexHit > > &) |
Assignment to UIndirectList operator. Takes linear time. More... | |
void | operator= (const BiIndirectList< List< pointIndexHit > > &) |
Assignment to BiIndirectList operator. Takes linear time. More... | |
void | operator= (std::initializer_list< List< pointIndexHit > >) |
Assignment to an initializer list. More... | |
void | operator= (const List< pointIndexHit > &) |
Assignment of all entries to the given value. More... | |
void | operator= (const zero) |
Assignment of all entries to zero. More... | |
Public Member Functions inherited from UList< T > | |
UList () | |
Null constructor. More... | |
UList (T *__restrict__ v, label size) | |
Construct from components. More... | |
label | fcIndex (const label i) const |
Return the forward circular index, i.e. the next index. More... | |
label | rcIndex (const label i) const |
Return the reverse circular index, i.e. the previous index. More... | |
std::streamsize | byteSize () const |
Return the binary size in number of characters of the UList. More... | |
const T * | cdata () const |
Return a const pointer to the first data element,. More... | |
T * | data () |
Return a pointer to the first data element,. More... | |
T & | first () |
Return the first element of the list. More... | |
const T & | first () const |
Return first element of the list. More... | |
T & | last () |
Return the last element of the list. More... | |
const T & | last () const |
Return the last element of the list. More... | |
void | checkStart (const label start) const |
Check start is within valid range (0 ... size-1) More... | |
void | checkSize (const label size) const |
Check size is within valid range (0 ... size) More... | |
void | checkIndex (const label i) const |
Check index i is within valid range (0 ... size-1) More... | |
void | shallowCopy (const UList< T > &) |
Copy the pointer held by the given UList. More... | |
void | deepCopy (const UList< T > &) |
Copy elements of the given UList. More... | |
T & | operator[] (const label) |
Return element of UList. More... | |
const T & | operator[] (const label) const |
Return element of constant UList. More... | |
operator const Foam::List< T > & () const | |
Allow cast to a const List<T>&. More... | |
void | operator= (const T &) |
Assignment of all entries to the given value. More... | |
void | operator= (const zero) |
Assignment of all entries to zero. More... | |
iterator | begin () |
Return an iterator to begin traversing the UList. More... | |
iterator | end () |
Return an iterator to end traversing the UList. More... | |
const_iterator | cbegin () const |
Return const_iterator to begin traversing the constant UList. More... | |
const_iterator | cend () const |
Return const_iterator to end traversing the constant UList. More... | |
const_iterator | begin () const |
Return const_iterator to begin traversing the constant UList. More... | |
const_iterator | end () const |
Return const_iterator to end traversing the constant UList. More... | |
reverse_iterator | rbegin () |
Return reverse_iterator to begin reverse traversing the UList. More... | |
reverse_iterator | rend () |
Return reverse_iterator to end reverse traversing the UList. More... | |
const_reverse_iterator | crbegin () const |
Return const_reverse_iterator to begin reverse traversing the UList. More... | |
const_reverse_iterator | crend () const |
Return const_reverse_iterator to end reverse traversing the UList. More... | |
const_reverse_iterator | rbegin () const |
Return const_reverse_iterator to begin reverse traversing the UList. More... | |
const_reverse_iterator | rend () const |
Return const_reverse_iterator to end reverse traversing the UList. More... | |
label | size () const |
Return the number of elements in the UList. More... | |
label | max_size () const |
Return size of the largest possible UList. More... | |
bool | empty () const |
Return true if the UList is empty (ie, size() is zero) More... | |
void | swap (UList< T > &) |
Swap two ULists of the same type in constant time. More... | |
bool | operator== (const UList< T > &) const |
Equality operation on ULists of the same type. More... | |
bool | operator!= (const UList< T > &) const |
The opposite of the equality operation. Takes linear time. More... | |
bool | operator< (const UList< T > &) const |
Compare two ULists lexicographically. Takes linear time. More... | |
bool | operator> (const UList< T > &) const |
Compare two ULists lexicographically. Takes linear time. More... | |
bool | operator<= (const UList< T > &) const |
Return true if !(a > b). Takes linear time. More... | |
bool | operator>= (const UList< T > &) const |
Return true if !(a < b). Takes linear time. More... | |
template<> | |
const bool & | operator[] (const label i) const |
Static Public Member Functions | |
static scalarField | minEdgeLength (const triSurface &surf) |
Calculate min edge length for every surface point. More... | |
Static Public Member Functions inherited from List< List< pointIndexHit > > | |
static const List< List< pointIndexHit > > & | null () |
Return a null List. More... | |
Static Public Member Functions inherited from UList< T > | |
static const UList< T > & | null () |
Return a null UList. More... | |
Static Public Attributes | |
static scalar | alignedCos_ = cos(degToRad(89.0)) |
Cosine between edge and face normal when considered parallel. More... | |
Additional Inherited Members | |
Public Types inherited from List< List< pointIndexHit > > | |
typedef SubList< List< pointIndexHit > > | subList |
Declare type of subList. More... | |
Public Types inherited from UList< T > | |
typedef T | value_type |
Type of values the UList contains. More... | |
typedef T & | reference |
Type that can be used for storing into. More... | |
typedef const T & | const_reference |
Type that can be used for storing into. More... | |
typedef label | difference_type |
The type that can represent the difference between any two. More... | |
typedef label | size_type |
The type that can represent the size of a UList. More... | |
typedef T * | iterator |
Random access iterator for traversing UList. More... | |
typedef const T * | const_iterator |
Random access iterator for traversing UList. More... | |
typedef T * | reverse_iterator |
Reverse iterator for reverse traversal of UList. More... | |
typedef const T * | const_reverse_iterator |
Reverse iterator for reverse traversal of constant UList. More... | |
Protected Member Functions inherited from List< List< pointIndexHit > > | |
void | size (const label) |
Override size to be inconsistent with allocated storage. More... | |
Holder of intersections of edges of a surface with another surface. Optionally shuffles around points on surface to resolve any 'conflicts' (edge hitting triangle edge, edge hitting point etc.).
Definition at line 60 of file edgeIntersections.H.
Construct null.
Definition at line 458 of file edgeIntersections.C.
Referenced by edgeIntersections::edgeIntersections().
edgeIntersections | ( | const triSurface & | surf1, |
const triSurfaceSearch & | query2, | ||
const scalarField & | surf1PointTol | ||
) |
Construct from surface and tolerance.
Definition at line 467 of file edgeIntersections.C.
References edgeIntersections::edgeIntersections(), forAll, PrimitivePatch< FaceList, PointField >::nEdges(), PrimitivePatch< FaceList, PointField >::points(), and triSurfaceSearch::surface().
edgeIntersections | ( | const List< List< pointIndexHit >> & | intersections, |
const labelListList & | classification | ||
) |
Construct from components.
Definition at line 502 of file edgeIntersections.C.
ClassName | ( | "edgeIntersections" | ) |
|
static |
Calculate min edge length for every surface point.
Definition at line 514 of file edgeIntersections.C.
References PrimitivePatch< FaceList, PointField >::edges(), forAll, PrimitivePatch< FaceList, PointField >::localPoints(), Foam::mag(), Foam::min(), Foam::minDist(), PrimitivePatch< FaceList, PointField >::pointEdges(), edgeIntersections::removeDegenerates(), and List< T >::size().
|
inline |
For every intersection the classification status.
Definition at line 178 of file edgeIntersections.H.
References Foam::faceMap(), edgeIntersections::merge(), and edgeIntersections::removeDegenerates().
Referenced by edgeIntersections::merge().
Foam::label removeDegenerates | ( | const label | nIters, |
const triSurface & | surf1, | ||
const triSurfaceSearch & | query2, | ||
const scalarField & | surf1PointTol, | ||
pointField & | points1 | ||
) |
Resolve ties. Shuffles points so all edge - face intersections.
will be on the face interior. Points will be the new surface points. Returns number of iterations needed. (= nIters if still has degenerate cuts)
Definition at line 542 of file edgeIntersections.C.
References Foam::abort(), Foam::endl(), Foam::FatalError, FatalErrorInFunction, forAll, edgeIntersections::merge(), PrimitivePatch< FaceList, PointField >::nEdges(), Foam::nl, Foam::Pout, rndGen(), and triSurfaceSearch::surface().
Referenced by edgeIntersections::classification(), and edgeIntersections::minEdgeLength().
void merge | ( | const edgeIntersections & | subInfo, |
const labelList & | edgeMap, | ||
const labelList & | faceMap, | ||
const bool | merge = true |
||
) |
Merge (or override) edge intersection for a subset.
(given as edge map and face map - for face indices stored in pointIndexHit.index())
Definition at line 700 of file edgeIntersections.C.
References edgeIntersections::classification(), forAll, PointIndexHit< Point >::hit(), PointIndexHit< Point >::index(), UList< T >::operator[](), PointIndexHit< Point >::rawPoint(), List< T >::setSize(), and List< T >::size().
Referenced by edgeIntersections::classification(), and edgeIntersections::removeDegenerates().
Cosine between edge and face normal when considered parallel.
(note: should be private and make access- and set- function)
Definition at line 142 of file edgeIntersections.H.