#include <IceIndexedTriangle.h>
|
float | Angle (const IndexedTriangle &tri, const Point *verts) const |
|
float | Area (const Point *verts) const |
|
bool | BackfaceCulling (const Point *verts, const Point &source) const |
|
void | Center (const Point *verts, Point ¢er) const |
|
void | CenteredNormal (const Point *verts, Point &normal) const |
|
float | Compacity (const Point *verts) const |
|
CubeIndex | ComputeCubeIndex (const Point *verts) const |
|
float | ComputeOcclusionPotential (const Point *verts, const Point &view) const |
|
void | ComputePoint (const Point *verts, float u, float v, Point &pt, udword *nearvtx=null) const |
|
void | DenormalizedNormal (const Point *verts, Point &normal) const |
|
bool | Equal (const IndexedTriangle &tri) const |
|
ubyte | FindEdge (udword vref0, udword vref1) const |
|
void | Flip () |
|
void | GetVRefs (ubyte edgenb, udword &vref0, udword &vref1, udword &vref2) const |
|
bool | HasVertex (udword ref) const |
|
bool | HasVertex (udword ref, udword *index) const |
|
inline_ | IndexedTriangle () |
| Constructor. More...
|
|
inline_ | IndexedTriangle (udword r0, udword r1, udword r2) |
| Constructor. More...
|
|
inline_ | IndexedTriangle (const IndexedTriangle &triangle) |
| Copy constructor. More...
|
|
bool | IsDegenerate () const |
|
bool | IsVisible (const Point *verts, const Point &source) const |
|
float | MaxEdgeLength (const Point *verts) const |
|
float | MinEdgeLength (const Point *verts) const |
|
void | Normal (const Point *verts, Point &normal) const |
|
udword | OppositeVertex (udword vref0, udword vref1) const |
|
inline_ udword | OppositeVertex (ubyte edgenb) const |
|
float | Perimeter (const Point *verts) const |
|
inline_ Plane | PlaneEquation (const Point *verts) const |
|
void | RandomPoint (const Point *verts, Point &random) const |
|
bool | ReplaceVertex (udword oldref, udword newref) |
|
inline_ | ~IndexedTriangle () |
| Destructor. More...
|
|
Definition at line 23 of file IceIndexedTriangle.h.
◆ IndexedTriangle() [1/3]
inline_ IndexedTriangle::IndexedTriangle |
( |
| ) |
|
|
inline |
◆ IndexedTriangle() [2/3]
◆ IndexedTriangle() [3/3]
◆ ~IndexedTriangle()
inline_ IndexedTriangle::~IndexedTriangle |
( |
| ) |
|
|
inline |
◆ Angle()
◆ Area()
float IndexedTriangle::Area |
( |
const Point * |
verts | ) |
const |
◆ BackfaceCulling()
◆ Center()
◆ CenteredNormal()
◆ Compacity()
float IndexedTriangle::Compacity |
( |
const Point * |
verts | ) |
const |
◆ ComputeCubeIndex()
◆ ComputeOcclusionPotential()
◆ ComputePoint()
◆ DenormalizedNormal()
◆ Equal()
◆ FindEdge()
◆ Flip()
void IndexedTriangle::Flip |
( |
| ) |
|
◆ GetVRefs()
◆ HasVertex() [1/2]
bool IndexedTriangle::HasVertex |
( |
udword |
ref | ) |
const |
◆ HasVertex() [2/2]
bool IndexedTriangle::HasVertex |
( |
udword |
ref, |
|
|
udword * |
index |
|
) |
| const |
◆ IsDegenerate()
bool IndexedTriangle::IsDegenerate |
( |
| ) |
const |
◆ IsVisible()
◆ MaxEdgeLength()
float IndexedTriangle::MaxEdgeLength |
( |
const Point * |
verts | ) |
const |
◆ MinEdgeLength()
float IndexedTriangle::MinEdgeLength |
( |
const Point * |
verts | ) |
const |
◆ Normal()
◆ OppositeVertex() [1/2]
◆ OppositeVertex() [2/2]
◆ Perimeter()
float IndexedTriangle::Perimeter |
( |
const Point * |
verts | ) |
const |
◆ PlaneEquation()
◆ RandomPoint()
◆ ReplaceVertex()
bool IndexedTriangle::ReplaceVertex |
( |
udword |
oldref, |
|
|
udword |
newref |
|
) |
| |
◆ mVRef
udword IndexedTriangle::mVRef[3] |
The documentation for this class was generated from the following file: