38 #ifndef FCL_TRAVERSAL_OCTREE_SHAPEOCTREEDISTANCETRAVERSALNODE_INL_H 39 #define FCL_TRAVERSAL_OCTREE_SHAPEOCTREEDISTANCETRAVERSALNODE_INL_H 41 #include "fcl/narrowphase/detail/traversal/octree/distance/shape_octree_distance_traversal_node.h" 50 template <
typename Shape,
typename NarrowPhaseSolver>
51 ShapeOcTreeDistanceTraversalNode<Shape, NarrowPhaseSolver>::
52 ShapeOcTreeDistanceTraversalNode()
61 template <
typename Shape,
typename NarrowPhaseSolver>
70 template <
typename Shape,
typename NarrowPhaseSolver>
74 otsolver->OcTreeShapeDistance(
75 model2, *model1, this->tf2, this->tf1, this->request, *this->result);
79 template <
typename Shape,
typename NarrowPhaseSolver>
83 const Transform3<typename Shape::S>& tf1,
84 const OcTree<typename Shape::S>& model2,
85 const Transform3<typename Shape::S>& tf2,
93 node.model1 = &model1;
94 node.model2 = &model2;
96 node.otsolver = otsolver;
Traversal node for shape-octree distance.
Definition: shape_octree_distance_traversal_node.h:59
S BVTesting(int, int) const
BV test between b1 and b2.
Definition: shape_octree_distance_traversal_node-inl.h:64
Main namespace.
Definition: broadphase_bruteforce-inl.h:45
distance result
Definition: distance_request.h:48
Transform3< Shape::S > tf2
configuration of second object
Definition: traversal_node_base.h:88
void leafTesting(int, int) const
Leaf test between node b1 and b2, if they are both leafs.
Definition: shape_octree_distance_traversal_node-inl.h:72
Algorithms for collision related with octree.
Definition: octree_solver.h:59
DistanceRequest< Shape::S > request
request setting for distance
Definition: distance_traversal_node_base.h:73
DistanceResult< Shape::S > * result
distance result kept during the traversal iteration
Definition: distance_traversal_node_base.h:76
Transform3< Shape::S > tf1
configuation of first object
Definition: traversal_node_base.h:85
request to the distance computation
Definition: distance_request.h:52