Public Methods |
| csPolygonTree (csThing *th) |
| Constructor.
|
virtual | ~csPolygonTree () |
| Destructor.
|
csThing* | GetThing () |
| Get the thing for this tree.
|
virtual void | Build (csPolygonInt **polygons, int num)=0 |
| Create the tree with a given set of polygons.
|
void | Build (csPolygonArray &polygons) |
| Create the tree with a given set of polygons.
|
void | AddObject (csPolyTreeBBox *obj) |
| Add a dynamic object to the tree.
|
void | AddStubTodo (csPolygonStub *stub) |
| Add a stub to the todo list of the tree.
|
bool | Overlaps (csPolygonInt **polygons, int num) |
| Test if any polygon in the list overlaps any other polygon. More...
|
virtual void* | Back2Front (const csVector3 &pos, csTreeVisitFunc *func, void *data, csTreeCullFunc *cullfunc=NULL, void *culldata=NULL)=0 |
| Traverse the tree from back to front starting at the root and 'pos'.
|
virtual void* | Front2Back (const csVector3 &pos, csTreeVisitFunc *func, void *data, csTreeCullFunc *cullfunc=NULL, void *culldata=NULL)=0 |
| Traverse the tree from front to back starting at the root and 'pos'.
|
virtual void | Statistics ()=0 |
| Print statistics about this tree.
|
Protected Methods |
void | Clear () |
| Clear the nodes.
|
void | WriteString (iFile *cf, char *str, int len) |
void | WriteBox3 (iFile *cf, const csBox3 &box) |
void | WriteVector3 (iFile *cf, const csVector3 &v) |
void | WritePlane3 (iFile *cf, const csPlane3 &v) |
void | WriteLong (iFile *cf, long l) |
void | WriteUShort (iFile *cf, uint16 l) |
void | WriteByte (iFile *cf, unsigned char b) |
void | WriteBool (iFile *cf, bool b) |
void | ReadString (iFile *cf, char *str, int len) |
void | ReadBox3 (iFile *cf, csBox3 &box) |
void | ReadVector3 (iFile *cf, csVector3 &v) |
void | ReadPlane3 (iFile *cf, csPlane3 &v) |
long | ReadLong (iFile *cf) |
uint16 | ReadUShort (iFile *cf) |
unsigned char | ReadByte (iFile *cf) |
bool | ReadBool (iFile *cf) |
Protected Attributes |
csPolygonTreeNode* | root |
| The root of the tree.
|
csThing* | thing |
| The parent thing that this tree is made for.
|