@brief Contact information returned by collision

@brief Cost source describes an area with a cost. The area is described by an AABB region.

@brief Center at zero point, axis aligned box

@brief A class describing the AABB collision structure, which is a box in 3D space determined by two diagonal points

@brief Triangle with 3 indices for points

@brief request to the collision algorithm

@brief Half Space: this is equivalent to the Plane in ODE. The separation plane is defined as n * x = d; Points in the negative side of the separation

@brief Infinite plane

@brief Simple transform class used locally by InterpMotion

\brief Functor sorting objects according to the AABB lower x bound */

\brief Functor sorting objects according to the AABB lower y bound */

\brief Functor sorting objects according to the AABB lower z bound */

@brief request to the distance computation

@brief Front list acceleration for collision Front list is a set of internal and leaf nodes in the BVTT hierarchy, where the traversal terminates whil

@brief Spatial hash function: hash an AABB to a set of integer values

@brief States for BVH construction empty->begun->processed ->replace_begun->processed -> ...... | |-> update_begun -> updated -> .....

@brief BVH model type

@brief Error code for BVH

@brief BVNodeBase encodes the tree structure for BVH

\brief Bounding volume test structure */

\brief Comparer between two BVT */

@brief Base class for broad phase collision. It helps to accelerate the collision/distance between N objects. Also support self collision, self distan

@brief Center at zero point capsule

@brief Collision data stores the collision request and the result given by collision algorithm.

@brief The geometry for the object for collision or distance computation

@brief the object for collision or distance computation, contains the geometry and the transform information

@brief Node structure encoding the information required for collision traversal.

@brief Center at zero cone

@brief Convex polytope

@brief Center at zero cylinder

@brief Distance data stores the distance request and the result given by distance algorithm.

@ brief Structure for minimum distance between two meshes and the corresponding nearest point pair

@brief Node structure encoding the information required for distance traversal.

\brief Dummy collision object with a point AABB */