shellFE::TriangMesh< DataTypeContainer, TriangleType > Class Template Reference

#include <triangMesh.h>

Public Types
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
	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 Attributes
std::vector< Point3DType >	_vertexIterator
std::vector< TriangleType >	_triangIterator
std::vector< Indices3DType >	_neighbour_

Detailed Description

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

Definition at line 10 of file triangMesh.h.

Member Typedef Documentation

template<typename DataTypeContainer , typename TriangleType >

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

Definition at line 13 of file triangMesh.h.

template<typename DataTypeContainer , typename TriangleType >

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

Definition at line 17 of file triangMesh.h.

template<typename DataTypeContainer , typename TriangleType >

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

Definition at line 19 of file triangMesh.h.

template<typename DataTypeContainer , typename TriangleType >

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

Definition at line 15 of file triangMesh.h.

template<typename DataTypeContainer , typename TriangleType >

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

Definition at line 14 of file triangMesh.h.

template<typename DataTypeContainer , typename TriangleType >

typedef DataTypeContainer::TangentVecType shellFE::TriangMesh< DataTypeContainer, TriangleType >::TangentVecType

Definition at line 16 of file triangMesh.h.

template<typename DataTypeContainer , typename TriangleType >

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

Definition at line 18 of file triangMesh.h.

Constructor & Destructor Documentation

template<typename DataTypeContainer , typename TriangleType >

shellFE::TriangMesh< DataTypeContainer, TriangleType >::TriangMesh ( )

inline

Create empty TriangMesh.

Definition at line 29 of file triangMesh.h.

    : _vertexIterator(), _triangIterator()
    {}

template<typename DataTypeContainer , typename TriangleType >

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

inline

Definition at line 33 of file triangMesh.h.

    {
        this->loadFromLegacyVTK ( fileName );
    }

template<typename DataTypeContainer , typename TriangleType >

virtual shellFE::TriangMesh< DataTypeContainer, TriangleType >::~TriangMesh ( )

inlinevirtual

Definition at line 38 of file triangMesh.h.

    {}

Member Function Documentation

template<typename DataTypeContainer , typename TriangleType >

int shellFE::TriangMesh< DataTypeContainer, TriangleType >::getNeighbour ( const int  elementID, const int  acrossLocalEdge  ) const

inline

Get neighbor on edge.

Definition at line 76 of file triangMesh.h.

    {
        return _neighbour_[elementID][acrossLocalEdge];
    }

template<typename DataTypeContainer , typename TriangleType >

int shellFE::TriangMesh< DataTypeContainer, TriangleType >::getNumTriangs ( ) const

inline

Definition at line 46 of file triangMesh.h.

    {
        return ( static_cast<int> ( _triangIterator.size() ) );
    }

template<typename DataTypeContainer , typename TriangleType >

int shellFE::TriangMesh< DataTypeContainer, TriangleType >::getNumVertices ( ) const

inline

Definition at line 42 of file triangMesh.h.

    {
        return ( _vertexIterator.size() );
    }

template<typename DataTypeContainer , typename TriangleType >

const TriangleType& shellFE::TriangMesh< DataTypeContainer, TriangleType >::getTriang ( const int  num ) const

inline

Definition at line 87 of file triangMesh.h.

    {
        return _triangIterator[num];
    }

template<typename DataTypeContainer , typename TriangleType >

TriangleType& shellFE::TriangMesh< DataTypeContainer, TriangleType >::getTriang ( const int  num )

inline

Returns a triangle.

Parameters

[in]

num

Triangle index

Definition at line 94 of file triangMesh.h.

    {
        return _triangIterator[num];
    }

template<typename DataTypeContainer , typename TriangleType >

int shellFE::TriangMesh< DataTypeContainer, TriangleType >::getTriangNodeIdx ( const int  num, const int  localNode  ) const

inline

Definition at line 104 of file triangMesh.h.

    {
        return _triangIterator[num].getGlobalNodeIdx(localNode);
    }

template<typename DataTypeContainer , typename TriangleType >

const Point3DType& shellFE::TriangMesh< DataTypeContainer, TriangleType >::getVertex ( const int  num ) const

inline

Definition at line 66 of file triangMesh.h.

    {
        return _vertexIterator[num];
    }

