class TriangulationTriangle : public ListElement<TriangulationTriangle> triangulation topological triangle
| | setNeighboringTriangle (int i, TriangulationTriangle *t) set ith triangle neighbor |
| | setEdge (int i, TriangulationEdge *e) set ith edge |
| | setVertex (int i, TriangulationVertex *v) set ith vertex |
| | setWhichNeighbor (unsigned int i, unsigned int j) set the index for which neighbor[i]->neighbor[whichNeighbor[i]]=this |
| | setWhichNeighbor (void) set whichNeighbor[i] value automatically |
| | getRef (void) const returns vertex reference |
| | getWhichNeighbor (int i) const get whichNeighbor array value |
| | getWhichNeighbor (const TriangulationTriangle *v) const get whichNeighbor array value |
| | neighborIndex (const TriangulationTriangle *v) const get array index of a triangle in neighbors array |
| | getNeighbor (unsigned int i) const returns one of triangulation neighbors |
| | isReal () const whether the triangle is real or virtual |
| | setReal () set the triangle as real |
| | setVirtual () set the triangle as virtual |
| | zoneRemoved (TriangulationZone *z) removes pointer on deleted zone |
| | getZone (void) const returns the zone associated with that triangle |
| | setZone (TriangulationZone *z) attach triangle to a zone |
| | getVertex (unsigned int i) const returns a triangle vertex from its index |
| | getEdge (unsigned int i) const returns a triangle edge from its index |
| | swapNeighbors (unsigned int i, unsigned int j) swap two triangle neighbor indices |
| | constructors
| ||||
| | destructor
|
| | neighbor [3] triangle 3 neighbors |
| | vertex [3] triangle 3 vertices |
| | edge [3] triangle 3 edges |
| | empty if the triangle is empty or not |
| | whichNeighbor [3] order in neighbor array of triangles which this triangle is a neighbor: t1->neighbor[i]->neighbor[whichNeighbor[i]] = this |
| | ref triangle unique reference |
| | triangulation to which triangulation this triangle belongs |
| | zone the zone to which this triangle belongs |
| | vertexContour the associated vertex contour |
| | vertexWindow used during a recursive search |
| | neighborhood pre-stored neigborhood (if neighborhoodSize > 0) |
| | neighborhoodSize pre-stored neigborhood size |
triangulation topological triangle
TriangulationVertex* vertex[3]
TriangulationEdge* edge[3]
bool empty
unsigned int whichNeighbor[3]
int ref
Triangulation* triangulation
TriangulationZone* zone
VertexContour* vertexContour
SM2VertexTopology* vertexWindow
std::vector
unsigned int neighborhoodSize
constructors
TriangulationTriangle(Triangulation *mesh, bool empty=false, 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 *z=0)
empty - if the triangle is real or virtual
n0 - first triangle neighbor,
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,
z - zone the triangle belongs
TriangulationTriangle(const TriangulationTriangle& org)
destructor
void setNeighboringTriangle(int i, TriangulationTriangle *t)
void setEdge(int i, TriangulationEdge *e)
void setVertex(int i, TriangulationVertex *v)
void setWhichNeighbor(unsigned int i, unsigned int j)
void setWhichNeighbor(void)
int getRef(void) const
int getWhichNeighbor(int i) const
int getWhichNeighbor(const TriangulationTriangle *v) const
int neighborIndex(const TriangulationTriangle *v) const
TriangulationTriangle* getNeighbor(unsigned int i) const
bool isReal() const
void setReal()
void setVirtual()
void zoneRemoved(TriangulationZone *z)
TriangulationZone* getZone(void) const
void setZone(TriangulationZone *z)
TriangulationVertex* getVertex(unsigned int i) const
TriangulationEdge* getEdge(unsigned int i) const
void swapNeighbors(unsigned int i, unsigned int j)
j - second triangle neighbor index (0, 1 or 2)
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