UT::BVHQueryPtUnitWrap< NAXES > Struct Template Reference

#include <UT_BVHImpl.h>

Public Types
using	BoxType = UT::Box< v4uf, NAXES >

Public Member Functions
SYS_FORCE_INLINE	BVHQueryPtUnitWrap (const UT_FixedVector< float, NAXES > &p)
SYS_FORCE_INLINE bool	isValid (uint tree_point_index) const
template<typename RADIUS_ARRAY >
SYS_FORCE_INLINE float	queryDistance2 (const UT_FixedVector< float, NAXES > &tree_point, const RADIUS_ARRAY &radii, uint index) const
	This must be the exact distance squared. More...
template<bool farthest>
SYS_FORCE_INLINE uint	boxHitAndDist2 (const BoxType &boxes, const float max_dist_squared, const uint internal_node_num, v4uf &dist2) const

Public Attributes
const UT_FixedVector< v4uf, NAXES >	myVP
const UT_FixedVector< float, NAXES >	myP

Static Public Attributes
static constexpr bool	theAllPointsValid = true
	isValid() doesn't need to be called, because theAllPointsValid is true. More...

Detailed Description

template<uint NAXES>
struct UT::BVHQueryPtUnitWrap< NAXES >

This query point considers space to wrap between 0 and 1 in all dimensions. It only supports up to 3 dimensions due to UT_BoundingBox only having 3 dimensions. This replaces UT_KDQueryPtUnitWrap.

Definition at line 3509 of file UT_BVHImpl.h.

Member Typedef Documentation

template<uint NAXES>

using UT::BVHQueryPtUnitWrap< NAXES >::BoxType = UT::Box<v4uf,NAXES>

Definition at line 3515 of file UT_BVHImpl.h.

Constructor & Destructor Documentation

template<uint NAXES>

SYS_FORCE_INLINE UT::BVHQueryPtUnitWrap< NAXES >::BVHQueryPtUnitWrap ( const UT_FixedVector< float, NAXES > &  p )

inline

Definition at line 3518 of file UT_BVHImpl.h.

Member Function Documentation

template<uint NAXES>

template<bool farthest>

SYS_FORCE_INLINE uint UT::BVHQueryPtUnitWrap< NAXES >::boxHitAndDist2 ( const BoxType &  boxes, const float  max_dist_squared, const uint  internal_node_num, v4uf &  dist2  ) const

inline

The distance squared can be an underestimate, but not an overestimate, of the true distance squared. The reverse is the case if farthest is true. Also, if farthest is true, max_dist_squared is actually min_dist_squared.

Definition at line 3554 of file UT_BVHImpl.h.

template<uint NAXES>

SYS_FORCE_INLINE bool UT::BVHQueryPtUnitWrap< NAXES >::isValid ( uint  tree_point_index ) const

inline

NOTE: This doesn't necessarily need to be const, for subclasses that have a limit on the number of invalid points hit before giving up, for example.

Definition at line 3527 of file UT_BVHImpl.h.

template<uint NAXES>

template<typename RADIUS_ARRAY >

SYS_FORCE_INLINE float UT::BVHQueryPtUnitWrap< NAXES >::queryDistance2 ( const UT_FixedVector< float, NAXES > &  tree_point, const RADIUS_ARRAY &  radii, uint  index  ) const

inline

This must be the exact distance squared.

Definition at line 3534 of file UT_BVHImpl.h.

Member Data Documentation

template<uint NAXES>

const UT_FixedVector<float, NAXES> UT::BVHQueryPtUnitWrap< NAXES >::myP

Definition at line 3511 of file UT_BVHImpl.h.

template<uint NAXES>

const UT_FixedVector<v4uf, NAXES> UT::BVHQueryPtUnitWrap< NAXES >::myVP

Definition at line 3510 of file UT_BVHImpl.h.

template<uint NAXES>

constexpr bool UT::BVHQueryPtUnitWrap< NAXES >::theAllPointsValid = true

static

isValid() doesn't need to be called, because theAllPointsValid is true.

Definition at line 3514 of file UT_BVHImpl.h.

---

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

• UT/UT_BVHImpl.h