#include <shape_mesh_conservative_advancement_traversal_node.h>

Public Types | |
| using | S = typename Shape::S |
Public Types inherited from fcl::detail::ShapeMeshConservativeAdvancementTraversalNode< Shape, RSS< Shape::S >, NarrowPhaseSolver > | |
| using | S = typename RSS< Shape::S > ::S |
Public Types inherited from fcl::detail::ShapeMeshDistanceTraversalNode< Shape, RSS< Shape::S >, NarrowPhaseSolver > | |
| using | S = typename RSS< Shape::S > ::S |
Public Types inherited from fcl::detail::ShapeBVHDistanceTraversalNode< Shape, RSS< Shape::S > > | |
| using | S = typename RSS< Shape::S > ::S |
Public Member Functions | |
| S | BVTesting (int b1, int b2) const |
| BV test between b1 and b2. More... | |
| bool | canStop (S c) const |
| void | leafTesting (int b1, int b2) const |
| Leaf test between node b1 and b2, if they are both leafs. More... | |
| ShapeMeshConservativeAdvancementTraversalNodeRSS (S w_=1) | |
Public Member Functions inherited from fcl::detail::ShapeMeshConservativeAdvancementTraversalNode< Shape, RSS< Shape::S >, NarrowPhaseSolver > | |
| S | BVTesting (int b1, int b2) const |
| BV culling test in one BVTT node. More... | |
| bool | canStop (S c) const |
| Whether the traversal process can stop early. More... | |
| void | leafTesting (int b1, int b2) const |
| Conservative advancement testing between leaves (one triangle and one shape) More... | |
| ShapeMeshConservativeAdvancementTraversalNode (S w_=1) | |
Public Member Functions inherited from fcl::detail::ShapeMeshDistanceTraversalNode< Shape, RSS< Shape::S >, NarrowPhaseSolver > | |
| bool | canStop (S c) const |
| Whether the traversal process can stop early. More... | |
| void | leafTesting (int b1, int b2) const |
| Distance testing between leaves (one shape and one triangle) More... | |
| ShapeMeshDistanceTraversalNode () | |
Public Member Functions inherited from fcl::detail::ShapeBVHDistanceTraversalNode< Shape, RSS< Shape::S > > | |
| int | getSecondLeftChild (int b) const |
| Obtain the left child of BV node in the second BVH. More... | |
| int | getSecondRightChild (int b) const |
| Obtain the right child of BV node in the second BVH. More... | |
| bool | isSecondNodeLeaf (int b) const |
| Whether the BV node in the second BVH tree is leaf. More... | |
| ShapeBVHDistanceTraversalNode () | |
Public Member Functions inherited from fcl::detail::DistanceTraversalNodeBase< RSS< Shape::S > ::S > | |
| virtual bool | canStop (RSS< Shape::S > ::S c) const |
| Check whether the traversal can stop. More... | |
| DistanceTraversalNodeBase () | |
| void | enableStatistics (bool enable) |
| Whether store some statistics information during traversal. More... | |
| virtual | ~DistanceTraversalNodeBase () |
Public Member Functions inherited from fcl::detail::TraversalNodeBase< RSS< Shape::S > ::S > | |
| virtual bool | firstOverSecond (int b1, int b2) const |
| Traverse the subtree of the node in the first tree first. More... | |
| virtual int | getFirstLeftChild (int b) const |
| Get the left child of the node b in the first tree. More... | |
| virtual int | getFirstRightChild (int b) const |
| Get the right child of the node b in the first tree. More... | |
| virtual bool | isFirstNodeLeaf (int b) const |
| Whether b is a leaf node in the first BVH tree. More... | |
| virtual void | postprocess () |
| virtual void | preprocess () |
| virtual | ~TraversalNodeBase () |
Definition at line 106 of file shape_mesh_conservative_advancement_traversal_node.h.
| using fcl::detail::ShapeMeshConservativeAdvancementTraversalNodeRSS< Shape, NarrowPhaseSolver >::S = typename Shape::S |
Definition at line 111 of file shape_mesh_conservative_advancement_traversal_node.h.
| fcl::detail::ShapeMeshConservativeAdvancementTraversalNodeRSS< Shape, NarrowPhaseSolver >::ShapeMeshConservativeAdvancementTraversalNodeRSS | ( | S | w_ = 1 | ) |
Definition at line 216 of file shape_mesh_conservative_advancement_traversal_node-inl.h.
|
virtual |
BV test between b1 and b2.
Reimplemented from fcl::detail::DistanceTraversalNodeBase< RSS< Shape::S > ::S >.
Definition at line 228 of file shape_mesh_conservative_advancement_traversal_node-inl.h.
| bool fcl::detail::ShapeMeshConservativeAdvancementTraversalNodeRSS< Shape, NarrowPhaseSolver >::canStop | ( | S | c | ) | const |
Definition at line 271 of file shape_mesh_conservative_advancement_traversal_node-inl.h.
|
virtual |
Leaf test between node b1 and b2, if they are both leafs.
Reimplemented from fcl::detail::DistanceTraversalNodeBase< RSS< Shape::S > ::S >.
Definition at line 244 of file shape_mesh_conservative_advancement_traversal_node-inl.h.