csBSPTree Class ReferenceThis BSP-tree is a binary tree that organizes a triangle mesh.
Public Member Functions
int > &
|Back2Front (const csVector3 &pos)|
|Traverse the tree from back to front. |
|void||Build (csTriangle *triangles, int num_triangles, csVector3 *vertices)|
|Build the BSP tree given the set of triangles. |
|Clear the BSP-tree. |
|Create a new empty BSP-tree. |
|Destroy the BSP-tree. |
Detailed DescriptionThis BSP-tree is a binary tree that organizes a triangle mesh.
This tree will not split triangles. If a triangle needs to be split then it will be put in the two nodes.
Constructor & Destructor Documentation
Create a new empty BSP-tree.
Destroy the BSP-tree.
Member Function Documentation
Traverse the tree from back to front.
This will return an array containing the triangle indices in back2front order. The array will not contain double elements.
Build the BSP tree given the set of triangles.
Clear the BSP-tree.
The documentation for this class was generated from the following file:
Generated for Crystal Space 1.0.2 by doxygen 1.4.7