#include <adaptiveTriangMesh.h>

Classes
class	DartIterator
	Dart iterator. More...

Public Types
typedef TriangleType	ElementType

typedef DataTypeContainer::RealType	RealType

typedef DataTypeContainer::DomVecType	DomVecType

typedef DataTypeContainer::Point3DType	Point3DType

typedef DataTypeContainer::Indices3DType	Indices3DType

typedef DataTypeContainer::VectorType	VectorType

typedef DataTypeContainer::MaskType	MaskType

typedef std::vector< Indices3DType >	VertexIndicesType

typedef std::vector< Point3DType >	VertexCoordsType

Public Types inherited from shellFE::TriangMesh< DataTypeContainer, TriangleType >
typedef TriangleType	ElementType

typedef DataTypeContainer::RealType	RealType

typedef DataTypeContainer::Point3DType	Point3DType

typedef DataTypeContainer::TangentVecType	TangentVecType

typedef DataTypeContainer::Indices3DType	Indices3DType

typedef DataTypeContainer::VectorType	VectorType

typedef DataTypeContainer::MaskType	MaskType

Public Member Functions
	AdaptiveTriangMesh (const string &fileName)

const std::map< int, ParentInformation< DomVecType > > &	getInterpolationMap () const

void	mark (int element)
	Mark element for refinement. More...

void	markAll ()
	Mark all elements for refinement. More...

void	unmark (int element)
	Ensure that element is not marked for refinement. More...

void	unmarkAll ()
	Unmark all elements. More...

bool	isMarkedForRefinement (int element) const

int	pushBackTriang (const Indices3DType newTriang)

void	refineMarkedTriangles ()
	Refines at least all triangles that have been marked. More...

void	prolongateLinearly (VectorType &function) const
	Prolongate by linear interpolation. More...

LocalIndex	getLongestEdgeIndex (GlobalIndex triangle) const
	Get longest edge index (starting search possibly with a preferred edge) More...

Public Member Functions inherited from shellFE::TriangMesh< DataTypeContainer, TriangleType >
	TriangMesh ()
	Create empty TriangMesh. More...

	TriangMesh (const string &fileName)

virtual	~TriangMesh ()

int	getNumVertices () const

int	getNumTriangs () const

int	pushBackVertex (const Point3DType newVertex)
	Insert new vertex and return global index. More...

int	pushBackTriang (const Indices3DType nodeIdx)
	Insert new triangle and return global index. More...

const Point3DType &	getVertex (const int num) const

void	setVertex (const int num, const Point3DType Arg)

int	getNeighbour (const int elementID, const int acrossLocalEdge) const
	Get neighbor on edge. More...

void	setNeighbour (const int elementID, const int acrossLocalEdge, const int value) const
	Set neighbor on edge. More...

const TriangleType &	getTriang (const int num) const

TriangleType &	getTriang (const int num)
	Returns a triangle. More...

void	setTriang (const int num, const TriangleType Arg)

int	getTriangNodeIdx (const int num, const int localNode) const

void	setTriangNodeIdx (const int num, const int localNode, const int newIdx)

void	updateAllTriangles ()

void	print ()

void	loadFromLegacyVTK (const string &filename)
	load from file in the .vtk file format. Currently only loads geometric information. More...

void	makeNeighbour () const

void	makeOrientationConsistent ()

Protected Member Functions
GlobalIndex	refine (GlobalIndex triangleToRefine)

GlobalIndex	refine (const DartIterator &d)

GlobalIndex	refineOnlyThis (const DartIterator &d, GlobalIndex midpoint)

GlobalIndex	addEdgeMidpoint (const DartIterator &d)
	Add edge midpoint on d.edge, update _interpolationMap and return global index of node. More...

Protected Attributes
std::vector< bool >	_markedForRefinement

std::map< int, ParentInformation< DomVecType > >	_interpolationMap

Protected Attributes inherited from shellFE::TriangMesh< DataTypeContainer, TriangleType >
std::vector< Point3DType >	_vertexIterator

std::vector< TriangleType >	_triangIterator

std::vector< Indices3DType >	_neighbour_

Detailed Description

template<typename DataTypeContainer, typename TriangleType>
class shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >

Definition at line 21 of file adaptiveTriangMesh.h.

Member Typedef Documentation

template<typename DataTypeContainer , typename TriangleType >

typedef DataTypeContainer::DomVecType shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::DomVecType

Definition at line 26 of file adaptiveTriangMesh.h.

template<typename DataTypeContainer , typename TriangleType >

typedef TriangleType shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::ElementType

Definition at line 24 of file adaptiveTriangMesh.h.

template<typename DataTypeContainer , typename TriangleType >

typedef DataTypeContainer::Indices3DType shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::Indices3DType

Definition at line 28 of file adaptiveTriangMesh.h.

template<typename DataTypeContainer , typename TriangleType >

typedef DataTypeContainer::MaskType shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::MaskType

Definition at line 30 of file adaptiveTriangMesh.h.

template<typename DataTypeContainer , typename TriangleType >

typedef DataTypeContainer::Point3DType shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::Point3DType

Definition at line 27 of file adaptiveTriangMesh.h.

template<typename DataTypeContainer , typename TriangleType >

typedef DataTypeContainer::RealType shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::RealType

Definition at line 25 of file adaptiveTriangMesh.h.

template<typename DataTypeContainer , typename TriangleType >

typedef DataTypeContainer::VectorType shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::VectorType

Definition at line 29 of file adaptiveTriangMesh.h.

template<typename DataTypeContainer , typename TriangleType >

typedef std::vector< Point3DType > shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::VertexCoordsType

Definition at line 32 of file adaptiveTriangMesh.h.

template<typename DataTypeContainer , typename TriangleType >

typedef std::vector< Indices3DType > shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::VertexIndicesType

Definition at line 31 of file adaptiveTriangMesh.h.

Constructor & Destructor Documentation

template<typename DataTypeContainer , typename TriangleType >

shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::AdaptiveTriangMesh ( const string & fileName )

inline

Definition at line 206 of file adaptiveTriangMesh.h.

                                                   :
         TriangMesh<DataTypeContainer, TriangleType >( fileName ),
         _markedForRefinement( this->getNumTriangs(), false )
     {
         this->makeNeighbour();
     }

Member Function Documentation

template<typename DataTypeContainer , typename TriangleType >

GlobalIndex shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::addEdgeMidpoint ( const DartIterator & d )

inlineprotected

Add edge midpoint on d.edge, update _interpolationMap and return global index of node.

Note: For the lab, _interpolationMap can be ignored

Definition at line 395 of file adaptiveTriangMesh.h.

     {
         DartIterator d1 = d;
         d1.flipNode();
 
         ParentInformation<DomVecType> parents;
         parents.globalIndices[0] = d.getGlobalNodeIndex();
         parents.globalIndices[1] = d1.getGlobalNodeIndex();
         parents.ElementIndex = d.getGlobalTriangleIndex();
 
         // get edge midpoint between nodes n1 and n2
         Point3DType newVertex;
         newVertex.setZero();
         newVertex += this->getVertex ( d.getGlobalNodeIndex() );
         newVertex += this->getVertex ( d1.getGlobalNodeIndex() );
         newVertex /= 2.;
 
         // add new vertex
         int newNodeIdx = this->pushBackVertex( newVertex );
         _interpolationMap.insert( std::pair< int, ParentInformation<DomVecType> >( newNodeIdx, parents ) );
         return newNodeIdx;
     }

template<typename DataTypeContainer , typename TriangleType >

const std::map< int, ParentInformation<DomVecType> >& shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::getInterpolationMap ( ) const

inline

Definition at line 213 of file adaptiveTriangMesh.h.

     {
         return _interpolationMap;
     }

template<typename DataTypeContainer , typename TriangleType >

LocalIndex shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::getLongestEdgeIndex ( GlobalIndex triangle ) const

inline

Get longest edge index (starting search possibly with a preferred edge)

Definition at line 281 of file adaptiveTriangMesh.h.

     {
         // get global node indices of triangle
         const Indices3DType &triangIdx ( this->getTriang( triangle ).getGlobalNodeIdx() );
         // assume that edge 0 is longest edge
         LocalIndex localIdx = 0;
         Point3DType edge = this->getVertex( triangIdx[1] );
         edge -= this->getVertex( triangIdx[2] );
         RealType maxLength = edge.squaredNorm();
         // now check if edge 1 is longer
         edge = this->getVertex( triangIdx[2] );
         edge -= this->getVertex( triangIdx[0] );
         RealType candidate = edge.squaredNorm();
         if( candidate > maxLength ) {
             localIdx = 1;
             maxLength = candidate;
         }
         // now check if edge 2 is longer
         edge = this->getVertex( triangIdx[0] );
         edge -= this->getVertex( triangIdx[1] );
         candidate = edge.squaredNorm();
         if( candidate > maxLength ) localIdx = 2;
 
         return localIdx;
     }

