Traversal node for distance computation between BVH and shape. More...
#include <traversal_node_bvh_shape.h>

Public Member Functions | |
| BVHShapeDistanceTraversalNode () | |
| FCL_REAL | BVTesting (int b1, int b2) const |
| BV culling test in one BVTT node. | |
| 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 | isFirstNodeLeaf (int b) const |
| Whether the BV node in the first BVH tree is leaf. | |
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 |
Traversal node for distance computation between BVH and shape.
Definition at line 608 of file traversal_node_bvh_shape.h.
| fcl::BVHShapeDistanceTraversalNode< BV, S >::BVHShapeDistanceTraversalNode | ( | ) | [inline] |
Definition at line 611 of file traversal_node_bvh_shape.h.
| FCL_REAL fcl::BVHShapeDistanceTraversalNode< BV, S >::BVTesting | ( | int | b1, |
| int | b2 | ||
| ) | const [inline, virtual] |
BV culling test in one BVTT node.
Reimplemented from fcl::DistanceTraversalNodeBase.
Reimplemented in fcl::MeshShapeDistanceTraversalNodeOBBRSS< S, NarrowPhaseSolver >, fcl::MeshShapeDistanceTraversalNodekIOS< S, NarrowPhaseSolver >, and fcl::MeshShapeDistanceTraversalNodeRSS< S, NarrowPhaseSolver >.
Definition at line 640 of file traversal_node_bvh_shape.h.
| int fcl::BVHShapeDistanceTraversalNode< BV, S >::getFirstLeftChild | ( | int | b | ) | const [inline, virtual] |
Obtain the left child of BV node in the first BVH.
Reimplemented from fcl::TraversalNodeBase.
Definition at line 628 of file traversal_node_bvh_shape.h.
| int fcl::BVHShapeDistanceTraversalNode< BV, S >::getFirstRightChild | ( | int | b | ) | const [inline, virtual] |
Obtain the right child of BV node in the first BVH.
Reimplemented from fcl::TraversalNodeBase.
Definition at line 634 of file traversal_node_bvh_shape.h.
| bool fcl::BVHShapeDistanceTraversalNode< BV, S >::isFirstNodeLeaf | ( | int | b | ) | const [inline, virtual] |
Whether the BV node in the first BVH tree is leaf.
Reimplemented from fcl::TraversalNodeBase.
Definition at line 622 of file traversal_node_bvh_shape.h.
| const BVHModel<BV>* fcl::BVHShapeDistanceTraversalNode< BV, S >::model1 |
Definition at line 645 of file traversal_node_bvh_shape.h.
| const S* fcl::BVHShapeDistanceTraversalNode< BV, S >::model2 |
Definition at line 646 of file traversal_node_bvh_shape.h.
| BV fcl::BVHShapeDistanceTraversalNode< BV, S >::model2_bv |
Definition at line 647 of file traversal_node_bvh_shape.h.
int fcl::BVHShapeDistanceTraversalNode< BV, S >::num_bv_tests [mutable] |
Definition at line 649 of file traversal_node_bvh_shape.h.
int fcl::BVHShapeDistanceTraversalNode< BV, S >::num_leaf_tests [mutable] |
Definition at line 650 of file traversal_node_bvh_shape.h.
FCL_REAL fcl::BVHShapeDistanceTraversalNode< BV, S >::query_time_seconds [mutable] |
Definition at line 651 of file traversal_node_bvh_shape.h.