#include <sglTriStruct.hpp>
Public Types  
typedef sglTriList<T>::iterator  list_iterator 
Public Methods  
bool  isDegenerate () 
bool  isMember (T *vert) 
T*  findSameLocation (T *vert) 
list_iterator  minadj () 
unsigned int  hash (unsigned int hashsize) 
bool  isEqual (sglTriStruct *tri2) 
Public Attributes  
int  index 
T  v [3] 
bool  used 
unsigned int  adjcount 
list_iterator  adj [3] 
Static Public Methods  
T*  notCommon (sglTriStruct *tri, sglTriStruct *tri2) 
Definition at line 46 of file sglTriStruct.hpp.

return true if this is degenerate (a point or line).
Definition at line 71 of file sglTriStruct.hpp. Referenced by sglTriStripper::addTriangleFace(). 

return true if vert is in this.
Definition at line 76 of file sglTriStruct.hpp. Referenced by notCommon(). 

returns the vertex with the same vi as vert.
Definition at line 81 of file sglTriStruct.hpp. 

find a triangle adjacent to tri with a minimum number of adjacencies.
Definition at line 148 of file sglTriStruct.hpp. 

return a handle to the vertex in tri that is not in tri2.
Definition at line 134 of file sglTriStruct.hpp. 

compute the hash table value corresponding to this tri.
Definition at line 197 of file sglTriStruct.hpp. 

check for equality of two triangles based only on vertex indices.
Definition at line 206 of file sglTriStruct.hpp. 

a simple identifier for debug purposes.
Definition at line 50 of file sglTriStruct.hpp. 

the three vertices for this triangle.
Definition at line 53 of file sglTriStruct.hpp. 

indicates this triangle has been used in a strip.
Definition at line 56 of file sglTriStruct.hpp. 

indicates how many other triangles are adjacent to this one. This number is reduced as adjacent triangles are added to strips and removed from the adj array of pointers below. Definition at line 62 of file sglTriStruct.hpp. 

array of three pointers to adjacent triangles.
Definition at line 68 of file sglTriStruct.hpp. 