---

sglTriStruct Class Template Reference

triangle data struct. More...

#include <sglTriStruct.hpp>

List of all members.

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)

---

Detailed Description

template<class T> class sglTriStruct

triangle data struct.

Definition at line 46 of file sglTriStruct.hpp.

---

Member Function Documentation

template<class T> bool sglTriStruct<T>::isDegenerate ( ) [inline]

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

template<class T> bool sglTriStruct<T>::isMember ( T * vert ) [inline]

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

template<class T> T * sglTriStruct<T>::findSameLocation ( T * vert ) [inline]

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

template<class T> sglTriStruct< T >::list_iterator sglTriStruct< T >::minadj ( ) [inline]

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

template<class T> T * sglTriStruct< T >::notCommon ( sglTriStruct<T> * tri, sglTriStruct<T> * tri2 ) [inline, static]

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

template<class T> unsigned int sglTriStruct< T >::hash ( unsigned int hashsize ) [inline]

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

template<class T> bool sglTriStruct< T >::isEqual ( sglTriStruct<T> * tri2 ) [inline]

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

---

Member Data Documentation

template<class T> int sglTriStruct<T>::index

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

template<class T> T sglTriStruct<T>::v

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

template<class T> bool sglTriStruct<T>::used

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

template<class T> unsigned int sglTriStruct<T>::adjcount

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.

template<class T> list_iterator sglTriStruct<T>::adj

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

---

The documentation for this class was generated from the following file:

• sglTriStruct.hpp

---