$search
#include "collision_checking/BVH_defs.h"
#include "collision_checking/intersect.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_CollideResult |
A class describing the collision result. More... | |
struct | collision_checking::BVHCollisionPair |
The indices of in-collision primitives of objects. More... | |
Namespaces | |
namespace | collision_checking |
Main namespace. | |
Functions | |
void | collision_checking::collideRecurse (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_CollideResult *res, BVHFrontList *front_list=NULL) |
Recursive collision kernel between two RSS trees: for rigid motion. | |
void | collision_checking::collideRecurse (BVNode< OBB > *tree1, BVNode< OBB > *tree2, const Vec3f R[3], const Vec3f &T, int b1, int b2, Vec3f *vertices1, Vec3f *vertices2, Triangle *tri_indices1, Triangle *tri_indices2, BVH_CollideResult *res, BVHFrontList *front_list=NULL) |
Recursive collision kernel between two OBB trees: for rigid motion. | |
template<typename BV > | |
void | collision_checking::collideRecurse (BVNode< BV > *tree1, BVNode< BV > *tree2, int b1, int b2, Vec3f *vertices1, Vec3f *vertices2, Triangle *tri_indices1, Triangle *tri_indices2, BVH_CollideResult *res, BVHFrontList *front_list=NULL) |
Recursive collision kernel between between two BV trees. | |
template<typename BV > | |
void | collision_checking::continuousCollideRecurse (BVNode< BV > *tree1, BVNode< BV > *tree2, int b1, int b2, Vec3f *vertices1, Vec3f *vertices2, Vec3f *prev_vertices1, Vec3f *prev_vertices2, Triangle *tri_indices1, Triangle *tri_indices2, BVH_CollideResult *res, BVHFrontList *front_list=NULL) |
Recursive continuous collision kernel between between two BV trees. | |
template<typename BV > | |
void | collision_checking::continuousPropagateBVHFrontList (BVNode< BV > *tree1, BVNode< BV > *tree2, Vec3f *vertices1, Vec3f *vertices2, Vec3f *prev_vertices1, Vec3f *prev_vertices2, Triangle *tri_indices1, Triangle *tri_indices2, BVH_CollideResult *res, BVHFrontList *front_list) |
BVH front list propagation for continuous collision. | |
template<typename BV > | |
void | collision_checking::continuousSelfCollideRecurse (BVNode< BV > *tree, int b, Vec3f *vertices, Vec3f *prev_vertices, Triangle *tri_indices, BVH_CollideResult *res, BVHFrontList *front_list=NULL) |
Recursive continuous self collision kernel between between two BV trees. | |
void | collision_checking::propagateBVHFrontList (BVNode< RSS > *tree1, BVNode< RSS > *tree2, Vec3f R[3], const Vec3f &T, Vec3f *vertices1, Vec3f *vertices2, Triangle *tri_indices1, Triangle *tri_indices2, BVH_CollideResult *res, BVHFrontList *front_list) |
RSS front list propagation for collision of RSS trees. | |
void | collision_checking::propagateBVHFrontList (BVNode< OBB > *tree1, BVNode< OBB > *tree2, Vec3f R[3], const Vec3f &T, Vec3f *vertices1, Vec3f *vertices2, Triangle *tri_indices1, Triangle *tri_indices2, BVH_CollideResult *res, BVHFrontList *front_list) |
BVH front list propagation for collision of OBB trees. | |
template<typename BV > | |
void | collision_checking::propagateBVHFrontList (BVNode< BV > *tree1, BVNode< BV > *tree2, Vec3f *vertices1, Vec3f *vertices2, Triangle *tri_indices1, Triangle *tri_indices2, BVH_CollideResult *res, BVHFrontList *front_list) |
BVH front list propagation for collision. | |
template<typename BV > | |
void | collision_checking::selfCollideRecurse (BVNode< BV > *tree, int b, Vec3f *vertices, Triangle *tri_indices, BVH_CollideResult *res, BVHFrontList *front_list=NULL) |
Recursive self collision kernel on one BV tree. |