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

#include <UT_KDTree.h>

Public Member Functions

 UT_KDTetQuery (const UT_Vector3 &a, const UT_Vector3 &b, const UT_Vector3 &c, const UT_Vector3 &d)
 
float boxDist (const UT_BoundingBox &box) const
 
float dist (const float *P, int) const
 This distance squared needs to be exact. More...
 

Detailed Description

Lookup information for 3D-tree tetrahedron queries NOTE: Distance squared here is not Euclidean distance squared, but face-perpendicular distance squared, i.e. distance is from the incentre out, perpendicular to one of the faces, minus the insphere's radius. This avoids the need to have special cases for what would be the spherical sections around each vertex. It basically indicates how far the tetrahedron would have to be expanded (or contracted) relative to the incentre in order to hit the query point.

Definition at line 226 of file UT_KDTree.h.

Constructor & Destructor Documentation

UT_KDTetQuery::UT_KDTetQuery ( const UT_Vector3 a,
const UT_Vector3 b,
const UT_Vector3 c,
const UT_Vector3 d 
)
inline

Definition at line 228 of file UT_KDTree.h.

Member Function Documentation

float UT_KDTetQuery::boxDist ( const UT_BoundingBox box) const
inline

This can be an underestimate, but not an overestimate of the distance squared.

Definition at line 279 of file UT_KDTree.h.

float UT_KDTetQuery::dist ( const float *  P,
int   
) const
inline

This distance squared needs to be exact.

Definition at line 295 of file UT_KDTree.h.


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