$search
#include "collision_checking/BVH_defs.h"
#include "collision_checking/BVH_model.h"
#include "collision_checking/BVH_front.h"
Go to the source code of this file.
Classes | |
struct | collision_checking::BVH_DistanceResult |
Namespaces | |
namespace | collision_checking |
Main namespace. | |
Functions | |
void | collision_checking::distanceQueueRecurse (BVNode< RSS > *tree1, BVNode< RSS > *tree2, const Vec3f R[3], const Vec3f &T, int b1, int b2, Vec3f *vertices1, Vec3f *vertices2, Triangle *tri_indices1, Triangle *tri_indices2, BVH_DistanceResult *res, BVHFrontList *front_list=NULL) |
Recursive proximity kernel between two RSS trees, using BVT queue acceleration. | |
void | collision_checking::distanceRecurse (BVNode< RSS > *tree1, BVNode< RSS > *tree2, const Vec3f R[3], const Vec3f &T, int b1, int b2, Vec3f *vertices1, Vec3f *vertices2, Triangle *tri_indices1, Triangle *tri_indices2, BVH_DistanceResult *res, BVHFrontList *front_list=NULL) |
Recursive proximity kernel between two RSS trees. | |
template<typename BV > | |
void | collision_checking::distanceRecurse (BVNode< BV > *tree1, BVNode< BV > *tree2, int b1, int b2, Vec3f *vertices1, Vec3f *vertices2, Triangle *tri_indices1, Triangle *tri_indices2, BVH_DistanceResult *res, BVHFrontList *front_list=NULL) |
Recursive proximity kernel between two BV trees. |