#include <Tri3.hpp>
Public Types | |
| typedef V | VertexType |
| typedef V * | VertexHandle |
| typedef Tri3< V > | ElementType |
| typedef Tri3< V > * | ElementHandle |
| typedef CohElem< Tri3< V > > | CohElementType |
| typedef CohElementType * | CohElementHandle |
| typedef Simplex< V, 2 > | FaceElementType |
| typedef FaceElementType * | FaceElementHandle |
| typedef Simplex< V, 1 > | EdgeElementType |
| typedef EdgeElementType * | EdgeElementHandle |
| typedef ElementConList | ElementConListType |
| typedef ElementConListType * | ElementConListHandle |
Public Member Functions | |
| Tri3 (VertexHandle i, VertexHandle j, VertexHandle k) | |
| Tri3 (boost::array< VertexHandle, num_vertices > nodes) | |
| Tri3 () | |
| ~Tri3 () | |
| int | FindVertex (VertexHandle v) |
| Returns the index in the vertices vector where v is located. | |
| ElementHandle | AdjElement (VertexHandle v) |
| Get adjacent element (element referenced by a vertex pointer). | |
| ElementHandle | AdjElement (int i) |
| get adjacent element (element referenced by a vertex ID) | |
| bool | IsBoundaryNode (VertexHandle v1) |
| Find if the given node is boundary (node referenced by vertex pointer). | |
| bool | IsBoundaryNode (int v1) |
| Find if the given node is boundary (node referenced by vertex ID). | |
| bool | IsBoundaryEdge (VertexHandle v1, VertexHandle v2) |
| Find if the given edge is boundary (edge referenced by vertex pointers). | |
| bool | IsBoundaryEdge (int v1, int v2) |
| Find if the given edge is boundary (edge referenced by vertex IDs). | |
| ElementHandle | NextTriOnNode (int &v1, int &f) |
| Helper function to obtain the next element at the given node (v1) in the direction given by f. | |
| int | FaceToVertex (VertexHandle v1, VertexHandle v2) |
| Helper function to obtain the vertex ID of the face given by v1 to v2. | |
| int | FaceToVertex (int v1, int v2) |
| Helper function to obtain the vertex ID of the face given by v1 to v2. | |
| int | FaceToVertex (boost::array< VertexHandle,(num_adjacents-1)> vs) |
| Helper function to obtain the vertex ID of the face given by an array of vertices. | |
| void | BreakConnection (int f) |
| void | MakeConnection (VertexHandle f, ElementHandle t) |
| void | MakeConnection (int f, ElementHandle t) |
| FaceElementType | GetFace (int ind) |
| Return the face given by index, ind. | |
| int | GetFaceIndex (FaceElementType face) |
| Return the face index given an actual face definition. | |
| EdgeElementType | GetEdge (int ind) |
| Return the edge given by index, ind. | |
| int | GetEdgeIndex (EdgeElementType edge) |
| Return the edge index given an actual edge definition. | |
| std::vector< EdgeElementType > | GetEdges (int f) |
| Return the edges given by the face, f. | |
| std::vector< EdgeElementType > | GetAllEdges () |
| Return all the edges of the element. | |
| ElementHandle | NextOnEdge (int ind) |
| Return next element on edge given by index, ind. | |
| ElementHandle | PrevOnEdge (int ind) |
| Return previous element on edge given by index, ind. | |
| ElementHandle | NextOnEdge (EdgeElementType edge) |
| Return next element on edge. | |
| ElementHandle | PrevOnEdge (EdgeElementType edge) |
| Return previous element on edge. | |
| CohElementHandle | NextCohOnEdge (int ind) |
| Return next cohesive element on edge given by index, ind. | |
| CohElementHandle | PrevCohOnEdge (int ind) |
| Return previous cohesive element on edge given by index, ind. | |
| VertexHandle | GetCentre () |
| Return a the centre of the element (vertex will have it's global ID set to that of the element). | |
Public Attributes | |
|
boost::array< VertexHandle, num_vertices > | vertices |
|
boost::array< ElementHandle, num_adjacents > | adjacents |
|
boost::array< CohElementHandle, num_adjacents > | coh_adjacents |
|
boost::array< ElementConListHandle, num_edges > | con_lists |
| int | globalID |
Static Public Attributes | |
| static const int | num_vertices = 3 |
| static const int | num_adjacents = 3 |
| static const int | num_edges = 3 |
| static const std::string | deck_keyword |
| Keyword found in input/output file for defining this type of element. | |
Triangular element using 3 nodes for representation with one node at each vertex.
Definition at line 19 of file Tri3.hpp.
1.5.1