template<typename DataTypeContainer , typename TriangleType >

void shellFE::TriangMesh< DataTypeContainer, TriangleType >::loadFromLegacyVTK ( const string &  filename )

inline

load from file in the .vtk file format. Currently only loads geometric information.

Definition at line 131 of file triangMesh.h.

    {
        /*std::ifstream vtkFile ( filename.c_str() ); */
        std::ifstream vtkFile;
        vtkFile.open ( filename.c_str() );
        if ( vtkFile.fail() ) throw std::invalid_argument( aol::strprintf ( "Cannot open file. In File %s at line %d.", __FILE__, __LINE__ ).c_str() );
        bool readVertices = false;
        bool readFaces = false;
        while ( !vtkFile.eof() ) {
            char line[256];
            vtkFile.getline ( line, 256 );
            // first: expect vertices
            if( !strncmp ( line, "POINTS ", strlen ( "POINTS " ) ) ) {
                readVertices = true;
                continue;
            }
            // second: expect triangles (i.e. starting with "3 " )
            if( !strncmp ( line, "POLYGONS ", strlen ( "POLYGONS " ) ) ) {
                readVertices = false;
                readFaces = true;
                continue;
            }
            // geometric information ends with the first line that does not start with "3 " anymore
            if( readFaces && strncmp ( line, "3 ", strlen ( "3 " ) ) ) break;
            // read in the vertex coordinates and add it to the mesh
            if( readVertices ) {
                Point3DType vertex;
                char * substring = strtok ( line, " " );
                for ( int i = 0; i < 3; i++ ) {
                    vertex[i] = atof( substring );
                    substring = strtok (NULL, " ");
                }
                pushBackVertex ( vertex );
            }
            // read in the face and add it to the mesh
            if( readFaces ) {
                Indices3DType triangle;
                char * substring = strtok ( line, " " );
                for ( int i = 0; i < 3; i++ ) {
                    substring = strtok (NULL, " ");
                    triangle[i] = atof( substring );
                }
                pushBackTriang( triangle );
            }
        }
        vtkFile.close();
    }

template<typename DataTypeContainer , typename TriangleType >

void shellFE::TriangMesh< DataTypeContainer, TriangleType >::makeNeighbour ( ) const

inline

Definition at line 180 of file triangMesh.h.

    {
        int  *n_to_t, *num_of_n, *start_of_n;
        const int numNodes = getNumVertices();
        const int numElements = getNumTriangs();

        if ( int(_neighbour_.size()) != numElements ) _neighbour_.resize ( numElements );

        n_to_t     = new int[numElements*3];
        num_of_n   = new int[numNodes];
        start_of_n = new int[numNodes+1];

        // iterate over all vertices and set num_of_n to zero, i.e. initialize
        for ( int nodeIndex = 0; nodeIndex < numNodes; nodeIndex++ ) num_of_n[nodeIndex] = 0;

        // iterate over all triangles and all neighbours, i.e. 3, since every triangle has 3 neighbours for closed meshes
        for ( int elementIndex = 0; elementIndex < numElements; elementIndex++ )
            for ( int j = 0; j < 3; j++ ) {
                num_of_n[getTriangNodeIdx ( elementIndex,j ) ]++;
                setNeighbour ( elementIndex, j, -1 );
            }

        // get Startindex for node
        int nodeIdx = 0;
        start_of_n[nodeIdx++] = 0;
        while ( nodeIdx < numNodes ) {
            start_of_n[nodeIdx] = start_of_n[nodeIdx-1] + num_of_n[nodeIdx-1];
            nodeIdx++;
        }
        start_of_n[numNodes] = 3 * numElements;

        // initialize reference
        for ( int elementIndex = 0; elementIndex < numElements*3; ++elementIndex ) n_to_t[elementIndex] = -1;

        // build reference
        for ( int elementIndex = 0; elementIndex < numElements; elementIndex++ )
            for ( int j = 0; j < 3; j++ ) {
                int k = start_of_n[getTriangNodeIdx ( elementIndex,j ) ];
                while ( n_to_t[k] > -1 ) k++;
                n_to_t[k] = elementIndex;
            }
        // find neighbour
        for ( int elementIndex = 0; elementIndex < numElements; elementIndex++ )
            for ( int j = 0; j < 3; j++ ) {
                int node1 = getTriangNodeIdx ( elementIndex, j        );
                int node2 = getTriangNodeIdx ( elementIndex, ( j + 1 ) % 3 );
                int node3 = getTriangNodeIdx ( elementIndex, ( j + 2 ) % 3 );

                for ( int k = start_of_n[node1]; k < start_of_n[node1+1]; k++ ) {
                    int n = n_to_t[k]; // Tetraeder
                    if ( elementIndex < n ) // set neighborhood only once
                        for ( int l = 0; l < 3; l++ ) {
                            if ( node3 == getTriangNodeIdx ( n, l ) ) {
                                setNeighbour ( elementIndex, ( j + 1 ) % 3, n );
                                for ( int v = 0; v < 3; v++ )
                                    if ( v != l && getTriangNodeIdx ( n, v ) != node1 ) setNeighbour ( n, v, elementIndex );
                            } else {
                                if ( node2 == getTriangNodeIdx ( n, l ) ) {
                                    setNeighbour ( elementIndex, ( j + 2 ) % 3, n );
                                    for ( int v = 0; v < 3; v++ )
                                        if ( v != l && getTriangNodeIdx ( n, v ) != node1 ) setNeighbour ( n, v, elementIndex );
                                }
                            }
                        }
                }
            }

        delete[] n_to_t;
        delete[] num_of_n;
        delete[] start_of_n;
    }

