38 #ifndef FCL_TRAVERSAL_BVHDISTANCETRAVERSALNODE_H 39 #define FCL_TRAVERSAL_BVHDISTANCETRAVERSALNODE_H 41 #include "fcl/narrowphase/detail/traversal/traversal_node_base.h" 42 #include "fcl/narrowphase/detail/traversal/distance/distance_traversal_node_base.h" 43 #include "fcl/geometry/bvh/BVH_model.h" 52 template <
typename BV>
58 using S =
typename BV::S;
93 mutable int num_leaf_tests;
94 mutable S query_time_seconds;
100 #include "fcl/narrowphase/detail/traversal/distance/bvh_distance_traversal_node-inl.h" const BVHModel< BV > * model1
The first BVH model.
Definition: bvh_distance_traversal_node.h:87
Main namespace.
Definition: broadphase_bruteforce-inl.h:45
bool isSecondNodeLeaf(int b) const
Whether the BV node in the second BVH tree is leaf.
Definition: bvh_distance_traversal_node-inl.h:71
S BVTesting(int b1, int b2) const
BV culling test in one BVTT node.
Definition: bvh_distance_traversal_node-inl.h:121
Traversal node for distance computation between BVH models.
Definition: bvh_distance_traversal_node.h:53
int num_bv_tests
statistical information
Definition: bvh_distance_traversal_node.h:92
Node structure encoding the information required for distance traversal.
Definition: distance_traversal_node_base.h:53
bool isFirstNodeLeaf(int b) const
Whether the BV node in the first BVH tree is leaf.
Definition: bvh_distance_traversal_node-inl.h:64
int getSecondLeftChild(int b) const
Obtain the left child of BV node in the second BVH.
Definition: bvh_distance_traversal_node-inl.h:107
int getFirstLeftChild(int b) const
Obtain the left child of BV node in the first BVH.
Definition: bvh_distance_traversal_node-inl.h:93
A class describing the bounding hierarchy of a mesh model or a point cloud model (which is viewed as ...
Definition: BVH_model.h:57
const BVHModel< BV > * model2
The second BVH model.
Definition: bvh_distance_traversal_node.h:89
int getFirstRightChild(int b) const
Obtain the right child of BV node in the first BVH.
Definition: bvh_distance_traversal_node-inl.h:100
int getSecondRightChild(int b) const
Obtain the right child of BV node in the second BVH.
Definition: bvh_distance_traversal_node-inl.h:114
bool firstOverSecond(int b1, int b2) const
Determine the traversal order, is the first BVTT subtree better.
Definition: bvh_distance_traversal_node-inl.h:78