'Cuts' a mesh with a surface. More...

Inheritance diagram for cellClassification:

Collaboration diagram for cellClassification:

Public Types
enum	cType { NOTSET , INSIDE , OUTSIDE , CUT }
	Type of cell. More...

enum	pointStatus { UNSET , MESH , NONMESH , MIXED }
	Enumeration defining the whether points are use by cells of. More...

Public Types inherited from List< label >
typedef SubList< label >	subList
	Declare type of subList. More...

Public Types inherited from UList< label >
typedef label	value_type
	Type of values the UList contains. More...

typedef label &	reference
	Type that can be used for storing into. More...

typedef const label &	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 label *	iterator
	Random access iterator for traversing UList. More...

typedef const label *	const_iterator
	Random access iterator for traversing UList. More...

typedef std::reverse_iterator< iterator >	reverse_iterator
	Reverse iterator for reverse traversal of UList. More...

typedef std::reverse_iterator< const_iterator >	const_reverse_iterator
	Reverse iterator for reverse traversal of constant UList. More...

Public Member Functions
	ClassName ("cellClassification")

	cellClassification (const polyMesh &mesh, const meshSearch &meshQuery, const triSurfaceSearch &surfQuery, const pointField &outsidePoints)
	Construct from mesh and surface and point(s) on outside. More...

	cellClassification (const polyMesh &mesh, const labelList &cellType)
	Construct from mesh and type for every cell. More...

	cellClassification (const cellClassification &)
	Copy constructor. More...

const polyMesh &	mesh () const

label	trimCutCells (const label nLayers, const label meshType, const label fillType)

label	growSurface (const label meshType, const label fillType)
	Sets vertex neighbours of meshType cells to fillType. More...

label	fillHangingCells (const label meshType, const label fillType, const label maxIter)
	Find hanging cells (cells with all points on outside) and set their. More...

label	fillRegionEdges (const label meshType, const label fillType, const label maxIter)
	Find regionEdges and fill one neighbour. Iterate until nothing. More...

label	fillRegionPoints (const label meshType, const label fillType, const label maxIter)
	Find regionPoints and fill all neighbours. Iterate until nothing. More...

void	writeStats (Ostream &os) const
	Write statistics on cell types to Ostream. More...

void	operator= (const cellClassification &)

Public Member Functions inherited from List< label >
	List ()
	Null constructor. More...

	List (const label)
	Construct with given size. More...

	List (const label, const label &)
	Construct with given size and value for all elements. More...

	List (const label, const zero)
	Construct with given size initialising all elements to zero. More...

	List (const List< label > &)
	Copy constructor. More...

	List (const UList< T2 > &)
	Copy constructor from list containing another type. More...

	List (List< label > &&)
	Move constructor. More...

	List (List< label > &, bool reuse)
	Construct as copy or re-use as specified. More...

	List (const UList< label > &, const labelUList &mapAddressing)
	Construct as subset. More...

	List (InputIterator first, InputIterator last)
	Construct given start and end iterators. More...

	List (const FixedList< label, Size > &)
	Construct as copy of FixedList<T, Size> More...

	List (const PtrList< label > &)
	Construct as copy of PtrList<T> More...

	List (const SLList< label > &)
	Construct as copy of SLList<T> More...

	List (const UIndirectList< label > &)
	Construct as copy of UIndirectList<T> More...

	List (const BiIndirectList< label > &)
	Construct as copy of BiIndirectList<T> More...

	List (std::initializer_list< label >)
	Construct from an initialiser list. More...

	List (Istream &)
	Construct from Istream. More...

label	size () const
	Return the number of elements in the UList. More...

autoPtr< List< label > >	clone () const
	Clone. More...

	~List ()
	Destructor. More...

void	resize (const label)
	Alias for setSize(const label) More...

void	resize (const label, const label &)
	Alias for setSize(const label, const T&) More...

void	setSize (const label)
	Reset size of List. More...

void	setSize (const label, const label &)
	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 label &)
	Append an element at the end of the list. More...

void	append (const UList< label > &)
	Append a List at the end of this list. More...

void	append (const UIndirectList< label > &)
	Append a UIndirectList at the end of this list. More...

void	transfer (List< label > &)
	Transfer the contents of the argument List into this list. More...

void	transfer (DynamicList< label, SizeInc, SizeMult, SizeDiv > &)
	Transfer the contents of the argument List into this list. More...

void	transfer (SortableList< label > &)
	Transfer the contents of the argument List into this list. More...

label &	newElmt (const label)
	Return subscript-checked element of UList. More...

void	shallowCopy (const UList< label > &)=delete
	Disallow implicit shallowCopy. More...

