38 #ifndef FCL_TRAVERSAL_BVHSHAPEDISTANCETRAVERSALNODE_H 39 #define FCL_TRAVERSAL_BVHSHAPEDISTANCETRAVERSALNODE_H 41 #include "fcl/narrowphase/detail/traversal/distance/distance_traversal_node_base.h" 42 #include "fcl/geometry/bvh/BVH_model.h" 51 template<
typename BV,
typename Shape>
57 using S =
typename BV::S;
77 mutable int num_bv_tests;
78 mutable int num_leaf_tests;
79 mutable S query_time_seconds;
85 #include "fcl/narrowphase/detail/traversal/distance/bvh_shape_distance_traversal_node-inl.h" Main namespace.
Definition: broadphase_bruteforce-inl.h:45
int getFirstLeftChild(int b) const
Obtain the left child of BV node in the first BVH.
Definition: bvh_shape_distance_traversal_node-inl.h:71
Traversal node for distance computation between BVH and shape.
Definition: bvh_shape_distance_traversal_node.h:52
Node structure encoding the information required for distance traversal.
Definition: distance_traversal_node_base.h:53
S BVTesting(int b1, int b2) const
BV culling test in one BVTT node.
Definition: bvh_shape_distance_traversal_node-inl.h:85
A class describing the bounding hierarchy of a mesh model or a point cloud model (which is viewed as ...
Definition: BVH_model.h:57
bool isFirstNodeLeaf(int b) const
Whether the BV node in the first BVH tree is leaf.
Definition: bvh_shape_distance_traversal_node-inl.h:64
int getFirstRightChild(int b) const
Obtain the right child of BV node in the first BVH.
Definition: bvh_shape_distance_traversal_node-inl.h:78