Class Hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 123456]

C_ccd_simplex_t
C_ccd_support_t
Cfcl::AABB< S_ >	A class describing the AABB collision structure, which is a box in 3D space determined by two diagonal points
Cfcl::AABB< BV::S >
Cfcl::AABB< kIOS< S >::S >
Cfcl::AABB< kIOS< Shape::S >::S >
Cfcl::AABB< NarrowPhaseSolver::S >
Cfcl::AABB< OBB< S >::S >
Cfcl::AABB< OBB< Shape::S >::S >
Cfcl::AABB< OBBRSS< S >::S >
Cfcl::AABB< OBBRSS< Shape::S >::S >
Cfcl::AABB< RSS< S >::S >
Cfcl::AABB< RSS< Shape::S >::S >
Cfcl::AABB< S >
Cfcl::AABB< Shape1::S >
Cfcl::AABB< Shape::S >
Cfcl::detail::ApplyImpl< S, BV >
Cfcl::detail::ApplyImpl< S, kIOS< S > >
Cfcl::detail::ApplyImpl< S, OBB< S > >
Cfcl::detail::ApplyImpl< S, OBBRSS< S > >
Cfcl::detail::ApplyImpl< S, RSS< S > >
►Cfcl::BroadPhaseCollisionManager< S >	Base class for broad phase collision. It helps to accelerate the collision/distance between N objects. Also support self collision, self distance and collision/distance with another M objects
Cfcl::DynamicAABBTreeCollisionManager< S >
Cfcl::DynamicAABBTreeCollisionManager_Array< S >
Cfcl::IntervalTreeCollisionManager< S >	Collision manager based on interval tree
Cfcl::NaiveCollisionManager< S >	Brute force N-body collision manager
Cfcl::SaPCollisionManager< S >	Rigorous SAP collision manager
Cfcl::SpatialHashingCollisionManager< S, HashTable >	Spatial hashing collision mananger
Cfcl::SSaPCollisionManager< S >	Simple SAP collision manager
Cfcl::BroadPhaseContinuousCollisionManager< S >	Base class for broad phase continuous collision. It helps to accelerate the continuous collision/distance between N objects. Also support self collision, self distance and collision/distance with another M objects
►Cfcl::detail::BVFitterBase< BV >	Interface for fitting a bv given the triangles or points inside it
Cfcl::detail::BVFitter< BV >	The class for the default algorithm fitting a bounding volume to a set of points
Cfcl::detail::BVHCollideImpl< S, BV >
Cfcl::detail::BVHCollideImpl< S, kIOS< S > >
Cfcl::detail::BVHCollideImpl< S, OBB< S > >
Cfcl::detail::BVHCollideImpl< S, OBBRSS< S > >
Cfcl::detail::BVHContinuousCollisionPair< S >	Traversal node for continuous collision between BVH models
Cfcl::detail::BVHDistanceImpl< S, BV >
Cfcl::detail::BVHDistanceImpl< S, kIOS< S > >
Cfcl::detail::BVHDistanceImpl< S, OBBRSS< S > >
Cfcl::detail::BVHDistanceImpl< S, RSS< S > >
Cfcl::detail::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
Cfcl::detail::BVHShapeCollider< BV, Shape, NarrowPhaseSolver >
Cfcl::detail::BVHShapeCollider< kIOS< typename Shape::S >, Shape, NarrowPhaseSolver >
Cfcl::detail::BVHShapeCollider< OBB< typename Shape::S >, Shape, NarrowPhaseSolver >
Cfcl::detail::BVHShapeCollider< OBBRSS< typename Shape::S >, Shape, NarrowPhaseSolver >
Cfcl::detail::BVHShapeCollider< RSS< typename Shape::S >, Shape, NarrowPhaseSolver >
Cfcl::detail::BVHShapeDistancer< BV, Shape, NarrowPhaseSolver >
Cfcl::detail::BVHShapeDistancer< kIOS< typename Shape::S >, Shape, NarrowPhaseSolver >
Cfcl::detail::BVHShapeDistancer< OBBRSS< typename Shape::S >, Shape, NarrowPhaseSolver >
Cfcl::detail::BVHShapeDistancer< RSS< typename Shape::S >, Shape, NarrowPhaseSolver >
Cfcl::BVMotionBoundVisitor< S >	Compute the motion bound for a bounding volume, given the closest direction n between two query objects
►Cfcl::BVMotionBoundVisitor< BV::S >
Cfcl::TBVMotionBoundVisitor< BV >
►Cfcl::BVNodeBase	BVNodeBase encodes the tree structure for BVH
Cfcl::BVNode< kIOS< S > >
Cfcl::BVNode< kIOS< Shape::S > >
Cfcl::BVNode< OBB< S > >
Cfcl::BVNode< OBB< Shape::S > >
Cfcl::BVNode< OBBRSS< S > >
Cfcl::BVNode< OBBRSS< Shape::S > >
Cfcl::BVNode< RSS< S > >
Cfcl::BVNode< RSS< Shape::S > >
Cfcl::BVNode< BV >	A class describing a bounding volume node. It includes the tree structure providing in BVNodeBase and also the geometry data provided in BV template parameter
►Cfcl::detail::BVSplitterBase< BV >	Base interface for BV splitting algorithm
Cfcl::detail::BVSplitter< BV >	A class describing the split rule that splits each BV node
Cfcl::detail::BVT< S >	Bounding volume test structure
Cfcl::detail::BVT_Comparer< S >	Comparer between two BVT
Cfcl::detail::BVTQ< S >
Cfcl::detail::CanStopImpl< S, BV >
Cfcl::detail::CanStopImpl< S, OBB< S > >
Cfcl::detail::CanStopImpl< S, OBBRSS< S > >
Cfcl::detail::CanStopImpl< S, RSS< S > >
►Cfcl::detail::ccd_obj_t
Cfcl::detail::ccd_box_t
Cfcl::detail::ccd_cap_t
Cfcl::detail::ccd_cone_t
Cfcl::detail::ccd_convex_t< S >
Cfcl::detail::ccd_cyl_t
Cfcl::detail::ccd_ellipsoid_t
Cfcl::detail::ccd_sphere_t
Cfcl::detail::ccd_triangle_t
Cfcl::detail::CollisionFunctionMatrix< NarrowPhaseSolver >	Collision matrix stores the functions for collision between different types of objects and provides a uniform call interface
►Cfcl::CollisionGeometry< S >	The geometry for the object for collision or distance computation
►Cfcl::ShapeBase< S >
Cfcl::Convex< S >
►Cfcl::CollisionGeometry< BV::S >
Cfcl::BVHModel< BV >	A class describing the bounding hierarchy of a mesh model or a point cloud model (which is viewed as a degraded version of mesh)
►Cfcl::CollisionGeometry< kIOS< S >::S >
Cfcl::BVHModel< kIOS< S > >
►Cfcl::CollisionGeometry< kIOS< Shape::S >::S >
Cfcl::BVHModel< kIOS< Shape::S > >
Cfcl::CollisionGeometry< NarrowPhaseSolver::S >
►Cfcl::CollisionGeometry< OBB< S >::S >
Cfcl::BVHModel< OBB< S > >
►Cfcl::CollisionGeometry< OBB< Shape::S >::S >
Cfcl::BVHModel< OBB< Shape::S > >
►Cfcl::CollisionGeometry< OBBRSS< S >::S >
Cfcl::BVHModel< OBBRSS< S > >
►Cfcl::CollisionGeometry< OBBRSS< Shape::S >::S >
Cfcl::BVHModel< OBBRSS< Shape::S > >
►Cfcl::CollisionGeometry< RSS< S >::S >
Cfcl::BVHModel< RSS< S > >
►Cfcl::CollisionGeometry< RSS< Shape::S >::S >
Cfcl::BVHModel< RSS< Shape::S > >
►Cfcl::CollisionGeometry< S_ >
►Cfcl::ShapeBase< S_ >	Base class for all basic geometric shapes
Cfcl::Box< S_ >	Center at zero point, axis aligned box
Cfcl::Capsule< S_ >	Center at zero point capsule
Cfcl::Cone< S_ >	Center at zero cone
Cfcl::Convex< S_ >	Convex polytope
Cfcl::Cylinder< S_ >	Center at zero cylinder
Cfcl::Ellipsoid< S_ >	Center at zero point ellipsoid
Cfcl::Halfspace< S_ >	Half Space: this is equivalent to the Planed in ODE. The separation plane is defined as n * x = d; Points in the negative side of the separation plane (i.e. {x | n * x < d}) are inside the half space and points in the positive side of the separation plane (i.e. {x | n * x > d}) are outside the half space
Cfcl::Plane< S_ >	Infinite plane
Cfcl::Sphere< S_ >	Center at zero point sphere
Cfcl::TriangleP< S_ >	Triangle stores the points instead of only indices of points
Cfcl::CollisionGeometry< Shape1::S >
Cfcl::CollisionGeometry< Shape::S >
►Cfcl::CollisionObject< S >	Object for collision or distance computation, contains the geometry and the transform information
Cfcl::DummyCollisionObject< S >	Dummy collision object with a point AABB<S>
Cfcl::CollisionRequest< S >	Request to the collision algorithm
Cfcl::CollisionRequest< BV::S >
Cfcl::CollisionRequest< kIOS< S >::S >
Cfcl::CollisionRequest< kIOS< Shape::S >::S >
Cfcl::CollisionRequest< NarrowPhaseSolver::S >
Cfcl::CollisionRequest< OBB< S >::S >
Cfcl::CollisionRequest< OBB< Shape::S >::S >
Cfcl::CollisionRequest< OBBRSS< S >::S >
Cfcl::CollisionRequest< OBBRSS< Shape::S >::S >
Cfcl::CollisionRequest< RSS< S >::S >
Cfcl::CollisionRequest< RSS< Shape::S >::S >
Cfcl::CollisionRequest< Shape1::S >
Cfcl::CollisionRequest< Shape::S >
Cfcl::CollisionResult< S >	Collision result
Cfcl::CollisionResult< BV::S >
Cfcl::CollisionResult< kIOS< S >::S >
Cfcl::CollisionResult< kIOS< Shape::S >::S >
Cfcl::CollisionResult< NarrowPhaseSolver::S >
Cfcl::CollisionResult< OBB< S >::S >
Cfcl::CollisionResult< OBB< Shape::S >::S >
Cfcl::CollisionResult< OBBRSS< S >::S >
Cfcl::CollisionResult< OBBRSS< Shape::S >::S >
Cfcl::CollisionResult< RSS< S >::S >
Cfcl::CollisionResult< RSS< Shape::S >::S >
Cfcl::CollisionResult< Shape1::S >
Cfcl::CollisionResult< Shape::S >
Cfcl::detail::ComputeBVImpl< S, BV, Shape >
Cfcl::detail::ComputeBVImpl< S, AABB< S >, Box< S > >
Cfcl::detail::ComputeBVImpl< S, AABB< S >, Capsule< S > >
Cfcl::detail::ComputeBVImpl< S, AABB< S >, Cone< S > >
Cfcl::detail::ComputeBVImpl< S, AABB< S >, Convex< S > >
Cfcl::detail::ComputeBVImpl< S, AABB< S >, Cylinder< S > >
Cfcl::detail::ComputeBVImpl< S, AABB< S >, Ellipsoid< S > >
Cfcl::detail::ComputeBVImpl< S, AABB< S >, Halfspace< S > >
Cfcl::detail::ComputeBVImpl< S, AABB< S >, Plane< S > >
Cfcl::detail::ComputeBVImpl< S, AABB< S >, Sphere< S > >
Cfcl::detail::ComputeBVImpl< S, AABB< S >, TriangleP< S > >
Cfcl::detail::ComputeBVImpl< S, KDOP< S, 16 >, Halfspace< S > >
Cfcl::detail::ComputeBVImpl< S, KDOP< S, 16 >, Plane< S > >
Cfcl::detail::ComputeBVImpl< S, KDOP< S, 18 >, Halfspace< S > >
Cfcl::detail::ComputeBVImpl< S, KDOP< S, 18 >, Plane< S > >
Cfcl::detail::ComputeBVImpl< S, KDOP< S, 24 >, Halfspace< S > >
Cfcl::detail::ComputeBVImpl< S, KDOP< S, 24 >, Plane< S > >
Cfcl::detail::ComputeBVImpl< S, kIOS< S >, Halfspace< S > >
Cfcl::detail::ComputeBVImpl< S, kIOS< S >, Plane< S > >
Cfcl::detail::ComputeBVImpl< S, OBB< S >, Box< S > >
Cfcl::detail::ComputeBVImpl< S, OBB< S >, Capsule< S > >
Cfcl::detail::ComputeBVImpl< S, OBB< S >, Cone< S > >
Cfcl::detail::ComputeBVImpl< S, OBB< S >, Convex< S > >
Cfcl::detail::ComputeBVImpl< S, OBB< S >, Cylinder< S > >
Cfcl::detail::ComputeBVImpl< S, OBB< S >, Ellipsoid< S > >
Cfcl::detail::ComputeBVImpl< S, OBB< S >, Halfspace< S > >
Cfcl::detail::ComputeBVImpl< S, OBB< S >, Plane< S > >
Cfcl::detail::ComputeBVImpl< S, OBB< S >, Sphere< S > >
Cfcl::detail::ComputeBVImpl< S, OBBRSS< S >, Halfspace< S > >
Cfcl::detail::ComputeBVImpl< S, OBBRSS< S >, Plane< S > >
Cfcl::detail::ComputeBVImpl< S, RSS< S >, Halfspace< S > >
Cfcl::detail::ComputeBVImpl< S, RSS< S >, Plane< S > >
Cfcl::detail::ComputeRuleCenterImpl< S, BV >
Cfcl::detail::ComputeRuleCenterImpl< S, kIOS< S > >
Cfcl::detail::ComputeRuleCenterImpl< S, OBB< S > >
Cfcl::detail::ComputeRuleCenterImpl< S, OBBRSS< S > >
Cfcl::detail::ComputeRuleCenterImpl< S, RSS< S > >
Cfcl::detail::ComputeRuleMeanImpl< S, BV >
Cfcl::detail::ComputeRuleMeanImpl< S, kIOS< S > >
Cfcl::detail::ComputeRuleMeanImpl< S, OBB< S > >
Cfcl::detail::ComputeRuleMeanImpl< S, OBBRSS< S > >
Cfcl::detail::ComputeRuleMeanImpl< S, RSS< S > >
Cfcl::detail::ComputeRuleMedianImpl< S, BV >
Cfcl::detail::ComputeRuleMedianImpl< S, kIOS< S > >
Cfcl::detail::ComputeRuleMedianImpl< S, OBB< S > >
Cfcl::detail::ComputeRuleMedianImpl< S, OBBRSS< S > >
Cfcl::detail::ComputeRuleMedianImpl< S, RSS< S > >
Cfcl::detail::ComputeSplitVectorImpl< S, BV >
Cfcl::detail::ComputeSplitVectorImpl< S, kIOS< S > >
Cfcl::detail::ComputeSplitVectorImpl< S, OBBRSS< S > >
Cfcl::detail::ConservativeAdvancementFunctionMatrix< NarrowPhaseSolver >
Cfcl::detail::ConservativeAdvancementImpl< S, Shape, NarrowPhaseSolver >
Cfcl::detail::ConservativeAdvancementImpl< S, BVHModel< OBBRSS< S > >, NarrowPhaseSolver >
Cfcl::detail::ConservativeAdvancementImpl< S, BVHModel< RSS< S > >, NarrowPhaseSolver >
Cfcl::detail::ConservativeAdvancementStackData< S >
Cfcl::constants< S >
Cfcl::Contact< S >	Contact information returned by collision
Cfcl::ContactPoint< S >	Minimal contact information returned by collision
Cfcl::ContinuousCollisionObject< S >	Object for continuous collision or distance computation, contains the geometry and the motion information
Cfcl::ContinuousCollisionRequest< S >
Cfcl::ContinuousCollisionResult< S >	Continuous collision result
Cfcl::detail::ConvertBVImpl< S, BV1, BV2 >	Convert a bounding volume of type BV1 in configuration tf1 to a bounding volume of type BV2 in I configuration
Cfcl::detail::ConvertBVImpl< S, AABB< S >, AABB< S > >	Convert from AABB to AABB, not very tight but is fast
Cfcl::detail::ConvertBVImpl< S, AABB< S >, OBB< S > >
Cfcl::detail::ConvertBVImpl< S, AABB< S >, RSS< S > >
Cfcl::detail::ConvertBVImpl< S, BV1, AABB< S > >
Cfcl::detail::ConvertBVImpl< S, BV1, OBB< S > >
Cfcl::detail::ConvertBVImpl< S, OBB< S >, OBB< S > >
Cfcl::detail::ConvertBVImpl< S, OBB< S >, RSS< S > >
Cfcl::detail::ConvertBVImpl< S, OBBRSS< S >, OBB< S > >
Cfcl::detail::ConvertBVImpl< S, OBBRSS< S >, RSS< S > >
Cfcl::detail::ConvertBVImpl< S, RSS< S >, OBB< S > >
Cfcl::detail::ConvertBVImpl< S, RSS< S >, RSS< S > >
Cfcl::CostSource< S >	Cost source describes an area with a cost. The area is described by an AABB<S> region
Cfcl::detail::dataDoubleVal
Cfcl::detail::dataIntVal
Cfcl::detail::DistanceFunctionMatrix< NarrowPhaseSolver >	Distance matrix stores the functions for distance between different types of objects and provides a uniform call interface
Cfcl::DistanceRequest< S >	Request to the distance computation
Cfcl::DistanceRequest< BV::S >
Cfcl::DistanceRequest< kIOS< S >::S >
Cfcl::DistanceRequest< kIOS< Shape::S >::S >
Cfcl::DistanceRequest< NarrowPhaseSolver::S >
Cfcl::DistanceRequest< OBBRSS< S >::S >
Cfcl::DistanceRequest< OBBRSS< Shape::S >::S >
Cfcl::DistanceRequest< RSS< S >::S >
Cfcl::DistanceRequest< RSS< Shape::S >::S >
Cfcl::DistanceRequest< Shape1::S >
Cfcl::DistanceRequest< Shape::S >
Cfcl::DistanceResult< S >	Distance result
Cfcl::DistanceResult< BV::S >
Cfcl::DistanceResult< kIOS< S >::S >
Cfcl::DistanceResult< kIOS< Shape::S >::S >
Cfcl::DistanceResult< NarrowPhaseSolver::S >
Cfcl::DistanceResult< OBBRSS< S >::S >
Cfcl::DistanceResult< OBBRSS< Shape::S >::S >
Cfcl::DistanceResult< RSS< S >::S >
Cfcl::DistanceResult< RSS< Shape::S >::S >
Cfcl::DistanceResult< Shape1::S >
Cfcl::DistanceResult< Shape::S >
Cfcl::Convex< S_ >::Edge
Cfcl::SaPCollisionManager< S >::EndPoint	End point for an interval
Cfcl::IntervalTreeCollisionManager< S >::EndPoint	SAP end point
Cfcl::detail::EPA< S >	Class for EPA algorithm
Cfcl::detail::FitImpl< S, BV >
Cfcl::detail::FitImpl< S, kIOS< S > >
Cfcl::detail::FitImpl< S, OBB< S > >
Cfcl::detail::FitImpl< S, OBBRSS< S > >
Cfcl::detail::FitImpl< S, RSS< S > >
Cfcl::detail::Fitter< S, BV >
Cfcl::detail::Fitter< S, kIOS< S > >
Cfcl::detail::Fitter< S, OBB< S > >
Cfcl::detail::Fitter< S, OBBRSS< S > >
Cfcl::detail::Fitter< S, RSS< S > >
Cfcl::detail::GetBVAxisImpl< S, BV >	For OBB and RSS, there is local coordinate of BV, so normal need to be transformed
Cfcl::detail::GetBVAxisImpl< S, OBBRSS< S > >
Cfcl::GetDistancesImpl< S, N >
Cfcl::GetDistancesImpl< S, 5 >
Cfcl::GetDistancesImpl< S, 6 >
Cfcl::GetDistancesImpl< S, 9 >
Cfcl::GetNodeTypeImpl< BV >
Cfcl::GetNodeTypeImpl< AABB< S > >
Cfcl::GetNodeTypeImpl< KDOP< S, 16 > >
Cfcl::GetNodeTypeImpl< KDOP< S, 18 > >
Cfcl::GetNodeTypeImpl< KDOP< S, 24 > >
Cfcl::GetNodeTypeImpl< kIOS< S > >
Cfcl::GetNodeTypeImpl< OBB< S > >
Cfcl::GetNodeTypeImpl< OBBRSS< S > >
Cfcl::GetNodeTypeImpl< RSS< S > >
Cfcl::GetOrientationImpl< S, BV >
Cfcl::GetOrientationImpl< S, OBB< S > >
Cfcl::GetOrientationImpl< S, OBBRSS< S > >
Cfcl::GetOrientationImpl< S, RSS< S > >
Cfcl::detail::GJK< S >	Class for GJK algorithm
Cfcl::detail::GJKInitializer< S, T >	Initialize GJK stuffs
Cfcl::detail::GJKInitializer< S, Box< S > >	Initialize GJK Box<S>
Cfcl::detail::GJKInitializer< S, Capsule< S > >	Initialize GJK Capsule<S>
Cfcl::detail::GJKInitializer< S, Cone< S > >	Initialize GJK Cone<S>
Cfcl::detail::GJKInitializer< S, Convex< S > >	Initialize GJK Convex<S>
Cfcl::detail::GJKInitializer< S, Cylinder< S > >	Initialize GJK Cylinder<S>
Cfcl::detail::GJKInitializer< S, Ellipsoid< S > >	Initialize GJK Ellipsoid<S>
Cfcl::detail::GJKInitializer< S, Sphere< S > >	Initialize GJK Sphere<S>
Cfcl::detail::GJKSolver_indep< S_ >	Collision and distance solver based on GJK algorithm implemented in fcl (rewritten the code from the GJK in bullet)
Cfcl::detail::GJKSolver_libccd< S_ >	Collision and distance solver based on libccd library
Cfcl::detail::HierarchyTree< BV >	Class for hierarchy tree structure
Cfcl::detail::implementation_array::HierarchyTree< BV >	Class for hierarchy tree structure
Cfcl::detail::HierarchyTree< fcl::AABB< S > >
Cfcl::detail::implementation_array::HierarchyTree< fcl::AABB< S > >
Cfcl::IMatrix3< S >
Cfcl::detail::Intersect< S >	CCD intersect kernel among primitives
Cfcl::Interval< S >	Interval class for [a, b]
Cfcl::detail::IntervalTree< S >	Interval tree
Cfcl::detail::IntervalTreeNode< S >	The node for interval tree
Cfcl::SaPCollisionManager< S >::isNotValidPair	Functor to help remove collision pairs no longer valid (i.e., should be culled away)
Cfcl::SaPCollisionManager< S >::isUnregistered	Functor to help unregister one object
Cfcl::detail::it_recursion_node< S >	Class describes the information needed when we take the right branch in searching for intervals but possibly come back and check the left branch as well
Cfcl::IVector3< S >
Cfcl::KDOP< S_, N >	KDOP class describes the KDOP collision structures. K is set as the template parameter, which should be 16, 18, or 24 The KDOP structure is defined by some pairs of parallel planes defined by some axes. For K = 16, the planes are 6 AABB planes and 10 diagonal planes that cut off some space of the edges: (-1,0,0) and (1,0,0) -> indices 0 and 8 (0,-1,0) and (0,1,0) -> indices 1 and 9 (0,0,-1) and (0,0,1) -> indices 2 and 10 (-1,-1,0) and (1,1,0) -> indices 3 and 11 (-1,0,-1) and (1,0,1) -> indices 4 and 12 (0,-1,-1) and (0,1,1) -> indices 5 and 13 (-1,1,0) and (1,-1,0) -> indices 6 and 14 (-1,0,1) and (1,0,-1) -> indices 7 and 15 For K = 18, the planes are 6 AABB planes and 12 diagonal planes that cut off some space of the edges: (-1,0,0) and (1,0,0) -> indices 0 and 9 (0,-1,0) and (0,1,0) -> indices 1 and 10 (0,0,-1) and (0,0,1) -> indices 2 and 11 (-1,-1,0) and (1,1,0) -> indices 3 and 12 (-1,0,-1) and (1,0,1) -> indices 4 and 13 (0,-1,-1) and (0,1,1) -> indices 5 and 14 (-1,1,0) and (1,-1,0) -> indices 6 and 15 (-1,0,1) and (1,0,-1) -> indices 7 and 16 (0,-1,1) and (0,1,-1) -> indices 8 and 17 For K = 18, the planes are 6 AABB planes and 18 diagonal planes that cut off some space of the edges: (-1,0,0) and (1,0,0) -> indices 0 and 12 (0,-1,0) and (0,1,0) -> indices 1 and 13 (0,0,-1) and (0,0,1) -> indices 2 and 14 (-1,-1,0) and (1,1,0) -> indices 3 and 15 (-1,0,-1) and (1,0,1) -> indices 4 and 16 (0,-1,-1) and (0,1,1) -> indices 5 and 17 (-1,1,0) and (1,-1,0) -> indices 6 and 18 (-1,0,1) and (1,0,-1) -> indices 7 and 19 (0,-1,1) and (0,1,-1) -> indices 8 and 20 (-1, -1, 1) and (1, 1, -1) –> indices 9 and 21 (-1, 1, -1) and (1, -1, 1) –> indices 10 and 22 (1, -1, -1) and (-1, 1, 1) –> indices 11 and 23
Cfcl::kIOS< S_ >	A class describing the kIOS collision structure, which is a set of spheres
Cfcl::kIOS< S >
Cfcl::kIOS< Shape::S >
Cfcl::MakeParentRelativeRecurseImpl< S, BV >
Cfcl::MakeParentRelativeRecurseImpl< S, OBB< S > >
Cfcl::MakeParentRelativeRecurseImpl< S, OBBRSS< S > >
Cfcl::MakeParentRelativeRecurseImpl< S, RSS< S > >
Cfcl::detail::MinkowskiDiff< S >	Minkowski difference class of two shapes
►Cfcl::MotionBase< S >
Cfcl::InterpMotion< S >	Linear interpolation motion Each Motion is assumed to have constant linear velocity and angular velocity The motion is R(t)(p - p_ref) + p_ref + T(t) Therefore, R(0) = R0, R(1) = R1 T(0) = T0 + R0 p_ref - p_ref T(1) = T1 + R1 p_ref - p_ref
Cfcl::ScrewMotion< S >
Cfcl::SplineMotion< S >
Cfcl::TranslationMotion< S >
Cfcl::detail::implementation_array::NodeBase< BV >
Cfcl::detail::NodeBase< BV >	Dynamic AABB<S> tree node
Cfcl::detail::implementation_array::nodeBaseLess< BV >	Functor comparing two nodes
Cfcl::OBB< S_ >	Oriented bounding box class
Cfcl::OBB< S >
Cfcl::OBB< Shape::S >
Cfcl::OBBRSS< S_ >	Class merging the OBB and RSS, can handle collision and distance simultaneously
Cfcl::OBBRSS< S >
Cfcl::OBBRSS< Shape::S >
Cfcl::detail::OcTreeSolver< NarrowPhaseSolver >	Algorithms for collision related with octree
Cfcl::detail::PolySolver< S >	A class solves polynomial degree (1,2,3) equations
Cfcl::detail::Profiler	This is a simple thread-safe tool for counting time spent in various chunks of code. This is different from external profiling tools in that it allows the user to count time spent in various bits of code (sub-function granularity) or count how many times certain pieces of code are executed
Cfcl::detail::Project< S >	Project functions
Cfcl::detail::Project< S >::ProjectResult
Cfcl::RNG< S >	Random number generation. An instance of this class cannot be used by multiple threads at once (member functions are not const). However, the constructor is thread safe and different instances can be used safely in any number of threads. It is also guaranteed that all created instances will have a different random seed
Cfcl::RSS< S_ >	A class for rectangle sphere-swept bounding volume
Cfcl::RSS< S >
Cfcl::RSS< Shape::S >
►Cruntime_error
Cfcl::Exception
►Cfcl::SamplerBase< S >
Cfcl::SamplerR< S, N >
Cfcl::SamplerSE2< S >
Cfcl::SamplerSE2_disk< S >
Cfcl::SamplerSE3Euler< S >
Cfcl::SamplerSE3Euler_ball< S >
Cfcl::SamplerSE3Quat< S >
Cfcl::SamplerSE3Quat_ball< S >
Cfcl::SaPCollisionManager< S >::SaPAABB	SAP interval for one object
Cfcl::SaPCollisionManager< S >::SaPPair	A pair of objects that are not culling away and should further check collision
Cfcl::detail::Profiler::ScopedBlock	This instance will call Profiler::begin() when constructed and Profiler::end() when it goes out of scope
Cfcl::detail::Profiler::ScopedStart	This instance will call Profiler::start() when constructed and Profiler::stop() when it goes out of scope. If the profiler was already started, this block's constructor and destructor take no action
Cfcl::detail::Seed
Cfcl::detail::SelectImpl< S, BV >
Cfcl::detail::implementation_array::SelectImpl< S, BV >
Cfcl::detail::SelectImpl< S, AABB< S > >
Cfcl::detail::implementation_array::SelectImpl< S, AABB< S > >
Cfcl::detail::SetImpl< S, BV >
Cfcl::detail::SetImpl< S, kIOS< S > >
Cfcl::detail::SetImpl< S, OBB< S > >
Cfcl::detail::SetImpl< S, OBBRSS< S > >
Cfcl::detail::SetImpl< S, RSS< S > >
Cfcl::detail::ShapeDistanceIndepImpl< S, Shape1, Shape2 >
Cfcl::detail::ShapeDistanceIndepImpl< S, Capsule< S >, Capsule< S > >
Cfcl::detail::ShapeDistanceIndepImpl< S, Capsule< S >, Sphere< S > >
Cfcl::detail::ShapeDistanceIndepImpl< S, Sphere< S >, Capsule< S > >
Cfcl::detail::ShapeDistanceIndepImpl< S, Sphere< S >, Sphere< S > >
Cfcl::detail::ShapeDistanceLibccdImpl< S, Shape1, Shape2 >
Cfcl::detail::ShapeDistanceLibccdImpl< S, Capsule< S >, Capsule< S > >
Cfcl::detail::ShapeDistanceLibccdImpl< S, Capsule< S >, Sphere< S > >
Cfcl::detail::ShapeDistanceLibccdImpl< S, Sphere< S >, Capsule< S > >
Cfcl::detail::ShapeDistanceLibccdImpl< S, Sphere< S >, Sphere< S > >
Cfcl::detail::ShapeIntersectIndepImpl< S, Shape1, Shape2 >
Cfcl::detail::ShapeIntersectIndepImpl< S, Halfspace< S >, Halfspace< S > >
Cfcl::detail::ShapeIntersectIndepImpl< S, Halfspace< S >, Plane< S > >
Cfcl::detail::ShapeIntersectIndepImpl< S, Plane< S >, Halfspace< S > >
Cfcl::detail::ShapeIntersectIndepImpl< S, Plane< S >, Plane< S > >
Cfcl::detail::ShapeIntersectLibccdImpl< S, Shape1, Shape2 >
Cfcl::detail::ShapeIntersectLibccdImpl< S, Halfspace< S >, Halfspace< S > >
Cfcl::detail::ShapeIntersectLibccdImpl< S, Halfspace< S >, Plane< S > >
Cfcl::detail::ShapeIntersectLibccdImpl< S, Plane< S >, Halfspace< S > >
Cfcl::detail::ShapeIntersectLibccdImpl< S, Plane< S >, Plane< S > >
Cfcl::detail::ShapeTransformedTriangleDistanceIndepImpl< S, Shape >
Cfcl::detail::ShapeTransformedTriangleDistanceIndepImpl< S, Sphere< S > >
Cfcl::detail::ShapeTransformedTriangleDistanceLibccdImpl< S, Shape >
Cfcl::detail::ShapeTransformedTriangleDistanceLibccdImpl< S, Sphere< S > >
Cfcl::detail::ShapeTransformedTriangleIntersectIndepImpl< S, Shape >
Cfcl::detail::ShapeTransformedTriangleIntersectIndepImpl< S, Halfspace< S > >
Cfcl::detail::ShapeTransformedTriangleIntersectIndepImpl< S, Plane< S > >
Cfcl::detail::ShapeTransformedTriangleIntersectIndepImpl< S, Sphere< S > >
Cfcl::detail::ShapeTransformedTriangleIntersectLibccdImpl< S, Shape >
Cfcl::detail::ShapeTransformedTriangleIntersectLibccdImpl< S, Halfspace< S > >
Cfcl::detail::ShapeTransformedTriangleIntersectLibccdImpl< S, Plane< S > >
Cfcl::detail::ShapeTransformedTriangleIntersectLibccdImpl< S, Sphere< S > >
Cfcl::detail::ShapeTriangleDistanceIndepImpl< S, Shape >
Cfcl::detail::ShapeTriangleDistanceIndepImpl< S, Sphere< S > >
Cfcl::detail::ShapeTriangleDistanceLibccdImpl< S, Shape >
Cfcl::detail::ShapeTriangleDistanceLibccdImpl< S, Sphere< S > >
Cfcl::detail::ShapeTriangleIntersectIndepImpl< S, Shape >
Cfcl::detail::ShapeTriangleIntersectIndepImpl< S, Sphere< S > >
Cfcl::detail::ShapeTriangleIntersectLibccdImpl< S, Shape >
Cfcl::detail::ShapeTriangleIntersectLibccdImpl< S, Sphere< S > >
Cfcl::detail::SimpleHashTable< Key, Data, HashFnc >	A simple hash table implemented as multiple buckets. HashFnc is any extended hash function: HashFnc(key) = {index1, index2, ..., }
►Cfcl::detail::SimpleInterval< S >	Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_ by Cormen, Leisserson, and Rivest
Cfcl::IntervalTreeCollisionManager< S >::SAPInterval	Extention interval tree's interval to SAP interval, adding more information
Cfcl::detail::GJK< S >::Simplex
Cfcl::detail::GJK< S >::SimplexV
Cfcl::SortByXLow< S >	Functor sorting objects according to the AABB<S> lower x bound
Cfcl::SortByYLow< S >	Functor sorting objects according to the AABB<S> lower y bound
Cfcl::SortByZLow< S >	Functor sorting objects according to the AABB<S> lower z bound
Cfcl::detail::SortDoubleByValue
Cfcl::detail::SortIntByValue
Cfcl::detail::SparseHashTable< Key, Data, HashFnc, TableT >	A hash table implemented using unordered_map
Cfcl::detail::SpatialHash< S_ >	Spatial hash function: hash an AABB to a set of integer values
Cfcl::TaylorModel< S >	TaylorModel implements a third order Taylor model, i.e., a cubic approximation of a function over a time interval, with an interval remainder. All the operations on two Taylor models assume their time intervals are the same
Cfcl::TBVMotionBoundVisitorVisitImpl< S, BV, MotionT >
Cfcl::TBVMotionBoundVisitorVisitImpl< S, RSS< S >, InterpMotion< S > >	Compute the motion bound for a bounding volume along a given direction n according to mu < |v * n| + ||w x n||(r + max(||ci*||)) where ||ci*|| = ||R0(ci) x w||. w is the angular axis (normalized) and ci are the endpoints of the generator primitives of RSS. Notice that all bv parameters are in the local frame of the object, but n should be in the global frame (the reason is that the motion (t1, t2 and t) is in global frame)
Cfcl::TBVMotionBoundVisitorVisitImpl< S, RSS< S >, ScrewMotion< S > >	Compute the motion bound for a bounding volume along a given direction n according to mu < |v * n| + ||w x n||(r + max(||ci*||)) where ||ci*|| = ||R0(ci) x w||. w is the angular axis (normalized) and ci are the endpoints of the generator primitives of RSS. Notice that all bv parameters are in the local frame of the object, but n should be in the global frame (the reason is that the motion (t1, t2 and t) is in global frame)
Cfcl::TBVMotionBoundVisitorVisitImpl< S, RSS< S >, SplineMotion< S > >
Cfcl::TBVMotionBoundVisitorVisitImpl< S, RSS< S >, TranslationMotion< S > >	Compute the motion bound for a bounding volume along a given direction n
Cfcl::TimeInterval< S >
Cfcl::TMatrix3< S >
►Cfcl::detail::TraversalNodeBase< S >	Node structure encoding the information required for traversal
Cfcl::detail::CollisionTraversalNodeBase< S >	Node structure encoding the information required for collision traversal
Cfcl::detail::DistanceTraversalNodeBase< S >	Node structure encoding the information required for distance traversal
►Cfcl::detail::TraversalNodeBase< BV::S >
►Cfcl::detail::CollisionTraversalNodeBase< BV::S >
►Cfcl::detail::BVHCollisionTraversalNode< BV >	Traversal node for collision between BVH models
Cfcl::detail::MeshCollisionTraversalNode< BV >	Traversal node for collision between two meshes
Cfcl::detail::MeshContinuousCollisionTraversalNode< BV >	Traversal node for continuous collision between meshes
►Cfcl::detail::BVHShapeCollisionTraversalNode< BV, Shape >	Traversal node for collision between BVH and shape
Cfcl::detail::MeshShapeCollisionTraversalNode< BV, Shape, NarrowPhaseSolver >	Traversal node for collision between mesh and shape
Cfcl::detail::MeshOcTreeCollisionTraversalNode< BV, NarrowPhaseSolver >	Traversal node for mesh-octree collision
Cfcl::detail::OcTreeMeshCollisionTraversalNode< BV, NarrowPhaseSolver >	Traversal node for octree-mesh collision
►Cfcl::detail::ShapeBVHCollisionTraversalNode< Shape, BV >	Traversal node for collision between shape and BVH
Cfcl::detail::ShapeMeshCollisionTraversalNode< Shape, BV, NarrowPhaseSolver >	Traversal node for collision between shape and mesh
►Cfcl::detail::DistanceTraversalNodeBase< BV::S >
►Cfcl::detail::BVHDistanceTraversalNode< BV >	Traversal node for distance computation between BVH models
►Cfcl::detail::MeshDistanceTraversalNode< BV >	Traversal node for distance computation between two meshes
Cfcl::detail::MeshConservativeAdvancementTraversalNode< BV >	Continuous collision node using conservative advancement. when using this default version, must refit the BVH in current configuration (R_t, T_t) into default configuration
►Cfcl::detail::BVHShapeDistanceTraversalNode< BV, Shape >	Traversal node for distance computation between BVH and shape
►Cfcl::detail::MeshShapeDistanceTraversalNode< BV, Shape, NarrowPhaseSolver >	Traversal node for distance between mesh and shape
Cfcl::detail::MeshShapeConservativeAdvancementTraversalNode< BV, Shape, NarrowPhaseSolver >	Traversal node for conservative advancement computation between BVH and shape
Cfcl::detail::MeshOcTreeDistanceTraversalNode< BV, NarrowPhaseSolver >	Traversal node for mesh-octree distance
Cfcl::detail::OcTreeMeshDistanceTraversalNode< BV, NarrowPhaseSolver >	Traversal node for octree-mesh distance
►Cfcl::detail::ShapeBVHDistanceTraversalNode< Shape, BV >	Traversal node for distance computation between shape and BVH
►Cfcl::detail::ShapeMeshDistanceTraversalNode< Shape, BV, NarrowPhaseSolver >	Traversal node for distance between shape and mesh
Cfcl::detail::ShapeMeshConservativeAdvancementTraversalNode< Shape, BV, NarrowPhaseSolver >
►Cfcl::detail::TraversalNodeBase< kIOS< S >::S >
►Cfcl::detail::CollisionTraversalNodeBase< kIOS< S >::S >
►Cfcl::detail::BVHCollisionTraversalNode< kIOS< S > >
►Cfcl::detail::MeshCollisionTraversalNode< kIOS< S > >
Cfcl::detail::MeshCollisionTraversalNodekIOS< S >
►Cfcl::detail::DistanceTraversalNodeBase< kIOS< S >::S >
►Cfcl::detail::BVHDistanceTraversalNode< kIOS< S > >
►Cfcl::detail::MeshDistanceTraversalNode< kIOS< S > >
Cfcl::detail::MeshDistanceTraversalNodekIOS< S >
►Cfcl::detail::TraversalNodeBase< kIOS< Shape::S >::S >
►Cfcl::detail::CollisionTraversalNodeBase< kIOS< Shape::S >::S >
►Cfcl::detail::BVHShapeCollisionTraversalNode< kIOS< Shape::S >, Shape >
►Cfcl::detail::MeshShapeCollisionTraversalNode< kIOS< Shape::S >, Shape, NarrowPhaseSolver >
Cfcl::detail::MeshShapeCollisionTraversalNodekIOS< Shape, NarrowPhaseSolver >
►Cfcl::detail::ShapeBVHCollisionTraversalNode< Shape, kIOS< Shape::S > >
►Cfcl::detail::ShapeMeshCollisionTraversalNode< Shape, kIOS< Shape::S >, NarrowPhaseSolver >
Cfcl::detail::ShapeMeshCollisionTraversalNodekIOS< Shape, NarrowPhaseSolver >
►Cfcl::detail::DistanceTraversalNodeBase< kIOS< Shape::S >::S >
►Cfcl::detail::BVHShapeDistanceTraversalNode< kIOS< Shape::S >, Shape >
►Cfcl::detail::MeshShapeDistanceTraversalNode< kIOS< Shape::S >, Shape, NarrowPhaseSolver >
Cfcl::detail::MeshShapeDistanceTraversalNodekIOS< Shape, NarrowPhaseSolver >
►Cfcl::detail::ShapeBVHDistanceTraversalNode< Shape, kIOS< Shape::S > >
►Cfcl::detail::ShapeMeshDistanceTraversalNode< Shape, kIOS< Shape::S >, NarrowPhaseSolver >
Cfcl::detail::ShapeMeshDistanceTraversalNodekIOS< Shape, NarrowPhaseSolver >
►Cfcl::detail::TraversalNodeBase< NarrowPhaseSolver::S >
►Cfcl::detail::CollisionTraversalNodeBase< NarrowPhaseSolver::S >
Cfcl::detail::OcTreeCollisionTraversalNode< NarrowPhaseSolver >	Traversal node for octree collision
►Cfcl::detail::DistanceTraversalNodeBase< NarrowPhaseSolver::S >
Cfcl::detail::OcTreeDistanceTraversalNode< NarrowPhaseSolver >	Traversal node for octree distance
►Cfcl::detail::TraversalNodeBase< OBB< S >::S >
►Cfcl::detail::CollisionTraversalNodeBase< OBB< S >::S >
►Cfcl::detail::BVHCollisionTraversalNode< OBB< S > >
►Cfcl::detail::MeshCollisionTraversalNode< OBB< S > >
Cfcl::detail::MeshCollisionTraversalNodeOBB< S >	Traversal node for collision between two meshes if their underlying BVH node is oriented node (OBB, RSS, OBBRSS, kIOS)
►Cfcl::detail::TraversalNodeBase< OBB< Shape::S >::S >
►Cfcl::detail::CollisionTraversalNodeBase< OBB< Shape::S >::S >
►Cfcl::detail::BVHShapeCollisionTraversalNode< OBB< Shape::S >, Shape >
►Cfcl::detail::MeshShapeCollisionTraversalNode< OBB< Shape::S >, Shape, NarrowPhaseSolver >
Cfcl::detail::MeshShapeCollisionTraversalNodeOBB< Shape, NarrowPhaseSolver >	Traversal node for mesh and shape, when mesh BVH is one of the oriented node (OBB, RSS, OBBRSS, kIOS)
►Cfcl::detail::ShapeBVHCollisionTraversalNode< Shape, OBB< Shape::S > >
►Cfcl::detail::ShapeMeshCollisionTraversalNode< Shape, OBB< Shape::S >, NarrowPhaseSolver >
Cfcl::detail::ShapeMeshCollisionTraversalNodeOBB< Shape, NarrowPhaseSolver >	Traversal node for shape and mesh, when mesh BVH is one of the oriented node (OBB, RSS, OBBRSS, kIOS)
►Cfcl::detail::TraversalNodeBase< OBBRSS< S >::S >
►Cfcl::detail::CollisionTraversalNodeBase< OBBRSS< S >::S >
►Cfcl::detail::BVHCollisionTraversalNode< OBBRSS< S > >
►Cfcl::detail::MeshCollisionTraversalNode< OBBRSS< S > >
Cfcl::detail::MeshCollisionTraversalNodeOBBRSS< S >
►Cfcl::detail::DistanceTraversalNodeBase< OBBRSS< S >::S >
►Cfcl::detail::BVHDistanceTraversalNode< OBBRSS< S > >
►Cfcl::detail::MeshDistanceTraversalNode< OBBRSS< S > >
Cfcl::detail::MeshDistanceTraversalNodeOBBRSS< S >
►Cfcl::detail::MeshConservativeAdvancementTraversalNode< OBBRSS< S > >
Cfcl::detail::MeshConservativeAdvancementTraversalNodeOBBRSS< S >
►Cfcl::detail::TraversalNodeBase< OBBRSS< Shape::S >::S >
►Cfcl::detail::CollisionTraversalNodeBase< OBBRSS< Shape::S >::S >
►Cfcl::detail::BVHShapeCollisionTraversalNode< OBBRSS< Shape::S >, Shape >
►Cfcl::detail::MeshShapeCollisionTraversalNode< OBBRSS< Shape::S >, Shape, NarrowPhaseSolver >
Cfcl::detail::MeshShapeCollisionTraversalNodeOBBRSS< Shape, NarrowPhaseSolver >
►Cfcl::detail::ShapeBVHCollisionTraversalNode< Shape, OBBRSS< Shape::S > >
►Cfcl::detail::ShapeMeshCollisionTraversalNode< Shape, OBBRSS< Shape::S >, NarrowPhaseSolver >
Cfcl::detail::ShapeMeshCollisionTraversalNodeOBBRSS< Shape, NarrowPhaseSolver >
►Cfcl::detail::DistanceTraversalNodeBase< OBBRSS< Shape::S >::S >
►Cfcl::detail::BVHShapeDistanceTraversalNode< OBBRSS< Shape::S >, Shape >
►Cfcl::detail::MeshShapeDistanceTraversalNode< OBBRSS< Shape::S >, Shape, NarrowPhaseSolver >
Cfcl::detail::MeshShapeDistanceTraversalNodeOBBRSS< Shape, NarrowPhaseSolver >
►Cfcl::detail::MeshShapeConservativeAdvancementTraversalNode< OBBRSS< Shape::S >, Shape, NarrowPhaseSolver >
Cfcl::detail::MeshShapeConservativeAdvancementTraversalNodeOBBRSS< Shape, NarrowPhaseSolver >
►Cfcl::detail::ShapeBVHDistanceTraversalNode< Shape, OBBRSS< Shape::S > >
►Cfcl::detail::ShapeMeshDistanceTraversalNode< Shape, OBBRSS< Shape::S >, NarrowPhaseSolver >
Cfcl::detail::ShapeMeshDistanceTraversalNodeOBBRSS< Shape, NarrowPhaseSolver >
►Cfcl::detail::ShapeMeshConservativeAdvancementTraversalNode< Shape, OBBRSS< Shape::S >, NarrowPhaseSolver >
Cfcl::detail::ShapeMeshConservativeAdvancementTraversalNodeOBBRSS< Shape, NarrowPhaseSolver >
►Cfcl::detail::TraversalNodeBase< RSS< S >::S >
►Cfcl::detail::CollisionTraversalNodeBase< RSS< S >::S >
►Cfcl::detail::BVHCollisionTraversalNode< RSS< S > >
►Cfcl::detail::MeshCollisionTraversalNode< RSS< S > >
Cfcl::detail::MeshCollisionTraversalNodeRSS< S >
►Cfcl::detail::DistanceTraversalNodeBase< RSS< S >::S >
►Cfcl::detail::BVHDistanceTraversalNode< RSS< S > >
►Cfcl::detail::MeshDistanceTraversalNode< RSS< S > >
Cfcl::detail::MeshDistanceTraversalNodeRSS< S >	Traversal node for distance computation between two meshes if their underlying BVH node is oriented node (RSS, OBBRSS, kIOS)
►Cfcl::detail::MeshConservativeAdvancementTraversalNode< RSS< S > >
Cfcl::detail::MeshConservativeAdvancementTraversalNodeRSS< S >
►Cfcl::detail::TraversalNodeBase< RSS< Shape::S >::S >
►Cfcl::detail::CollisionTraversalNodeBase< RSS< Shape::S >::S >
►Cfcl::detail::BVHShapeCollisionTraversalNode< RSS< Shape::S >, Shape >
►Cfcl::detail::MeshShapeCollisionTraversalNode< RSS< Shape::S >, Shape, NarrowPhaseSolver >
Cfcl::detail::MeshShapeCollisionTraversalNodeRSS< Shape, NarrowPhaseSolver >
►Cfcl::detail::ShapeBVHCollisionTraversalNode< Shape, RSS< Shape::S > >
►Cfcl::detail::ShapeMeshCollisionTraversalNode< Shape, RSS< Shape::S >, NarrowPhaseSolver >
Cfcl::detail::ShapeMeshCollisionTraversalNodeRSS< Shape, NarrowPhaseSolver >
►Cfcl::detail::DistanceTraversalNodeBase< RSS< Shape::S >::S >
►Cfcl::detail::BVHShapeDistanceTraversalNode< RSS< Shape::S >, Shape >
►Cfcl::detail::MeshShapeDistanceTraversalNode< RSS< Shape::S >, Shape, NarrowPhaseSolver >
Cfcl::detail::MeshShapeDistanceTraversalNodeRSS< Shape, NarrowPhaseSolver >	Traversal node for distance between mesh and shape, when mesh BVH is one of the oriented node (RSS, OBBRSS, kIOS)
►Cfcl::detail::MeshShapeConservativeAdvancementTraversalNode< RSS< Shape::S >, Shape, NarrowPhaseSolver >
Cfcl::detail::MeshShapeConservativeAdvancementTraversalNodeRSS< Shape, NarrowPhaseSolver >
►Cfcl::detail::ShapeBVHDistanceTraversalNode< Shape, RSS< Shape::S > >
►Cfcl::detail::ShapeMeshDistanceTraversalNode< Shape, RSS< Shape::S >, NarrowPhaseSolver >
Cfcl::detail::ShapeMeshDistanceTraversalNodeRSS< Shape, NarrowPhaseSolver >
►Cfcl::detail::ShapeMeshConservativeAdvancementTraversalNode< Shape, RSS< Shape::S >, NarrowPhaseSolver >
Cfcl::detail::ShapeMeshConservativeAdvancementTraversalNodeRSS< Shape, NarrowPhaseSolver >
►Cfcl::detail::TraversalNodeBase< Shape1::S >
►Cfcl::detail::CollisionTraversalNodeBase< Shape1::S >
Cfcl::detail::ShapeCollisionTraversalNode< Shape1, Shape2, NarrowPhaseSolver >	Traversal node for collision between two shapes
►Cfcl::detail::DistanceTraversalNodeBase< Shape1::S >
►Cfcl::detail::ShapeDistanceTraversalNode< Shape1, Shape2, NarrowPhaseSolver >	Traversal node for distance between two shapes
Cfcl::detail::ShapeConservativeAdvancementTraversalNode< Shape1, Shape2, NarrowPhaseSolver >
►Cfcl::detail::TraversalNodeBase< Shape::S >
►Cfcl::detail::CollisionTraversalNodeBase< Shape::S >
Cfcl::detail::OcTreeShapeCollisionTraversalNode< Shape, NarrowPhaseSolver >	Traversal node for octree-shape collision
Cfcl::detail::ShapeOcTreeCollisionTraversalNode< Shape, NarrowPhaseSolver >	Traversal node for shape-octree collision
►Cfcl::detail::DistanceTraversalNodeBase< Shape::S >
Cfcl::detail::OcTreeShapeDistanceTraversalNode< Shape, NarrowPhaseSolver >	Traversal node for octree-shape distance
Cfcl::detail::ShapeOcTreeDistanceTraversalNode< Shape, NarrowPhaseSolver >	Traversal node for shape-octree distance
Cfcl::Triangle	Triangle with 3 indices for points
Cfcl::detail::TriangleDistance< S >	Triangle distance functions
Cfcl::TriangleMotionBoundVisitor< S >
Cfcl::TriangleMotionBoundVisitorVisitImpl< S, MotionT >
Cfcl::TriangleMotionBoundVisitorVisitImpl< S, InterpMotion< S > >	Compute the motion bound for a triangle along a given direction n according to mu < |v * n| + ||w x n||(max||ci*||) where ||ci*|| = ||R0(ci) x w|| / |w|. w is the angular velocity and ci are the triangle vertex coordinates. Notice that the triangle is in the local frame of the object, but n should be in the global frame (the reason is that the motion (t1, t2 and t) is in global frame)
Cfcl::TriangleMotionBoundVisitorVisitImpl< S, ScrewMotion< S > >	Compute the motion bound for a triangle along a given direction n according to mu < |v * n| + ||w x n||(max||ci*||) where ||ci*|| = ||R0(ci) x w|| / |w|. w is the angular velocity and ci are the triangle vertex coordinates. Notice that the triangle is in the local frame of the object, but n should be in the global frame (the reason is that the motion (t1, t2 and t) is in global frame)
Cfcl::TriangleMotionBoundVisitorVisitImpl< S, SplineMotion< S > >
Cfcl::TriangleMotionBoundVisitorVisitImpl< S, TranslationMotion< S > >	Compute the motion bound for a triangle along a given direction n
Cfcl::TVector3< S >
►Cunordered_map
Cfcl::detail::unordered_map_hash_table< U, V >
Cfcl::detail::UpdateImpl< S, BV >
Cfcl::Variance3< S >	Class for variance matrix in 3d