void	operator= (const UList< label > &)
	Assignment to UList operator. Takes linear time. More...

void	operator= (const List< label > &)
	Assignment operator. Takes linear time. More...

void	operator= (List< label > &&)
	Move assignment operator. More...

void	operator= (const SLList< label > &)
	Assignment to SLList operator. Takes linear time. More...

void	operator= (const UIndirectList< label > &)
	Assignment to UIndirectList operator. Takes linear time. More...

void	operator= (const BiIndirectList< label > &)
	Assignment to BiIndirectList operator. Takes linear time. More...

void	operator= (std::initializer_list< label >)
	Assignment to an initialiser list. More...

void	operator= (const label &)
	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< label >
void	operator= (const label &)
	Assignment of all entries to the given value. More...

void	operator= (const zero)
	Assignment of all entries to zero. More...

	UList ()
	Null constructor. More...

	UList (label *__restrict__ v, label size)
	Construct from components. More...

	UList (const UList< label > &)=default
	Copy construct. 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 label *	cdata () const
	Return a const pointer to the first data element,. More...

label *	data ()
	Return a pointer to the first data element,. More...

label &	first ()
	Return the first element of the list. More...

const label &	first () const
	Return first element of the list. More...

label &	last ()
	Return the last element of the list. More...

const label &	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< label > &)
	Copy the pointer held by the given UList. More...

void	deepCopy (const UList< label > &)
	Copy elements of the given UList. More...

label &	operator[] (const label)
	Return element of UList. More...

const label &	operator[] (const label) const
	Return element of constant UList. More...

const bool &	operator[] (const label i) const

	operator const Foam::List< label > & () const
	Allow cast to a const List<T>&. More...

iterator	begin ()
	Return an iterator to begin traversing the UList. More...

const_iterator	begin () const
	Return const_iterator to begin traversing the constant UList. More...

iterator	end ()
	Return an iterator to end traversing the UList. More...

const_iterator	end () const
	Return const_iterator to end traversing the constant 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...

reverse_iterator	rbegin ()
	Return reverse_iterator to begin reverse traversing the UList. More...

const_reverse_iterator	rbegin () const
	Return const_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	rend () const
	Return const_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...

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< label > &)
	Swap two ULists of the same type in constant time. More...

bool	operator== (const UList< label > &) const
	Equality operation on ULists of the same type. More...

bool	operator!= (const UList< label > &) const
	The opposite of the equality operation. Takes linear time. More...

bool	operator< (const UList< label > &) const
	Compare two ULists lexicographically. Takes linear time. More...

bool	operator> (const UList< label > &) const
	Compare two ULists lexicographically. Takes linear time. More...

bool	operator<= (const UList< label > &) const
	Return true if !(a > b). Takes linear time. More...

bool	operator>= (const UList< label > &) const
	Return true if !(a < b). Takes linear time. More...

Additional Inherited Members
Static Public Member Functions inherited from List< label >
static const List< label > &	null ()
	Return a null List. More...

Static Public Member Functions inherited from UList< label >
static const UList< label > &	null ()
	Return a null UList. More...

Protected Member Functions inherited from List< label >
void	size (const label)
	Override size to be inconsistent with allocated storage. More...

Detailed Description

'Cuts' a mesh with a surface.

Divides cells into three types

cut, i.e. any of the edges of the cell is split or any edge of the surface pierces any of the faces of the cell.
outside: cell can be reached by Meshwave from any of the supplied outside points (without crossing any cut cell)
inside: all other.

Used in various meshing programs.

Has various utility functions to deal with 'features' on this level where the mesh still has all inside and outside cells.

Concepts

point classification:
- point used by meshType cells only
- point used by non-meshType cells only
- point used by both types ('mixed')
hanging cells: meshType cells using mixed points only. These cells would have all their vertices on the surface when extracting the meshType cells.
regionEdges: edges where the cells using it are of mixed type. Or more precise when walking around the edge and looking at the different types of the cells there are more than two regions with same type.

Seen from above:

Ok:
     A | A
       |
     --+---
       |
     B | B

Not ok:
     A | B
       |
    ---+---
       |
     B | A

because this latter situation would cause the surface after subsetting type A or B to be multiply connected across this edge. And also when snapping the edge end points to the surface it might cause some twisted faces if the surface is normal to the edge (and smoothing the surface would not help since the points on the edge would be 'pulled' from two different sides)

regionPoints: like regionEdges but now for points. Points where subsetting the mesh would cause a multiply connected outside surface (connected across point, not edge)

Source files

Definition at line 115 of file cellClassification.H.