#include <UT_Convex.h>
Definition at line 26 of file UT_Convex.h.
virtual UT_Convex::~UT_Convex |
( |
| ) |
|
|
inlinevirtual |
virtual void UT_Convex::beginPolygon |
( |
int |
npoints, |
|
|
bool |
lastone |
|
) |
| |
|
pure virtual |
beginPolygon will be told when the last polygon is being added
Implemented in GU_TrimTesselator.
Returns true if splitting the specified quad along the line from point 0 to point 2 is possible
Definition at line 68 of file UT_Convex.h.
void UT_Convex::convex |
( |
exint |
maxsides, |
|
|
bool |
allowinterrupt = true , |
|
|
bool |
avoiddegeneracy = false |
|
) |
| |
virtual void UT_Convex::earlyTermination |
( |
| ) |
|
|
virtual |
If the last polygon to be added won't be added after all, e.g. if it is degenerate and avoiddegeneracy is true, the earlyTermination() method will be called. This is so that the caller can clean up properly, since beginPolygon will not have been called with lastone==true. By default, this method does nothing.
virtual void UT_Convex::endPolygon |
( |
| ) |
|
|
pure virtual |
virtual int64 UT_Convex::getMemoryUsage |
( |
bool |
inclusive | ) |
const |
|
virtual |
virtual int UT_Convex::getPointCount |
( |
| ) |
const |
|
pure virtual |
It's the sub-class responsibility to fill these out...
Implemented in GU_TrimTesselator.
virtual void UT_Convex::initialize |
( |
| ) |
|
|
virtual |
bool UT_Convex::isConcave |
( |
| ) |
|
Returns true if the specified quad is convex. NOTE: This may return false negatives for highly non-planar quads, since the definition of convex breaks down.
Definition at line 84 of file UT_Convex.h.
virtual void UT_Convex::polyVertex |
( |
int |
num | ) |
|
|
pure virtual |
UT_ConvexPoint* UT_Convex::myData |
|
protected |
The documentation for this class was generated from the following file: