#include <UT_PointTree.h>
|
| | UT_PointTree () |
| |
| virtual | ~UT_PointTree () |
| |
| int | build (const UT_Array< void * > &data, const UT_Vector3Array &points, int maxsize=5) |
| |
| void * | findNearest (const UT_Vector3 &pt, float maxdist, UT_PointTreeValidNearestFunc=NULL, void *user_data=NULL) |
| |
| void | findNearestGroup (const UT_Vector3 &pt, float maxdist, int groupsize, UT_Array< void * > &group, UT_FloatArray &groupdist2, UT_PointTreeValidNearestFunc=NULL, void *user_data=NULL) |
| |
| int | findAllClose (const UT_Vector3 &pt, float maxdist, UT_Array< void * > &data) |
| |
| int | findAllInTube (const UT_Vector3 &orig, const UT_Vector3 &dir, fpreal rad, UT_Array< void * > &data) |
| |
| void | getBBox (UT_BoundingBox &box) const |
| |
| int | verifyTree () const |
| |
| void | destroyTree () |
| |
|
| void | destroyNode (utPointNode *node) |
| |
| int | verifyNode (UT_BoundingBox &box, utPointNode *node) const |
| |
| void | testAxis (const UT_BoundingBox &box, int axis, const UT_Vector3Array &points, int &splitleft, int &splitright) |
| |
| void | splitOnAxis (const UT_BoundingBox &box, int axis, const UT_Array< void * > &data, const UT_Vector3Array &points, UT_Array< void * > &dataleft, UT_Vector3Array &pointsleft, UT_Array< void * > &dataright, UT_Vector3Array &pointsright) |
| |
| utPointNode * | buildChildNode (const UT_BoundingBox &box, const UT_Array< void * > &data, const UT_Vector3Array &points, int inbboxnode=0) |
| |
| void * | findNearestNode (UT_BoundingBox &box, utPointNode *node, const UT_Vector3 &pt, float &maxdist, UT_PointTreeValidNearestFunc=NULL, void *user_data=NULL) |
| |
| void | findNearestNodeGroup (UT_BoundingBox &box, utPointNode *node, const UT_Vector3 &pt, ut_PointTreeQueue &q, UT_PointTreeValidNearestFunc=NULL, void *user_data=NULL) |
| |
| int | findCloseNodes (UT_BoundingBox &box, utPointNode *node, const UT_Vector3 &pt, float &maxdist, UT_Array< void * > &data) |
| |
| int | findInTube (UT_BoundingBox &box, utPointNode *node, const UT_Vector3 &orig, const UT_Vector3 &dir, fpreal radius, fpreal radius2, UT_Array< void * > &data) |
| |
Definition at line 34 of file UT_PointTree.h.
| UT_PointTree::UT_PointTree |
( |
| ) |
|
| virtual UT_PointTree::~UT_PointTree |
( |
| ) |
|
|
virtual |
| void UT_PointTree::destroyNode |
( |
utPointNode * |
node | ) |
|
|
protected |
| void UT_PointTree::destroyTree |
( |
| ) |
|
| int UT_PointTree::verifyTree |
( |
| ) |
const |
| int UT_PointTree::myMaxSize |
|
protected |
| utPointNode* UT_PointTree::myRoot |
|
protected |
The documentation for this class was generated from the following file: