#include <list>
Go to the source code of this file.
Classes | |
struct | fcl::BVHFrontNode |
Front list acceleration for collision Front list is a set of internal and leaf nodes in the BVTT hierarchy, where the traversal terminates while performing a query during a given time instance. The front list reflects the subset of a BVTT that is traversed for that particular proximity query. More... | |
Namespaces | |
namespace | fcl |
Main namespace. | |
Typedefs | |
typedef std::list< BVHFrontNode > | fcl::BVHFrontList |
BVH front list is a list of front nodes. | |
Functions | |
void | fcl::updateFrontList (BVHFrontList *front_list, int b1, int b2) |
Add new front node into the front list. |