Main Page | Modules | Class Hierarchy | Alphabetical List | Class List | File List | Class Members | File Members | Related Pages
csBSPTree Class Reference
This BSP-tree is a binary tree that organizes a triangle mesh. More...
#include <csgeom/bsptree.h>
Public Member Functions | |
csBSPTree () | |
Create a new empty BSP-tree. | |
~csBSPTree () | |
Destroy the BSP-tree. | |
void | Clear () |
Clear the BSP-tree. | |
void | Build (csTriangle *triangles, int num_triangles, csVector3 *vertices) |
Build the BSP tree given the set of triangles. | |
const csDirtyAccessArray< int > & | Back2Front (const csVector3 &pos) |
Traverse the tree from back to front. |
Detailed Description
This 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.
Definition at line 38 of file bsptree.h.
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:
- csgeom/bsptree.h
Generated for Crystal Space by doxygen 1.3.9.1