HDK

#include <UT_KDTree.h>
Public Member Functions  
UT_KDTriQuery (const UT_Vector2 &a, const UT_Vector2 &b, const UT_Vector2 &c)  
float  boxDist (const UT_BoundingRect &box) const 
float  dist (const float *P, int) const 
This distance squared needs to be exact. More...  
Lookup information for 2Dtree triangle queries NOTE: Distance squared here is not Euclidean distance squared, but edgeperpendicular distance squared, i.e. distance is from the incentre out, perpendicular to one of the edges, minus the incircle's radius. This avoids the need to have special cases for what would be the circular sections around each vertex. It basically indicates how far the triangle would have to be expanded (or contracted) relative to the incentre in order to hit the query point.
Definition at line 140 of file UT_KDTree.h.

inline 
Definition at line 142 of file UT_KDTree.h.

inline 
This can be an underestimate, but not an overestimate of the distance squared.
Definition at line 183 of file UT_KDTree.h.
This distance squared needs to be exact.
Definition at line 199 of file UT_KDTree.h.