Go to the documentation of this file.
38 #ifndef HPP_FCL_TRAVERSAL_RECURSE_H
39 #define HPP_FCL_TRAVERSAL_RECURSE_H
73 const CollisionRequest& request,
74 CollisionResult& result,
std::list< BVHFrontNode > BVHFrontList
BVH front list is a list of front nodes.
void distanceRecurse(DistanceTraversalNodeBase *node, unsigned int b1, unsigned int b2, BVHFrontList *front_list)
void collisionRecurse(CollisionTraversalNodeBase *node, unsigned int b1, unsigned int b2, BVHFrontList *front_list, FCL_REAL &sqrDistLowerBound)
void propagateBVHFrontListCollisionRecurse(CollisionTraversalNodeBase *node, const CollisionRequest &, CollisionResult &result, BVHFrontList *front_list)
void distanceQueueRecurse(DistanceTraversalNodeBase *node, unsigned int b1, unsigned int b2, BVHFrontList *front_list, unsigned int qsize)
void collisionNonRecurse(CollisionTraversalNodeBase *node, BVHFrontList *front_list, FCL_REAL &sqrDistLowerBound)
hpp-fcl
Author(s):
autogenerated on Fri Aug 2 2024 02:45:15