 fcl::AABB | A class describing the AABB collision structure, which is a box in 3D space determined by two diagonal points |
 fcl::BroadPhaseCollisionManager | 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 |
  fcl::DynamicAABBTreeCollisionManager | |
  fcl::DynamicAABBTreeCollisionManager_Array | |
  fcl::IntervalTreeCollisionManager | Collision manager based on interval tree |
  fcl::NaiveCollisionManager | Brute force N-body collision manager |
  fcl::SaPCollisionManager | Rigorous SAP collision manager |
  fcl::SpatialHashingCollisionManager< HashTable > | Spatial hashing collision mananger |
  fcl::SSaPCollisionManager | Simple SAP collision manager |
 fcl::BVFitterBase< BV > | Interface for fitting a bv given the triangles or points inside it |
  fcl::BVFitter< BV > | The class for the default algorithm fitting a bounding volume to a set of points |
 fcl::BVFitterBase< kIOS > | |
  fcl::BVFitter< kIOS > | Specification of BVFitter for kIOS bounding volume |
 fcl::BVFitterBase< OBB > | |
  fcl::BVFitter< OBB > | Specification of BVFitter for OBB bounding volume |
 fcl::BVFitterBase< OBBRSS > | |
  fcl::BVFitter< OBBRSS > | Specification of BVFitter for OBBRSS bounding volume |
 fcl::BVFitterBase< RSS > | |
  fcl::BVFitter< RSS > | Specification of BVFitter for RSS bounding volume |
 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 |
 fcl::BVNodeBase | BVNodeBase encodes the tree structure for BVH |
  fcl::BVNode< kIOS > | |
  fcl::BVNode< OBB > | |
  fcl::BVNode< OBBRSS > | |
  fcl::BVNode< RSS > | |
  fcl::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 |
 fcl::BVSplitterBase< BV > | Base interface for BV splitting algorithm |
  fcl::BVSplitter< BV > | A class describing the split rule that splits each BV node |
 fcl::CollisionFunctionMatrix< NarrowPhaseSolver > | Collision matrix stores the functions for collision between different types of objects and provides a uniform call interface |
 fcl::CollisionGeometry | The geometry for the object for collision or distance computation |
  fcl::BVHModel< kIOS > | |
  fcl::BVHModel< OBB > | |
  fcl::BVHModel< OBBRSS > | |
  fcl::BVHModel< RSS > | |
  fcl::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) |
  fcl::OcTree | Octree is one type of collision geometry which can encode uncertainty information in the sensor data |
  fcl::ShapeBase | Base class for all basic geometric shapes |
   fcl::Box | Center at zero point, axis aligned box |
   fcl::Capsule | Center at zero point capsule |
   fcl::Cone | Center at zero cone |
   fcl::Convex | Convex polytope |
   fcl::Cylinder | Center at zero cylinder |
   fcl::Halfspace | Half Space: this is equivalent to the Plane in ODE |
   fcl::Plane | Infinite plane |
   fcl::Sphere | Center at zero point sphere |
   fcl::TriangleP | Triangle stores the points instead of only indices of points |
 fcl::CollisionObject | Object for collision or distance computation, contains the geometry and the transform information |
 fcl::CollisionRequest | Request to the collision algorithm |
 fcl::CollisionResult | Collision result |
 fcl::Contact | Contact information returned by collision |
 fcl::CostSource | Cost source describes an area with a cost. The area is described by an AABB region |
 fcl::DistanceFunctionMatrix< NarrowPhaseSolver > | Distance matrix stores the functions for distance between different types of objects and provides a uniform call interface |
 fcl::DistanceRequest | Request to the distance computation |
 fcl::DistanceResult | Distance result |
 fcl::Convex::Edge | |
 fcl::IntervalTreeCollisionManager::EndPoint | SAP end point |
 fcl::SaPCollisionManager::EndPoint | End point for an interval |
 fcl::details::EPA | Class for EPA algorithm |
 std::exception | STL class |
  std::runtime_error | STL class |
   fcl::Exception | |
 fcl::details::GJK | Class for GJK algorithm |
 fcl::GJKSolver_indep | Collision and distance solver based on GJK algorithm implemented in fcl (rewritten the code from the GJK in bullet) |
 fcl::HierarchyTree< BV > | Class for hierarchy tree structure |
 fcl::implementation_array::HierarchyTree< BV > | Class for hierarchy tree structure |
 fcl::HierarchyTree< fcl::AABB > | |
 fcl::implementation_array::HierarchyTree< fcl::AABB > | |
 fcl::Intersect | CCD intersect kernel among primitives |
 fcl::IntervalTree | Interval tree |
 fcl::IntervalTreeNode | The node for interval tree |
 fcl::SaPCollisionManager::isNotValidPair | Functor to help remove collision pairs no longer valid (i.e., should be culled away) |
 fcl::SaPCollisionManager::isUnregistered | Functor to help unregister one object |
 fcl::KDOP< N > | KDOP class describes the KDOP collision structures |
 fcl::kIOS | A class describing the kIOS collision structure, which is a set of spheres |
 fcl::details::MinkowskiDiff | Minkowski difference class of two shapes |
 fcl::morton_functor< T > | Functor to compute the morton code for a given AABB |
 fcl::morton_functor< boost::dynamic_bitset<> > | Functor to compute n bit morton code for a given AABB |
 fcl::morton_functor< FCL_UINT32 > | Functor to compute 30 bit morton code for a given AABB |
 fcl::morton_functor< FCL_UINT64 > | Functor to compute 60 bit morton code for a given AABB |
 fcl::implementation_array::NodeBase< BV > | |
 fcl::NodeBase< BV > | Dynamic AABB tree node |
 fcl::implementation_array::nodeBaseLess< BV > | Functor comparing two nodes |
 noncopyable | |
  fcl::BVHModel< kIOS > | |
  fcl::BVHModel< OBB > | |
  fcl::BVHModel< OBBRSS > | |
  fcl::BVHModel< RSS > | |
  fcl::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) |
  fcl::tools::Profiler | This is a simple thread-safe tool for counting time spent in various chunks of code |
 fcl::OBB | Oriented bounding box class |
 fcl::OBBRSS | Class merging the OBB and RSS, can handle collision and distance simultaneously |
 fcl::OcTreeSolver< NarrowPhaseSolver > | Algorithms for collision related with octree |
 fcl::PolySolver | A class solves polynomial degree (1,2,3) equations |
 fcl::Project | Project functions |
 fcl::Project::ProjectResult | |
 fcl::RSS | A class for rectangle sphere-swept bounding volume |
 fcl::SaPCollisionManager::SaPAABB | SAP interval for one object |
 fcl::SaPCollisionManager::SaPPair | A pair of objects that are not culling away and should further check collision |
 fcl::tools::Profiler::ScopedBlock | This instance will call Profiler::begin() when constructed and Profiler::end() when it goes out of scope |
 fcl::tools::Profiler::ScopedStart | This instance will call Profiler::start() when constructed and Profiler::stop() when it goes out of scope |
 fcl::SimpleHashTable< Key, Data, HashFnc > | A simple hash table implemented as multiple buckets. HashFnc is any extended hash function: HashFnc(key) = {index1, index2, ..., } |
 fcl::SimpleInterval | Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_ by Cormen, Leisserson, and Rivest |
  fcl::IntervalTreeCollisionManager::SAPInterval | Extention interval tree's interval to SAP interval, adding more information |
 fcl::details::GJK::Simplex | |
 fcl::details::GJK::SimplexV | |
 fcl::SparseHashTable< Key, Data, HashFnc, TableT > | A hash table implemented using unordered_map |
 fcl::SpatialHash | Spatial hash function: hash an AABB to a set of integer values |
 fcl::Transform3f | Simple transform class used locally by InterpMotion |
 fcl::TraversalNodeBase | Node structure encoding the information required for traversal |
  fcl::CollisionTraversalNodeBase | Node structure encoding the information required for collision traversal |
   fcl::BVHCollisionTraversalNode< kIOS > | |
    fcl::MeshCollisionTraversalNode< kIOS > | |
     fcl::MeshCollisionTraversalNodekIOS | |
   fcl::BVHCollisionTraversalNode< OBB > | |
    fcl::MeshCollisionTraversalNode< OBB > | |
     fcl::MeshCollisionTraversalNodeOBB | Traversal node for collision between two meshes if their underlying BVH node is oriented node (OBB, RSS, OBBRSS, kIOS) |
   fcl::BVHCollisionTraversalNode< OBBRSS > | |
    fcl::MeshCollisionTraversalNode< OBBRSS > | |
     fcl::MeshCollisionTraversalNodeOBBRSS | |
   fcl::BVHCollisionTraversalNode< RSS > | |
    fcl::MeshCollisionTraversalNode< RSS > | |
     fcl::MeshCollisionTraversalNodeRSS | |
   fcl::BVHShapeCollisionTraversalNode< kIOS, S > | |
    fcl::MeshShapeCollisionTraversalNode< kIOS, S, NarrowPhaseSolver > | |
     fcl::MeshShapeCollisionTraversalNodekIOS< S, NarrowPhaseSolver > | |
   fcl::BVHShapeCollisionTraversalNode< OBB, S > | |
    fcl::MeshShapeCollisionTraversalNode< OBB, S, NarrowPhaseSolver > | |
     fcl::MeshShapeCollisionTraversalNodeOBB< S, NarrowPhaseSolver > | Traversal node for mesh and shape, when mesh BVH is one of the oriented node (OBB, RSS, OBBRSS, kIOS) |
   fcl::BVHShapeCollisionTraversalNode< OBBRSS, S > | |
    fcl::MeshShapeCollisionTraversalNode< OBBRSS, S, NarrowPhaseSolver > | |
     fcl::MeshShapeCollisionTraversalNodeOBBRSS< S, NarrowPhaseSolver > | |
   fcl::BVHShapeCollisionTraversalNode< RSS, S > | |
    fcl::MeshShapeCollisionTraversalNode< RSS, S, NarrowPhaseSolver > | |
     fcl::MeshShapeCollisionTraversalNodeRSS< S, NarrowPhaseSolver > | |
   fcl::BVHCollisionTraversalNode< BV > | Traversal node for collision between BVH models |
    fcl::MeshCollisionTraversalNode< BV > | Traversal node for collision between two meshes |
   fcl::BVHShapeCollisionTraversalNode< BV, S > | Traversal node for collision between BVH and shape |
    fcl::MeshShapeCollisionTraversalNode< BV, S, NarrowPhaseSolver > | Traversal node for collision between mesh and shape |
   fcl::MeshOcTreeCollisionTraversalNode< BV, NarrowPhaseSolver > | Traversal node for mesh-octree collision |
   fcl::OcTreeCollisionTraversalNode< NarrowPhaseSolver > | Traversal node for octree collision |
   fcl::OcTreeMeshCollisionTraversalNode< BV, NarrowPhaseSolver > | Traversal node for octree-mesh collision |
   fcl::OcTreeShapeCollisionTraversalNode< S, NarrowPhaseSolver > | Traversal node for octree-shape collision |
   fcl::ShapeBVHCollisionTraversalNode< S, BV > | Traversal node for collision between shape and BVH |
    fcl::ShapeMeshCollisionTraversalNode< S, BV, NarrowPhaseSolver > | Traversal node for collision between shape and mesh |
   fcl::ShapeCollisionTraversalNode< S1, S2, NarrowPhaseSolver > | Traversal node for collision between two shapes |
   fcl::ShapeOcTreeCollisionTraversalNode< S, NarrowPhaseSolver > | Traversal node for shape-octree collision |
   fcl::ShapeBVHCollisionTraversalNode< S, kIOS > | |
    fcl::ShapeMeshCollisionTraversalNode< S, kIOS, NarrowPhaseSolver > | |
     fcl::ShapeMeshCollisionTraversalNodekIOS< S, NarrowPhaseSolver > | |
   fcl::ShapeBVHCollisionTraversalNode< S, OBB > | |
    fcl::ShapeMeshCollisionTraversalNode< S, OBB, NarrowPhaseSolver > | |
     fcl::ShapeMeshCollisionTraversalNodeOBB< S, NarrowPhaseSolver > | Traversal node for shape and mesh, when mesh BVH is one of the oriented node (OBB, RSS, OBBRSS, kIOS) |
   fcl::ShapeBVHCollisionTraversalNode< S, OBBRSS > | |
    fcl::ShapeMeshCollisionTraversalNode< S, OBBRSS, NarrowPhaseSolver > | |
     fcl::ShapeMeshCollisionTraversalNodeOBBRSS< S, NarrowPhaseSolver > | |
   fcl::ShapeBVHCollisionTraversalNode< S, RSS > | |
    fcl::ShapeMeshCollisionTraversalNode< S, RSS, NarrowPhaseSolver > | |
     fcl::ShapeMeshCollisionTraversalNodeRSS< S, NarrowPhaseSolver > | |
  fcl::DistanceTraversalNodeBase | Node structure encoding the information required for distance traversal |
   fcl::BVHDistanceTraversalNode< kIOS > | |
    fcl::MeshDistanceTraversalNode< kIOS > | |
     fcl::MeshDistanceTraversalNodekIOS | |
   fcl::BVHDistanceTraversalNode< OBBRSS > | |
    fcl::MeshDistanceTraversalNode< OBBRSS > | |
     fcl::MeshDistanceTraversalNodeOBBRSS | |
   fcl::BVHDistanceTraversalNode< RSS > | |
    fcl::MeshDistanceTraversalNode< RSS > | |
     fcl::MeshDistanceTraversalNodeRSS | Traversal node for distance computation between two meshes if their underlying BVH node is oriented node (RSS, OBBRSS, kIOS) |
   fcl::BVHShapeDistanceTraversalNode< kIOS, S > | |
    fcl::MeshShapeDistanceTraversalNode< kIOS, S, NarrowPhaseSolver > | |
     fcl::MeshShapeDistanceTraversalNodekIOS< S, NarrowPhaseSolver > | |
   fcl::BVHShapeDistanceTraversalNode< OBBRSS, S > | |
    fcl::MeshShapeDistanceTraversalNode< OBBRSS, S, NarrowPhaseSolver > | |
     fcl::MeshShapeDistanceTraversalNodeOBBRSS< S, NarrowPhaseSolver > | |
   fcl::BVHShapeDistanceTraversalNode< RSS, S > | |
    fcl::MeshShapeDistanceTraversalNode< RSS, S, NarrowPhaseSolver > | |
     fcl::MeshShapeDistanceTraversalNodeRSS< S, NarrowPhaseSolver > | Traversal node for distance between mesh and shape, when mesh BVH is one of the oriented node (RSS, OBBRSS, kIOS) |
   fcl::BVHDistanceTraversalNode< BV > | Traversal node for distance computation between BVH models |
    fcl::MeshDistanceTraversalNode< BV > | Traversal node for distance computation between two meshes |
   fcl::BVHShapeDistanceTraversalNode< BV, S > | Traversal node for distance computation between BVH and shape |
    fcl::MeshShapeDistanceTraversalNode< BV, S, NarrowPhaseSolver > | Traversal node for distance between mesh and shape |
   fcl::MeshOcTreeDistanceTraversalNode< BV, NarrowPhaseSolver > | Traversal node for mesh-octree distance |
   fcl::OcTreeDistanceTraversalNode< NarrowPhaseSolver > | Traversal node for octree distance |
   fcl::OcTreeMeshDistanceTraversalNode< BV, NarrowPhaseSolver > | Traversal node for octree-mesh distance |
   fcl::OcTreeShapeDistanceTraversalNode< S, NarrowPhaseSolver > | Traversal node for octree-shape distance |
   fcl::ShapeBVHDistanceTraversalNode< S, BV > | Traversal node for distance computation between shape and BVH |
    fcl::ShapeMeshDistanceTraversalNode< S, BV, NarrowPhaseSolver > | Traversal node for distance between shape and mesh |
   fcl::ShapeDistanceTraversalNode< S1, S2, NarrowPhaseSolver > | Traversal node for distance between two shapes |
   fcl::ShapeOcTreeDistanceTraversalNode< S, NarrowPhaseSolver > | Traversal node for shape-octree distance |
   fcl::ShapeBVHDistanceTraversalNode< S, kIOS > | |
    fcl::ShapeMeshDistanceTraversalNode< S, kIOS, NarrowPhaseSolver > | |
     fcl::ShapeMeshDistanceTraversalNodekIOS< S, NarrowPhaseSolver > | |
   fcl::ShapeBVHDistanceTraversalNode< S, OBBRSS > | |
    fcl::ShapeMeshDistanceTraversalNode< S, OBBRSS, NarrowPhaseSolver > | |
     fcl::ShapeMeshDistanceTraversalNodeOBBRSS< S, NarrowPhaseSolver > | |
   fcl::ShapeBVHDistanceTraversalNode< S, RSS > | |
    fcl::ShapeMeshDistanceTraversalNode< S, RSS, NarrowPhaseSolver > | |
     fcl::ShapeMeshDistanceTraversalNodeRSS< S, NarrowPhaseSolver > | |
 fcl::Triangle | Triangle with 3 indices for points |
 fcl::TriangleAndVertices | |
 fcl::TriangleDistance | Triangle distance functions |
 unordered_map | |
  fcl::unordered_map_hash_table< U, V > | |
 fcl::Variance3f | Class for variance matrix in 3d |