template<typename DataTypeContainer , typename TriangleType >

void shellFE::TriangMesh< DataTypeContainer, TriangleType >::makeOrientationConsistent ( )

inline

Definition at line 252 of file triangMesh.h.

    {
        if ( int(_neighbour_.size()) != this->getNumTriangs() )
            makeNeighbour();
        // true for all triangles T, whose neighboring triangles have already been oriented consistent with T
        MaskType alreadyHandled( this->getNumTriangs() );
        // true for all triangles who have already been dealt with or who are already waiting in queue
        MaskType inQueue( this->getNumTriangs() );
        // contains all triangles which are already oriented and whose neighbors will be dealt with next (may contain triangles twice for simplicity)
        std::queue<int> activeTriangles;
        activeTriangles.push( 0 );
        inQueue[0] = true;
        // the triangle whose neighbors are currently handled
        int currentTriangle;
        // while there are triangles left whose neighbors are not consistently oriented...
        while( !activeTriangles.empty() ) {
            currentTriangle = activeTriangles.front();
            activeTriangles.pop();
            // deal with all three neighbors of currentTriangle, i.e. orient them and add them to the list to deal with their neighbors
            for ( int i = 0; i < 3; i++ ) {
                int neighbor = getNeighbour( currentTriangle, i );
                if ( neighbor >= 0 && neighbor < this->getNumTriangs() && !alreadyHandled[neighbor] ) {
                    // compute the nodes "currentTriangle" and "neighbor" have in common
                    int node1 = getTriangNodeIdx ( currentTriangle, ( i + 1 ) % 3 );
                    int node2 = getTriangNodeIdx ( currentTriangle, ( i + 2 ) % 3 );
                    // check whether common nodes occur in reversed order in "neighbor", if not, change order
                    int j = 0;
                    while ( getTriangNodeIdx ( neighbor, j ) != node2 )
                        j++;
                    if ( getTriangNodeIdx ( neighbor, ( j + 1 ) % 3 ) != node1 ) {
                        // change order of nodes
                        int exchangeCache = getTriangNodeIdx ( neighbor, ( j + 1 ) % 3 );
                        setTriangNodeIdx( neighbor, ( j + 1 ) % 3, getTriangNodeIdx ( neighbor, ( j + 2 ) % 3 ) );
                        setTriangNodeIdx( neighbor, ( j + 2 ) % 3, exchangeCache );
                        // change order of corresponding neighbours
                        exchangeCache = getNeighbour( neighbor, ( j + 1 ) % 3 );
                        setNeighbour( neighbor, ( j + 1 ) % 3, getNeighbour( neighbor, ( j + 2 ) % 3 ) );
                        setNeighbour( neighbor, ( j + 2 ) % 3, exchangeCache );
                    }
                    if ( !inQueue[neighbor] ) {
                        activeTriangles.push( neighbor );
                        inQueue[neighbor] = true;
                    }
                }
            }
            alreadyHandled[currentTriangle] = true;
        }
    }

