HDK
|
#include <UT_SpatialTree.h>
Public Member Functions | |
UT_STBasicSubD (fpreal min_size, int min_objects, int max_depth) | |
template<class T , class B > | |
bool | subdivide (B *bounds_provider, const fpreal *min, const fpreal *max, const UT_ValArray< T > &objects, int depth, int ndimensions) |
A basic subdivision strategy for use with UT_SpatialTree that subdivides based on three criteria: node size, node object count, and node depth.
Definition at line 375 of file UT_SpatialTree.h.
Construct an instance of UT_STBasicSubD that subdivides a node when all of the following are true:
Definition at line 383 of file UT_SpatialTree.h.
|
inline |
Returns true if the node at the specified depth with the specified bounds provider, containing the specified objects, whose bounds are given, should be subdivided.
Definition at line 396 of file UT_SpatialTree.h.