|
struct | BallStarNode2D |
|
struct | BallStarNode3D |
|
interface | IBoundingBox |
| A generic interface that structures should implement for use in R* Trees etc. More...
|
|
interface | IBoundingCircle |
| A generic interface that structures should implement for use in Ball* Trees etc. More...
|
|
interface | IBoundingRect |
| A generic interface that structures should implement for use in R* Trees etc. More...
|
|
interface | IBoundingSphere |
| A generic interface that structures should implement for use in Ball* Trees etc. More...
|
|
interface | IOctree< T > |
| Generic interface for different types of octrees (sparse, dense, etc.) to exchange data structures within Jobs. More...
|
|
interface | IQuadtree< T > |
| Generic interface for different types of quadtrees (sparse, dense, etc.) to exchange data structures within Jobs. More...
|
|
struct | Native2DBallStarTree< T > |
| A spatial data structure for circles in 2D space. The leaves of the tree are holding up to maxChildren elements. More...
|
|
struct | Native2DKDTree< T > |
| A spatial data structure for quick point queries - the input points can be in 3D space, but are sorted in 2D space (along a plane of your choosing) More...
|
|
struct | Native2DRStarTree< T > |
| A spatial data structure for rectangles in 2D space. The leaves of the tree are holding up to maxChildren elements. More...
|
|
struct | Native3DBallStarTree< T > |
| A spatial data structure for spheres in 3D space. The leaves of the tree are holding up to maxChildren elements. More...
|
|
struct | Native3DKDTree< T > |
| A spatial data structure for quick point queries in 3D space. Note: Default sorting order is X, then Y, then Z. More...
|
|
struct | Native3DRStarTree< T > |
|
struct | NativeDenseOctree< T > |
| A spatial data structure for quick point queries suited for moving or concentrated positions in 3D space. The dense variant uses much, much more memory in 3D, but is slightly faster for insertions and removals than the sparse variant. More...
|
|
struct | NativeDenseQuadtree< T > |
| A spatial data structure for quick point queries suited for moving or concentrated positions in 2D space. The dense variant uses much more memory, but is slightly faster for insertions and removals than the sparse variant. More...
|
|
struct | NativeSparseOctree< T > |
|
struct | NativeSparseQuadtree< T > |
| A spatial data structure for quick point queries suited for moving or concentrated positions in 2D space. The sparse variant uses less memory, but is slightly slower for insertions and removals than the dense variant. More...
|
|
struct | Native2DBallStarTree< T >.OptimizeJob |
|
struct | Native2DRStarTree< T >.OptimizeJob |
|
struct | Native3DBallStarTree< T >.OptimizeJob |
|
struct | Native3DRStarTree< T >.OptimizeJob |
|
struct | Native2DBallStarTree< T >.RemoveJob |
|
struct | Native2DRStarTree< T >.RemoveJob |
|
struct | Native3DBallStarTree< T >.RemoveJob |
|
struct | Native3DRStarTree< T >.RemoveJob |
|
struct | Native2DBallStarTree< T >.UpdateJob |
|
struct | Native2DRStarTree< T >.UpdateJob |
|
struct | Native3DBallStarTree< T >.UpdateJob |
|
struct | Native3DRStarTree< T >.UpdateJob |
|