All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 12345]
oCfcl::AABBA class describing the AABB collision structure, which is a box in 3D space determined by two diagonal points
oCfcl::BroadPhaseCollisionManagerBase 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
oCfcl::BVFitterBase< BV >Interface for fitting a bv given the triangles or points inside it
oCfcl::BVFitterBase< kIOS >
oCfcl::BVFitterBase< OBB >
oCfcl::BVFitterBase< OBBRSS >
oCfcl::BVFitterBase< RSS >
oCfcl::BVHFrontNodeFront 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
oCfcl::BVNodeBaseBVNodeBase encodes the tree structure for BVH
oCfcl::BVSplitterBase< BV >Base interface for BV splitting algorithm
oCfcl::CollisionFunctionMatrix< NarrowPhaseSolver >Collision matrix stores the functions for collision between different types of objects and provides a uniform call interface
oCfcl::CollisionGeometryThe geometry for the object for collision or distance computation
oCfcl::CollisionObjectObject for collision or distance computation, contains the geometry and the transform information
oCfcl::CollisionRequestRequest to the collision algorithm
oCfcl::CollisionResultCollision result
oCfcl::ContactContact information returned by collision
oCfcl::CostSourceCost source describes an area with a cost. The area is described by an AABB region
oCfcl::DistanceFunctionMatrix< NarrowPhaseSolver >Distance matrix stores the functions for distance between different types of objects and provides a uniform call interface
oCfcl::DistanceRequestRequest to the distance computation
oCfcl::DistanceResultDistance result
oCfcl::Convex::Edge
oCfcl::IntervalTreeCollisionManager::EndPointSAP end point
oCfcl::SaPCollisionManager::EndPointEnd point for an interval
oCfcl::details::EPAClass for EPA algorithm
oCstd::exceptionSTL class
oCfcl::details::GJKClass for GJK algorithm
oCfcl::GJKSolver_indepCollision and distance solver based on GJK algorithm implemented in fcl (rewritten the code from the GJK in bullet)
oCfcl::HierarchyTree< BV >Class for hierarchy tree structure
oCfcl::implementation_array::HierarchyTree< BV >Class for hierarchy tree structure
oCfcl::HierarchyTree< fcl::AABB >
oCfcl::implementation_array::HierarchyTree< fcl::AABB >
oCfcl::IntersectCCD intersect kernel among primitives
oCfcl::IntervalTreeInterval tree
oCfcl::IntervalTreeNodeThe node for interval tree
oCfcl::SaPCollisionManager::isNotValidPairFunctor to help remove collision pairs no longer valid (i.e., should be culled away)
oCfcl::SaPCollisionManager::isUnregisteredFunctor to help unregister one object
oCfcl::KDOP< N >KDOP class describes the KDOP collision structures
oCfcl::kIOSA class describing the kIOS collision structure, which is a set of spheres
oCfcl::details::MinkowskiDiffMinkowski difference class of two shapes
oCfcl::morton_functor< T >Functor to compute the morton code for a given AABB
oCfcl::morton_functor< boost::dynamic_bitset<> >Functor to compute n bit morton code for a given AABB
oCfcl::morton_functor< FCL_UINT32 >Functor to compute 30 bit morton code for a given AABB
oCfcl::morton_functor< FCL_UINT64 >Functor to compute 60 bit morton code for a given AABB
oCfcl::implementation_array::NodeBase< BV >
oCfcl::NodeBase< BV >Dynamic AABB tree node
oCfcl::implementation_array::nodeBaseLess< BV >Functor comparing two nodes
oCnoncopyable
oCfcl::OBBOriented bounding box class
oCfcl::OBBRSSClass merging the OBB and RSS, can handle collision and distance simultaneously
oCfcl::OcTreeSolver< NarrowPhaseSolver >Algorithms for collision related with octree
oCfcl::PolySolverA class solves polynomial degree (1,2,3) equations
oCfcl::ProjectProject functions
oCfcl::Project::ProjectResult
oCfcl::RSSA class for rectangle sphere-swept bounding volume
oCfcl::SaPCollisionManager::SaPAABBSAP interval for one object
oCfcl::SaPCollisionManager::SaPPairA pair of objects that are not culling away and should further check collision
oCfcl::tools::Profiler::ScopedBlockThis instance will call Profiler::begin() when constructed and Profiler::end() when it goes out of scope
oCfcl::tools::Profiler::ScopedStartThis instance will call Profiler::start() when constructed and Profiler::stop() when it goes out of scope
oCfcl::SimpleHashTable< Key, Data, HashFnc >A simple hash table implemented as multiple buckets. HashFnc is any extended hash function: HashFnc(key) = {index1, index2, ..., }
oCfcl::SimpleIntervalInterval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_ by Cormen, Leisserson, and Rivest
oCfcl::details::GJK::Simplex
oCfcl::details::GJK::SimplexV
oCfcl::SparseHashTable< Key, Data, HashFnc, TableT >A hash table implemented using unordered_map
oCfcl::SpatialHashSpatial hash function: hash an AABB to a set of integer values
oCfcl::Transform3fSimple transform class used locally by InterpMotion
oCfcl::TraversalNodeBaseNode structure encoding the information required for traversal
oCfcl::TriangleTriangle with 3 indices for points
oCfcl::TriangleAndVertices
oCfcl::TriangleDistanceTriangle distance functions
oCunordered_map
\Cfcl::Variance3fClass for variance matrix in 3d