csBSPTree Class Reference
[Geometry utilities]
This BSP-tree is a binary tree that organizes a triangle mesh.  
More...
#include <csgeom/bsptree.h>
| Public Member Functions | |
| const csDirtyAccessArray< 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. | |
| void | Clear () | 
| Clear the BSP-tree. | |
| csBSPTree () | |
| Create a new empty BSP-tree. | |
| ~csBSPTree () | |
| Destroy the BSP-tree. | |
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 45 of file bsptree.h.
Constructor & Destructor Documentation
| csBSPTree::csBSPTree | ( | ) | 
Create a new empty BSP-tree.
| csBSPTree::~csBSPTree | ( | ) | 
Destroy the BSP-tree.
Member Function Documentation
| const csDirtyAccessArray<int>& csBSPTree::Back2Front | ( | const csVector3 & | pos | ) | 
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.
| void csBSPTree::Build | ( | csTriangle * | triangles, | |
| int | num_triangles, | |||
| csVector3 * | vertices | |||
| ) | 
Build the BSP tree given the set of triangles.
| void csBSPTree::Clear | ( | ) | 
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.4.7

