topological triangulation mesh
![]() | newTriangle (TriangulationTriangle *n0 = 0, TriangulationTriangle *n1 = 0, TriangulationTriangle *n2 = 0, TriangulationVertex *v0 = 0, TriangulationVertex *v1 = 0, TriangulationVertex *v2 = 0, TriangulationEdge *e0 = 0, TriangulationEdge *e1 = 0, TriangulationEdge *e2 = 0, TriangulationZone *zone = 0) creates a new triangle |
![]() | newEdge ( TriangulationVertex *v1, TriangulationVertex *v2, TriangulationTriangle *t1 = 0, TriangulationTriangle *t2 = 0) creates a new edge |
![]() | newVertex (TriangulationEdge *edge, unsigned int orientation ) creates a new vertex |
![]() | regularizeTopology (void) Regularize the mesh topology using edge swapping |
![]() | sameVertex (const TriangulationEdge *e1, const TriangulationEdge *e2) test if two edges are adjacent to the same vertex returns a pointer to this vertex |
![]() | firstVertex (void) const returns an iterator on vertices, initialized on first vertex |
![]() | lastVertex (void) const returns an iterator on vertices, initialized on last vertex |
![]() | firstEdge (void) const returns an iterator on edges, initialized on first edge |
![]() | lastEdge (void) const returns an iterator on edges, initialized on last edge |
![]() | firstTriangle (void) const returns an iterator on triangles, initialized on first triangle |
![]() | lastTriangle (void) const returns an iterator on triangles, initialized on last triangle |
![]() | firstZone (void) const returns an iterator on zones, initialized on first zone |
![]() | lastZone (void) const returns an iterator on zones, initialized on first zone |
![]() | getFirstVertex (void) const returns first triangulation vertex |
![]() | getFirstEdge (void) const returns first triangulation edge |
![]() | getFirstTriangle (void) const returns first triangulation triangle |
![]() | getFirstZone (void) const returns first triangulation zone |
![]() | getNumberOfVertices (void) const returns mesh number of vertices |
![]() | getNumberOfEdges (void) const returns mesh number of edges |
![]() | getNumberOfTriangles (void) const returns mesh number of triangles |
![]() | getNumberOfZones (void) const returns mesh number of zones |
![]() | addVertex (TriangulationVertex* v) add a new vertex to this mesh, the vertex reference is updated |
![]() | addEdge (TriangulationEdge* e) add a new edge to this mesh, the edge reference is updated |
![]() | addTriangle (TriangulationTriangle * f) add a new triangle to this mesh, the face reference is updated |
![]() | addZone (TriangulationZone* z) add a new zone to this mesh, the zone reference is updated |
![]() | topologyCheck (void) const Checks if the mesh topology is correct |
![]() | renumber (void) Updates the reference of all vertices, triangles, edges and zones |
![]() | vertexList 2-simplex mesh first vertex |
![]() | triangleList 2-simplex mesh first face |
![]() | edgeList 2-simplex mesh first edge |
![]() | zoneList 2-simplex mesh first zone |
topological triangulation mesh
class NotAManifold: public Exception
ObjectsList <TriangulationTriangle> triangleList
ObjectsList <TriangulationEdge> edgeList
ObjectsList <TriangulationZone> zoneList
constructor
destructor
virtual TriangulationTriangle* newTriangle(TriangulationTriangle *n0 = 0, TriangulationTriangle *n1 = 0, TriangulationTriangle *n2 = 0, TriangulationVertex *v0 = 0, TriangulationVertex *v1 = 0, TriangulationVertex *v2 = 0, TriangulationEdge *e0 = 0, TriangulationEdge *e1 = 0, TriangulationEdge *e2 = 0, TriangulationZone *zone = 0)
n1 - second triangle neighbor,
n2 - third triangle neighbor,
v0 - first vertex,
v1 - second vertex,
v2 - third vertex,
e0 - first edge,
e1 - second edge,
e2 - third edge,
zone - zone face belongs to virtual TriangulationEdge* newEdge( TriangulationVertex *v1, TriangulationVertex *v2, TriangulationTriangle *t1 = 0, TriangulationTriangle *t2 = 0)
v2 - second edge vertex
t1 - first edge triangle
t2 - second edge triangle virtual TriangulationVertex* newVertex(TriangulationEdge *edge, unsigned int orientation )
orientation - vertex orientation versus edge orientation (0 or 1) virtual unsigned int regularizeTopology(void)
static TriangulationVertex* sameVertex(const TriangulationEdge *e1, const TriangulationEdge *e2)
TriangulationVertexIterator firstVertex(void) const
TriangulationVertexIterator lastVertex(void) const
TriangulationEdgeIterator firstEdge(void) const
TriangulationEdgeIterator lastEdge(void) const
TriangulationTriangleIterator firstTriangle(void) const
TriangulationTriangleIterator lastTriangle(void) const
TriangulationZoneIterator firstZone(void) const
TriangulationZoneIterator lastZone(void) const
TriangulationVertex* getFirstVertex(void) const
TriangulationEdge* getFirstEdge(void) const
TriangulationTriangle* getFirstTriangle(void) const
TriangulationZone* getFirstZone(void) const
unsigned int getNumberOfVertices(void) const
unsigned int getNumberOfEdges(void) const
unsigned int getNumberOfTriangles(void) const
unsigned int getNumberOfZones(void) const
void addVertex(TriangulationVertex* v)
void addEdge(TriangulationEdge* e)
void addTriangle(TriangulationTriangle * f)
void addZone(TriangulationZone* z)
bool topologyCheck(void) const
void renumber(void)
alphabetic index hierarchy of classes
this page has been generated automatically by doc++
(c)opyright by Malte Zöckler, Roland Wunderling
contact: doc++@zib.de