38 #ifndef FCL_TRAVERSAL_RECURSE_H 39 #define FCL_TRAVERSAL_RECURSE_H 61 void collisionRecurse(MeshCollisionTraversalNodeOBB<S>* node,
int b1,
int b2,
const Matrix3<S>& R,
const Vector3<S>& T,
BVHFrontList* front_list);
66 void collisionRecurse(MeshCollisionTraversalNodeRSS<S>* node,
int b1,
int b2,
const Matrix3<S>& R,
const Vector3<S>& T,
BVHFrontList* front_list);
template void selfCollisionRecurse(CollisionTraversalNodeBase< double > *node, int b, BVHFrontList *front_list)
template void propagateBVHFrontListCollisionRecurse(CollisionTraversalNodeBase< double > *node, BVHFrontList *front_list)
template void distanceRecurse(DistanceTraversalNodeBase< double > *node, int b1, int b2, BVHFrontList *front_list)
template void distanceQueueRecurse(DistanceTraversalNodeBase< double > *node, int b1, int b2, BVHFrontList *front_list, int qsize)
std::list< BVHFrontNode > BVHFrontList
BVH front list is a list of front nodes.
template void collisionRecurse(CollisionTraversalNodeBase< double > *node, int b1, int b2, BVHFrontList *front_list)