template<typename DataTypeContainer , typename TriangleType >

void shellFE::TriangMesh< DataTypeContainer, TriangleType >::print ( )

inline

Definition at line 120 of file triangMesh.h.

    {
        for ( int nodeIndex = 0; nodeIndex < getNumVertices(); ++nodeIndex ) {
            cout << endl << "node = " << nodeIndex << endl;
        }
        for ( int elementIndex = 0; elementIndex < getNumTriangs(); ++elementIndex  ) _triangIterator[elementIndex].print();
    }

template<typename DataTypeContainer , typename TriangleType >

int shellFE::TriangMesh< DataTypeContainer, TriangleType >::pushBackTriang ( const Indices3DType  nodeIdx )

inline

Insert new triangle and return global index.

Definition at line 59 of file triangMesh.h.

    {
        int globalIdx = getNumTriangs();
        _triangIterator.push_back ( TriangleType( globalIdx, nodeIdx, _vertexIterator ) );
        return globalIdx;
    }

template<typename DataTypeContainer , typename TriangleType >

int shellFE::TriangMesh< DataTypeContainer, TriangleType >::pushBackVertex ( const Point3DType  newVertex )

inline

Insert new vertex and return global index.

Definition at line 52 of file triangMesh.h.

    {
        _vertexIterator.push_back(newVertex);
        return getNumVertices() - 1;
    }

template<typename DataTypeContainer , typename TriangleType >

void shellFE::TriangMesh< DataTypeContainer, TriangleType >::setNeighbour ( const int  elementID, const int  acrossLocalEdge, const int  value  ) const

inline

Set neighbor on edge.

Definition at line 82 of file triangMesh.h.

    {
        _neighbour_[elementID][acrossLocalEdge] = value;
    }

template<typename DataTypeContainer , typename TriangleType >

void shellFE::TriangMesh< DataTypeContainer, TriangleType >::setTriang ( const int  num, const TriangleType  Arg  )

inline

Definition at line 99 of file triangMesh.h.

    {
        _triangIterator[num] = Arg;
    }

template<typename DataTypeContainer , typename TriangleType >

void shellFE::TriangMesh< DataTypeContainer, TriangleType >::setTriangNodeIdx ( const int  num, const int  localNode, const int  newIdx  )

inline

Definition at line 109 of file triangMesh.h.

    {
        _triangIterator[num].setGlobalNodeIdx(localNode, newIdx );
    }

template<typename DataTypeContainer , typename TriangleType >

void shellFE::TriangMesh< DataTypeContainer, TriangleType >::setVertex ( const int  num, const Point3DType  Arg  )

inline

Definition at line 70 of file triangMesh.h.

    {
        _vertexIterator[num] = Arg;
    }

template<typename DataTypeContainer , typename TriangleType >

void shellFE::TriangMesh< DataTypeContainer, TriangleType >::updateAllTriangles ( )

inline

Definition at line 115 of file triangMesh.h.

    {
        for ( int elementIndex = 0; elementIndex < getNumTriangs(); ++elementIndex  ) _triangIterator[elementIndex].updateNodesAndEdges( _vertexIterator );
    }

Member Data Documentation

template<typename DataTypeContainer , typename TriangleType >

std::vector< Indices3DType > shellFE::TriangMesh< DataTypeContainer, TriangleType >::_neighbour_

mutableprotected

Definition at line 25 of file triangMesh.h.

template<typename DataTypeContainer , typename TriangleType >

std::vector< TriangleType > shellFE::TriangMesh< DataTypeContainer, TriangleType >::_triangIterator

protected

Definition at line 23 of file triangMesh.h.

template<typename DataTypeContainer , typename TriangleType >

std::vector< Point3DType > shellFE::TriangMesh< DataTypeContainer, TriangleType >::_vertexIterator

protected

Definition at line 22 of file triangMesh.h.

---

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

• lib/triangleMesh/triangMesh.h