Public Member Functions | Public Attributes
fcl::BVHShapeCollisionTraversalNode< BV, S > Class Template Reference

Traversal node for collision between BVH and shape. More...

#include <hpp/fcl/traversal/traversal_node_bvh_shape.h>

Inheritance diagram for fcl::BVHShapeCollisionTraversalNode< BV, S >:
[legend]
Collaboration diagram for fcl::BVHShapeCollisionTraversalNode< BV, S >:
[legend]

List of all members.

Public Member Functions

 BVHShapeCollisionTraversalNode (bool enable_distance_lower_bound)
bool isFirstNodeLeaf (int b) const
 Whether the BV node in the first BVH tree is leaf.
int getFirstLeftChild (int b) const
 Obtain the left child of BV node in the first BVH.
int getFirstRightChild (int b) const
 Obtain the right child of BV node in the first BVH.
bool BVTesting (int b1, int b2) const
 BV culling test in one BVTT node.
bool BVTesting (int b1, int b2, FCL_REAL &sqrDistLowerBound) const
 BV test between b1 and b2.

Public Attributes

const BVHModel< BV > * model1
const S * model2
BV model2_bv
int num_bv_tests
int num_leaf_tests
FCL_REAL query_time_seconds

Detailed Description

template<typename BV, typename S>
class fcl::BVHShapeCollisionTraversalNode< BV, S >

Traversal node for collision between BVH and shape.


Constructor & Destructor Documentation

template<typename BV, typename S>
fcl::BVHShapeCollisionTraversalNode< BV, S >::BVHShapeCollisionTraversalNode ( bool  enable_distance_lower_bound) [inline]

Member Function Documentation

template<typename BV, typename S>
bool fcl::BVHShapeCollisionTraversalNode< BV, S >::BVTesting ( int  b1,
int  b2 
) const [inline, virtual]
template<typename BV, typename S>
bool fcl::BVHShapeCollisionTraversalNode< BV, S >::BVTesting ( int  b1,
int  b2,
FCL_REAL sqrDistLowerBound 
) const [inline, virtual]

BV test between b1 and b2.

Parameters:
b1,b2Bounding volumes to test,
Return values:
sqrDistLowerBoundsquare of a lower bound of the minimal distance between bounding volumes. BV culling test in one BVTT node

Implements fcl::CollisionTraversalNodeBase.

Reimplemented in fcl::MeshShapeCollisionTraversalNodeOBBRSS< S, NarrowPhaseSolver >.

template<typename BV, typename S>
int fcl::BVHShapeCollisionTraversalNode< BV, S >::getFirstLeftChild ( int  b) const [inline, virtual]

Obtain the left child of BV node in the first BVH.

Reimplemented from fcl::TraversalNodeBase.

template<typename BV, typename S>
int fcl::BVHShapeCollisionTraversalNode< BV, S >::getFirstRightChild ( int  b) const [inline, virtual]

Obtain the right child of BV node in the first BVH.

Reimplemented from fcl::TraversalNodeBase.

template<typename BV, typename S>
bool fcl::BVHShapeCollisionTraversalNode< BV, S >::isFirstNodeLeaf ( int  b) const [inline, virtual]

Whether the BV node in the first BVH tree is leaf.

Reimplemented from fcl::TraversalNodeBase.


Member Data Documentation

template<typename BV, typename S>
const BVHModel<BV>* fcl::BVHShapeCollisionTraversalNode< BV, S >::model1
template<typename BV, typename S>
const S* fcl::BVHShapeCollisionTraversalNode< BV, S >::model2
template<typename BV, typename S>
BV fcl::BVHShapeCollisionTraversalNode< BV, S >::model2_bv
template<typename BV, typename S>
int fcl::BVHShapeCollisionTraversalNode< BV, S >::num_bv_tests [mutable]
template<typename BV, typename S>
int fcl::BVHShapeCollisionTraversalNode< BV, S >::num_leaf_tests [mutable]
template<typename BV, typename S>
FCL_REAL fcl::BVHShapeCollisionTraversalNode< BV, S >::query_time_seconds [mutable]
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines