Traversal node for distance computation between shape and BVH. More...
#include <traversal_node_bvh_shape.h>
Public Member Functions | |
FCL_REAL | BVTesting (int b1, int b2) const |
BV culling test in one BVTT node. | |
int | getSecondLeftChild (int b) const |
Obtain the left child of BV node in the second BVH. | |
int | getSecondRightChild (int b) const |
Obtain the right child of BV node in the second BVH. | |
bool | isSecondNodeLeaf (int b) const |
Whether the BV node in the second BVH tree is leaf. | |
ShapeBVHDistanceTraversalNode () | |
Public Attributes | |
const S * | model1 |
BV | model1_bv |
const BVHModel< BV > * | model2 |
int | num_bv_tests |
int | num_leaf_tests |
FCL_REAL | query_time_seconds |
Traversal node for distance computation between shape and BVH.
Definition at line 656 of file traversal_node_bvh_shape.h.
fcl::ShapeBVHDistanceTraversalNode< S, BV >::ShapeBVHDistanceTraversalNode | ( | ) | [inline] |
Definition at line 659 of file traversal_node_bvh_shape.h.
FCL_REAL fcl::ShapeBVHDistanceTraversalNode< S, BV >::BVTesting | ( | int | b1, |
int | b2 | ||
) | const [inline, virtual] |
BV culling test in one BVTT node.
Reimplemented from fcl::DistanceTraversalNodeBase.
Reimplemented in fcl::ShapeMeshDistanceTraversalNodeOBBRSS< S, NarrowPhaseSolver >, fcl::ShapeMeshDistanceTraversalNodekIOS< S, NarrowPhaseSolver >, and fcl::ShapeMeshDistanceTraversalNodeRSS< S, NarrowPhaseSolver >.
Definition at line 688 of file traversal_node_bvh_shape.h.
int fcl::ShapeBVHDistanceTraversalNode< S, BV >::getSecondLeftChild | ( | int | b | ) | const [inline, virtual] |
Obtain the left child of BV node in the second BVH.
Reimplemented from fcl::TraversalNodeBase.
Definition at line 676 of file traversal_node_bvh_shape.h.
int fcl::ShapeBVHDistanceTraversalNode< S, BV >::getSecondRightChild | ( | int | b | ) | const [inline, virtual] |
Obtain the right child of BV node in the second BVH.
Reimplemented from fcl::TraversalNodeBase.
Definition at line 682 of file traversal_node_bvh_shape.h.
bool fcl::ShapeBVHDistanceTraversalNode< S, BV >::isSecondNodeLeaf | ( | int | b | ) | const [inline, virtual] |
Whether the BV node in the second BVH tree is leaf.
Reimplemented from fcl::TraversalNodeBase.
Definition at line 670 of file traversal_node_bvh_shape.h.
const S* fcl::ShapeBVHDistanceTraversalNode< S, BV >::model1 |
Definition at line 693 of file traversal_node_bvh_shape.h.
BV fcl::ShapeBVHDistanceTraversalNode< S, BV >::model1_bv |
Definition at line 695 of file traversal_node_bvh_shape.h.
const BVHModel<BV>* fcl::ShapeBVHDistanceTraversalNode< S, BV >::model2 |
Definition at line 694 of file traversal_node_bvh_shape.h.
int fcl::ShapeBVHDistanceTraversalNode< S, BV >::num_bv_tests [mutable] |
Definition at line 697 of file traversal_node_bvh_shape.h.
int fcl::ShapeBVHDistanceTraversalNode< S, BV >::num_leaf_tests [mutable] |
Definition at line 698 of file traversal_node_bvh_shape.h.
FCL_REAL fcl::ShapeBVHDistanceTraversalNode< S, BV >::query_time_seconds [mutable] |
Definition at line 699 of file traversal_node_bvh_shape.h.