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 123456]
 C_ccd_simplex_t
 C_ccd_support_t
 Cfcl::AABBA class describing the AABB collision structure, which is a box in 3D space determined by two diagonal points
 ►Cfcl::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
 Cfcl::BroadPhaseContinuousCollisionManagerBase 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::BVFitterBase< BV >Interface for fitting a bv given the triangles or points inside it
 ►Cfcl::BVFitterBase< kIOS >
 ►Cfcl::BVFitterBase< OBB >
 ►Cfcl::BVFitterBase< OBBRSS >
 ►Cfcl::BVFitterBase< RSS >
 Cfcl::BVHContinuousCollisionPairTraversal node for continuous collision between BVH models
 Cfcl::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
 ►Cfcl::BVMotionBoundVisitorCompute the motion bound for a bounding volume, given the closest direction n between two query objects
 ►Cfcl::BVNodeBaseBVNodeBase encodes the tree structure for BVH
 ►Cfcl::BVSplitterBase< BV >Base interface for BV splitting algorithm
 Cfcl::CollisionFunctionMatrix< NarrowPhaseSolver >Collision matrix stores the functions for collision between different types of objects and provides a uniform call interface
 ►Cfcl::CollisionGeometryThe geometry for the object for collision or distance computation
 Cfcl::CollisionObjectObject for collision or distance computation, contains the geometry and the transform information
 Cfcl::CollisionRequestRequest to the collision algorithm
 Cfcl::CollisionResultCollision result
 Cfcl::ConservativeAdvancementFunctionMatrix< NarrowPhaseSolver >
 Cfcl::ConservativeAdvancementStackData
 Cfcl::ContactContact information returned by collision
 Cfcl::ContinuousCollisionObjectObject for continuous collision or distance computation, contains the geometry and the motion information
 Cfcl::ContinuousCollisionRequest
 Cfcl::ContinuousCollisionResultContinuous collision result
 Cfcl::CostSourceCost source describes an area with a cost. The area is described by an AABB region
 Cfcl::DistanceFunctionMatrix< NarrowPhaseSolver >Distance matrix stores the functions for distance between different types of objects and provides a uniform call interface
 Cfcl::DistanceRequestRequest to the distance computation
 Cfcl::DistanceResultDistance result
 Cfcl::Convex::Edge
 Cfcl::IntervalTreeCollisionManager::EndPointSAP end point
 Cfcl::SaPCollisionManager::EndPointEnd point for an interval
 Cfcl::details::EPAClass for EPA algorithm
 ►Cstd::exceptionSTL class
 Cfcl::details::GJKClass for GJK algorithm
 Cfcl::details::GJKInitializer< T >Initialize GJK stuffs
 Cfcl::details::GJKInitializer< Box >Initialize GJK Box
 Cfcl::details::GJKInitializer< Capsule >Initialize GJK Capsule
 Cfcl::details::GJKInitializer< Cone >Initialize GJK Cone
 Cfcl::details::GJKInitializer< Convex >Initialize GJK Convex
 Cfcl::details::GJKInitializer< Cylinder >Initialize GJK Cylinder
 Cfcl::details::GJKInitializer< Sphere >Initialize GJK Sphere
 Cfcl::GJKSolver_indepCollision and distance solver based on GJK algorithm implemented in fcl (rewritten the code from the GJK in bullet)
 Cfcl::GJKSolver_libccdCollision and distance solver based on libccd library
 Cfcl::GreedyKCenters< _T >An instance of this class can be used to greedily select a given number of representatives from a set of data points that are all far apart from each other
 Cfcl::HierarchyTree< BV >Class for hierarchy tree structure
 Cfcl::implementation_array::HierarchyTree< BV >Class for hierarchy tree structure
 Cfcl::HierarchyTree< fcl::AABB >
 Cfcl::implementation_array::HierarchyTree< fcl::AABB >
 Cfcl::IMatrix3
 ►Cfcl::Interpolation
 Cfcl::InterpolationFactory
 Cfcl::IntersectCCD intersect kernel among primitives
 Cfcl::IntervalInterval class for [a, b]
 Cfcl::IntervalTreeInterval tree
 Cfcl::IntervalTreeNodeThe node for interval tree
 Cfcl::SaPCollisionManager::isNotValidPairFunctor to help remove collision pairs no longer valid (i.e., should be culled away)
 Cfcl::SaPCollisionManager::isUnregisteredFunctor to help unregister one object
 Cfcl::Item< N >
 Cfcl::IVector3
 ►Cfcl::JointBase Joint
 Cfcl::JointConfig
 Cfcl::KDOP< N >KDOP class describes the KDOP collision structures
 Cfcl::kIOSA class describing the kIOS collision structure, which is a set of spheres
 Cfcl::Link
 Cfcl::details::Matrix3Data< T >
 Cfcl::details::Matrix3Data< FCL_REAL >
 Cfcl::Matrix3fX< T >Matrix2 class wrapper. the core data is in the template parameter class
 Cfcl::Matrix3fX< details::Matrix3Data< FCL_REAL > >
 Cfcl::details::MinkowskiDiffMinkowski difference class of two shapes
 Cfcl::Model
 Cfcl::ModelConfig
 Cfcl::morton_functor< T >Functor to compute the morton code for a given AABB
 Cfcl::morton_functor< boost::dynamic_bitset<> >Functor to compute n bit morton code for a given AABB
 Cfcl::morton_functor< FCL_UINT32 >Functor to compute 30 bit morton code for a given AABB
 Cfcl::morton_functor< FCL_UINT64 >Functor to compute 60 bit morton code for a given AABB
 ►Cfcl::MotionBase
 ►Cfcl::NearestNeighbors< _T >Abstract representation of a container that can perform nearest neighbors queries
 Cfcl::NearestNeighbors< fcl::Transform3f >
 Cfcl::NearestNeighborsGNAT< _T >::NodeThe class used internally to define the GNAT
 Cfcl::NodeBase< BV >Dynamic AABB tree node
 Cfcl::implementation_array::NodeBase< BV >
 Cfcl::implementation_array::nodeBaseLess< BV >Functor comparing two nodes
 ►Cnoncopyable
 Cfcl::OBBOriented bounding box class
 Cfcl::OBBRSSClass merging the OBB and RSS, can handle collision and distance simultaneously
 Cfcl::OcTreeSolver< NarrowPhaseSolver >Algorithms for collision related with octree
 Cfcl::PenetrationDepthRequest
 Cfcl::PenetrationDepthResult
 Cfcl::PolySolverA class solves polynomial degree (1,2,3) equations
 Cfcl::PredictResult
 Cfcl::ProjectProject functions
 Cfcl::Project::ProjectResult
 Cfcl::Quaternion3fQuaternion used locally by InterpMotion
 Cfcl::RNGRandom number generation
 Cfcl::RSSA class for rectangle sphere-swept bounding volume
 ►Cfcl::SamplerBase
 Cfcl::SaPCollisionManager::SaPAABBSAP interval for one object
 Cfcl::SaPCollisionManager::SaPPairA pair of objects that are not culling away and should further check collision
 Cfcl::Scaler< N >
 Cfcl::tools::Profiler::ScopedBlockThis instance will call Profiler::begin() when constructed and Profiler::end() when it goes out of scope
 Cfcl::tools::Profiler::ScopedStartThis instance will call Profiler::start() when constructed and Profiler::stop() when it goes out of scope
 Cfcl::SimpleHashTable< Key, Data, HashFnc >A simple hash table implemented as multiple buckets. HashFnc is any extended hash function: HashFnc(key) = {index1, index2, ..., }
 ►Cfcl::SimpleIntervalInterval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_ by Cormen, Leisserson, and Rivest
 Cfcl::details::GJK::Simplex
 Cfcl::details::GJK::SimplexV
 Cfcl::SparseHashTable< Key, Data, HashFnc, TableT >A hash table implemented using unordered_map
 Cfcl::SpatialHashSpatial hash function: hash an AABB to a set of integer values
 Cfcl::details::sse_meta_d4
 Cfcl::details::sse_meta_f12
 Cfcl::details::sse_meta_f16
 Cfcl::details::sse_meta_f4
 Cfcl::SVMClassifier< N >
 Cfcl::TaylorModelTaylorModel implements a third order Taylor model, i.e., a cubic approximation of a function over a time interval, with an interval remainder
 Cfcl::TimeInterval
 Cfcl::TMatrix3
 Cfcl::Transform3fSimple transform class used locally by InterpMotion
 ►Cfcl::TraversalNodeBaseNode structure encoding the information required for traversal
 Cfcl::TriangleTriangle with 3 indices for points
 Cfcl::TriangleDistanceTriangle distance functions
 Cfcl::TriangleMotionBoundVisitor
 Cfcl::TVector3
 ►Cunordered_map
 Cfcl::Variance3fClass for variance matrix in 3d
 Cfcl::details::Vec3Data< T >
 Cfcl::details::Vec3Data< FCL_REAL >
 Cfcl::Vec3fX< T >Vector3 class wrapper. The core data is in the template parameter class
 Cfcl::Vec3fX< details::Vec3Data< FCL_REAL > >
 Cfcl::Vec_n< T, N >
 ►Cfcl::Vec_n< FCL_REAL, N >