HDK
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
UT_STBasicSubD Class Reference

#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)
 

Detailed Description

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.

Constructor & Destructor Documentation

UT_STBasicSubD::UT_STBasicSubD ( fpreal  min_size,
int  min_objects,
int  max_depth 
)
inline

Construct an instance of UT_STBasicSubD that subdivides a node when all of the following are true:

  • the node's width and height are greater than min_size
  • the node has more than min_objects children
  • the node's depth is less than max_depth

Definition at line 383 of file UT_SpatialTree.h.

Member Function Documentation

template<class T , class B >
bool UT_STBasicSubD::subdivide ( B *  bounds_provider,
const fpreal min,
const fpreal max,
const UT_ValArray< T > &  objects,
int  depth,
int  ndimensions 
)
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.


The documentation for this class was generated from the following file: