SimplexAdj< M > Class Template Reference

Simplex-simplex adjacencies in an M-D indexed simplex set. More...

#include <SimplexAdj.h>

List of all members.

Public Member Functions

Constructors etc.

 SimplexAdj ()
 Default constructor. Empty adjacency data.
 SimplexAdj (const SimplexAdj &other)
 Copy constructor.
SimplexAdjoperator= (const SimplexAdj &other)
 Assignment operator.
template<typename IS , bool A>
 SimplexAdj (const ads::Array< 1, IS, A > &simplices, const VertexSimplexInc< M > &vertexSimplexInc)
 Construct from the array of indexed simplices and the vertex-simplex incidences.
template<typename IS , bool A>
void build (const ads::Array< 1, IS, A > &simplices, const VertexSimplexInc< M > &vertexSimplexInc)
 Build the vertex-simplex adjacencies structure.
template<typename IS , bool A>
 SimplexAdj (const int numVertices, const ads::Array< 1, IS, A > &simplices)
 Construct from the number of vertices and the array of indexed simplices.
template<typename IS , bool A>
void build (const int numVertices, const ads::Array< 1, IS, A > &simplices)
 Build the vertex-simplex adjacencies structure.
void swap (SimplexAdj &x)
 Swap data.
 ~SimplexAdj ()
 Destructor. Leave cleaning up to the containers.
Accessors.

const ads::FixedArray< M+1, int > & operator() (const int n) const
 Return adjacencies of the n_th simplex.
int operator() (const int n, const int m) const
 Return m_th adjacent simplex to the n_th simplex.
int getSize () const
 Return number of simplices.
int getSize (const int n) const
 Return number of simplices adjacent to the n_th simplex.
Manipulators.

ads::FixedArray< M+1, int > & operator() (const int n)
 Return adjacencies of the n_th simplex.
void set (const int n, const int m, const int index)
 Set the m_th adjacent simplex to the n_th simplex.
Equality.

bool operator== (const SimplexAdj &x) const
 Return true if the adjacencies are the same.
bool operator!= (const SimplexAdj &x) const
 Return true if the adjacencies are not the same.
File I/O.

void put (std::ostream &out) const
 Write the simplex-simplex adjacencies.

Detailed Description

template<int M>
class SimplexAdj< M >

Simplex-simplex adjacencies in an M-D indexed simplex set.

Parameters:
N is the simplex dimension.

This class is used in IndSimpSetIncAdj to store the simplex-simplex adjacencies. Note that the space dimension is not relevant. This class deals only with topological information.


Constructor & Destructor Documentation

template<int M>
template<typename IS , bool A>
SimplexAdj< M >::SimplexAdj ( const ads::Array< 1, IS, A > &  simplices,
const VertexSimplexInc< M > &  vertexSimplexInc 
) [inline]

Construct from the array of indexed simplices and the vertex-simplex incidences.

IS is an indexed simplex type, a tuple of M+1 integers.

References SimplexAdj< M >::build().

template<int M>
template<typename IS , bool A>
SimplexAdj< M >::SimplexAdj ( const int  numVertices,
const ads::Array< 1, IS, A > &  simplices 
) [inline]

Construct from the number of vertices and the array of indexed simplices.

IS is an indexed simplex type, a tuple of M+1 integers.

References SimplexAdj< M >::build().


The documentation for this class was generated from the following file:
Generated on Thu Jun 30 02:14:58 2016 for Computational Geometry Package by  doxygen 1.6.3