![]() |
Public API Reference |
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 | Clear () |
| Clear the BSP-tree. | |
| csBSPTree () | |
| Create a new empty BSP-tree. | |
| ~csBSPTree () | |
| Destroy the BSP-tree. | |
| void | Build (csTriangle *triangles, size_t num_triangles, const csVector3 *vertices) |
| Build the BSP tree given the set of triangles. | |
| void | Build (CS::TriangleIndicesStream< int > &triangles, const csVector3 *vertices) |
| Build the BSP tree given the set of triangles. | |
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.
Create a new empty BSP-tree.
Destroy the BSP-tree.
| 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, |
| size_t | num_triangles, | ||
| const csVector3 * | vertices | ||
| ) |
Build the BSP tree given the set of triangles.
| void csBSPTree::Build | ( | CS::TriangleIndicesStream< int > & | triangles, |
| const csVector3 * | vertices | ||
| ) |
Build the BSP tree given the set of triangles.
| void csBSPTree::Clear | ( | ) |
Clear the BSP-tree.