template<typename DataTypeContainer , typename TriangleType >

bool shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::isMarkedForRefinement ( int element ) const

inline

Definition at line 242 of file adaptiveTriangMesh.h.

     {
         return _markedForRefinement[element];
     }

template<typename DataTypeContainer , typename TriangleType >

void shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::mark ( int element )

inline

Mark element for refinement.

Definition at line 219 of file adaptiveTriangMesh.h.

     {
         _markedForRefinement[ element ] = true;
     }

template<typename DataTypeContainer , typename TriangleType >

void shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::markAll ( )

inline

Mark all elements for refinement.

Definition at line 225 of file adaptiveTriangMesh.h.

     {
         for( unsigned i = 0; i < _markedForRefinement.size(); i++ ) _markedForRefinement[i] = true;
     }

template<typename DataTypeContainer , typename TriangleType >

void shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::prolongateLinearly ( VectorType & function ) const

inline

Prolongate by linear interpolation.

Definition at line 266 of file adaptiveTriangMesh.h.

     {
         VectorType oldFunction = function;
         int oldSize = function.size();
         function.resize( this->getNumVertices() );
         for( int i = 0; i < oldSize; ++i ) function[i] = oldFunction[i];
         typename std::map< int, ParentInformation<DomVecType> >::const_iterator iter;
         for( int i = oldSize; i < function.size(); ++i ) {
             iter = _interpolationMap.find( i );
             if( iter == _interpolationMap.end() ) throw std::invalid_argument ( aol::strprintf ( "unknown vertex in File %s at line %d.", __FILE__, __LINE__ ).c_str() );
             function[i] = 0.5 * ( function[iter->second.globalIndices[0]] + function[iter->second.globalIndices[1]] );
         }
     }

template<typename DataTypeContainer , typename TriangleType >

int shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::pushBackTriang ( const Indices3DType newTriang )

inline

Note: when adding a new face we have to expand the array _markedForRefinement correspondingly

Definition at line 248 of file adaptiveTriangMesh.h.

     {
         _markedForRefinement.push_back( false );
         return TriangMesh<DataTypeContainer, TriangleType >::pushBackTriang( newTriang );
     }

template<typename DataTypeContainer , typename TriangleType >

GlobalIndex shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::refine ( GlobalIndex triangleToRefine )

inlineprotected

Definition at line 309 of file adaptiveTriangMesh.h.

     {
         DartIterator d( *this, triangleToRefine, getLongestEdgeIndex( triangleToRefine ) );
         return refine( d );
     }

template<typename DataTypeContainer , typename TriangleType >

GlobalIndex shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::refine ( const DartIterator & d )

inlineprotected

Definition at line 315 of file adaptiveTriangMesh.h.

     {
         // first cut the neighbour on edge l in two triangles:
         GlobalIndex P_new = addEdgeMidpoint( d );
         DartIterator d_prime = d;
         bool hasNeighbourOn_d_prime = d_prime.canFlipTriangle();
         GlobalIndex T_l_new = IndexNotSet;
 
         if ( hasNeighbourOn_d_prime ) {
             d_prime.flipTriangle();
             T_l_new = refineOnlyThis(d_prime, P_new);
         }
 
         // create new triangle T_new and connect with neighbours
         GlobalIndex T_new = refineOnlyThis(d, P_new);
 
         // take care of neighbours
         if (hasNeighbourOn_d_prime) {
             // set d_prime to edge which lies in T_l_new, opposite to edge d2.edge of T_new
             d_prime.flipNode();
             d_prime.flipEdge();
             // flipTriangle() here will always work, as we have just created this triangle. Thus, no canFlipTriangle() call is needed.
             d_prime.flipTriangle();
             d_prime.flipEdge();
             // set neighbour GlobalIndex in T_l_new
             this->setNeighbour ( d_prime.getGlobalTriangleIndex(), d_prime.getLocalEdgeIndex(), T_new );
             // move d1 to T_new
             DartIterator d1 = d;
             d1.flipNode();
             d1.flipEdge();
             d1.flipTriangle();
             d1.flipEdge();
             // set neighbour in T_new
             this->setNeighbour ( d1.getGlobalTriangleIndex(), d1.getLocalEdgeIndex(), T_l_new );
         }
 
         return T_new;
     }

template<typename DataTypeContainer , typename TriangleType >

void shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::refineMarkedTriangles ( )

inline

Refines at least all triangles that have been marked.

Note: May refine unmarked triangles

Definition at line 256 of file adaptiveTriangMesh.h.

     {
         const int numElements = this->getNumTriangs();
         for ( int elementIndex = 0; elementIndex < numElements; ++elementIndex  )
             if ( isMarkedForRefinement( elementIndex ) )  refine( elementIndex );
         this->makeOrientationConsistent();
         this->updateAllTriangles();
     }

template<typename DataTypeContainer , typename TriangleType >

GlobalIndex shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::refineOnlyThis	(	const DartIterator &	d,
		GlobalIndex	midpoint
	)

inlineprotected

Definition at line 354 of file adaptiveTriangMesh.h.

     {
         // in comments for this function, we write T for *this.
         LocalIndex l = getLongestEdgeIndex( d.getGlobalTriangleIndex() );
         if (l != d.getLocalEdgeIndex()) {
             DartIterator d_l(*this, d.getGlobalTriangleIndex(), l);
             LocalIndex commonNode = d.getCommonNodeLocalIndex(d_l);
             DartIterator d_prime( *this, d.getGlobalTriangleIndex(), l, commonNode);
             // bisect T along the longest edge
             refine(d_prime);
             // because d_prime.node also lies on d.edge, T is now modifies in such a way that d.edge has remained unchanged. Proceed by recursion until d.edge is the longest edge in T.
             return refineOnlyThis(d, midpoint);
         }
         // create DartIterators to all edges, starting from l
         DartIterator d1 = d;
         d1.flipNode();
         d1.flipEdge();
         DartIterator d2 = d1;
         d2.flipNode();
         d2.flipEdge();
         // create new triangle T_new and connect with neighbours
         GlobalIndex T_newIndex = this->pushBackTriang ( Indices3DType( midpoint, d1.getGlobalNodeIndex(), d2.getGlobalNodeIndex() ) );
         this->_neighbour_.push_back( Indices3DType ( d1.getNextTriangleIndex(), d.getGlobalTriangleIndex(), d.getNextTriangleIndex() ) );
         // set neighbour GlobalIndex in triangle lying opposite to d1.edge to T_new
         DartIterator d1_prime = d1;
         if (d1_prime.canFlipTriangle()) {
             d1_prime.flipTriangle();
             this->setNeighbour ( d1_prime.getGlobalTriangleIndex(), d1_prime.getLocalEdgeIndex(), T_newIndex );
         }
         // connect ourselves (i. e., connect T) to T_new:
         this->setNeighbour( d1.getGlobalTriangleIndex(), d1.getLocalEdgeIndex(), T_newIndex );
         // do not have to refine this triangle again
         unmark( d1.getGlobalTriangleIndex() );
         // old triangle now has a new vertex, ie the midpoint
         this->getTriang( d1.getGlobalTriangleIndex() ).setGlobalNodeIdx( d1.getLocalNodeIndex(), midpoint);
 
         return T_newIndex;
     }

template<typename DataTypeContainer , typename TriangleType >

void shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::unmark ( int element )

inline

Ensure that element is not marked for refinement.

Definition at line 231 of file adaptiveTriangMesh.h.

     {
         _markedForRefinement[ element ] = false;
     }

template<typename DataTypeContainer , typename TriangleType >

void shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::unmarkAll ( )

inline

Unmark all elements.

Definition at line 237 of file adaptiveTriangMesh.h.

     {
         for( unsigned i = 0; i < _markedForRefinement.size(); i++ )
             _markedForRefinement[i] = false;
     }

Member Data Documentation

template<typename DataTypeContainer , typename TriangleType >

std::map< int, ParentInformation<DomVecType> > shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::_interpolationMap

protected

Definition at line 203 of file adaptiveTriangMesh.h.

template<typename DataTypeContainer , typename TriangleType >

std::vector<bool> shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >::_markedForRefinement

protected

Definition at line 202 of file adaptiveTriangMesh.h.

The documentation for this class was generated from the following file:

lib/triangleMesh/adaptiveTriangMesh.h

Classes

Public Types

Public Member Functions

Protected Member Functions

Protected Attributes

Detailed Description

template<typename DataTypeContainer, typename TriangleType> class shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >

Member Typedef Documentation

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation

template<typename DataTypeContainer, typename TriangleType>
class shellFE::AdaptiveTriangMesh< DataTypeContainer, TriangleType >