Provides Binary Space Partitioning Functionality to spacially separate data structures in n-dimensions
For some useful background info, search the web for "bsp tree faq".
See: Description
Class Summary | |
---|---|
Bspf |
A Binary Space Partitioning Forest
This is simply an array of Binary Space Partitioning Trees identified by indexes |
Bspt |
a Binary Space Partitioning Tree The tree partitions n-dimensional space (in our case 3) into little boxes, facilitating searches for things which are *nearby*. |
CubeIterator |
Iterator used for finding all points within a box or a hemi-box
Obtain a CubeIterator by calling Bspt.allocateCubeIterator(). |
Element | the internal tree is made up of elements ... either Node or Leaf |
Leaf | A leaf of Point3f objects in the bsp tree |
Node | Nodes of the bspt. |
Provides Binary Space Partitioning Functionality to spacially separate data structures in n-dimensions
For some useful background info, search the web for "bsp tree faq".