hpp-fcl  1.8.0
HPP fork of FCL -- The Flexible Collision Library
Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 1234]
 Chpp::fcl::AABBA class describing the AABB collision structure, which is a box in 3D space determined by two diagonal points
 Chpp::fcl::BVFitterTpl< BV >The class for the default algorithm fitting a bounding volume to a set of points
 Chpp::fcl::BVFitter< BV >The class for the default algorithm fitting a bounding volume to a set of points
 Chpp::fcl::BVFitterTpl< AABB >
 Chpp::fcl::BVFitter< AABB >Specification of BVFitter for AABB bounding volume
 Chpp::fcl::BVFitterTpl< kIOS >
 Chpp::fcl::BVFitter< kIOS >Specification of BVFitter for kIOS bounding volume
 Chpp::fcl::BVFitterTpl< OBB >
 Chpp::fcl::BVFitter< OBB >Specification of BVFitter for OBB bounding volume
 Chpp::fcl::BVFitterTpl< OBBRSS >
 Chpp::fcl::BVFitter< OBBRSS >Specification of BVFitter for OBBRSS bounding volume
 Chpp::fcl::BVFitterTpl< RSS >
 Chpp::fcl::BVFitter< RSS >Specification of BVFitter for RSS bounding volume
 Chpp::fcl::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. The front list reflects the subset of a BVTT that is traversed for that particular proximity query
 Chpp::fcl::BVNodeBaseBVNodeBase encodes the tree structure for BVH
 Chpp::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
 Chpp::fcl::BVSplitter< BV >A class describing the split rule that splits each BV node
 Cboost::serialization::internal::BVSplitterAccessor< BV >
 Chpp::fcl::CollisionFunctionMatrixCollision matrix stores the functions for collision between different types of objects and provides a uniform call interface
 Chpp::fcl::CollisionGeometryThe geometry for the object for collision or distance computation
 Chpp::fcl::BVHModelBaseA base class describing the bounding hierarchy of a mesh model or a point cloud model (which is viewed as a degraded version of mesh)
 Cboost::serialization::internal::BVHModelBaseAccessor
 Chpp::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)
 Cboost::serialization::internal::BVHModelAccessor< BV >
 Chpp::fcl::HeightField< BV >Data structure depicting a height field given by the base grid dimensions and the elevation along the grid
 Cboost::serialization::internal::HeightFieldAccessor< BV >
 Chpp::fcl::OcTreeOctree is one type of collision geometry which can encode uncertainty information in the sensor data
 Chpp::fcl::ShapeBaseBase class for all basic geometric shapes
 Chpp::fcl::BoxCenter at zero point, axis aligned box
 Chpp::fcl::CapsuleCapsule It is $ { x~\in~\mathbb{R}^3, d(x, AB) \leq radius } $ where $ d(x, AB) $ is the distance between the point x and the capsule segment AB, with $ A = (0,0,-halfLength), B = (0,0,halfLength) $
 Chpp::fcl::ConeCone The base of the cone is at $ z = - halfLength $ and the top is at $ z = halfLength $
 Chpp::fcl::ConvexBaseBase for convex polytope
 Chpp::fcl::Convex< PolygonT >Convex polytope
 Chpp::fcl::CylinderCylinder along Z axis. The cylinder is defined at its centroid
 Chpp::fcl::HalfspaceHalf 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 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
 Chpp::fcl::PlaneInfinite plane
 Chpp::fcl::SphereCenter at zero point sphere
 Chpp::fcl::TrianglePTriangle stores the points instead of only indices of points
 Chpp::fcl::CollisionObjectObject for collision or distance computation, contains the geometry and the transform information
 Chpp::fcl::ComputeCollisionThis class reduces the cost of identifying the geometry pair. This is mostly useful for repeated shape-shape queries
 Chpp::fcl::ComputeDistance
 Chpp::fcl::ContactContact information returned by collision
 Chpp::fcl::details::ContactPoint
 Chpp::fcl::CPUTimes
 Chpp::fcl::DistanceFunctionMatrixDistance matrix stores the functions for distance between different types of objects and provides a uniform call interface
 Chpp::fcl::details::EPAClass for EPA algorithm
 Chpp::fcl::details::GJKClass for GJK algorithm
 Chpp::fcl::GJKSolverCollision and distance solver based on GJK algorithm implemented in fcl (rewritten the code from the GJK in bullet)
 Chpp::fcl::HFNodeBase
 Chpp::fcl::HFNode< BV >
 Chpp::fcl::KDOP< 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
 Chpp::fcl::CachedMeshLoader::Key
 Chpp::fcl::kIOSA class describing the kIOS collision structure, which is a set of spheres
 Chpp::fcl::internal::Loader
 Chpp::fcl::internal::memory_footprint_evaluator< T >
 Chpp::fcl::internal::memory_footprint_evaluator< ::hpp::fcl::BVHModel< BV > >
 Chpp::fcl::MeshLoader
 Chpp::fcl::CachedMeshLoader
 CMeshShapeDistanceTraversalNode
 CMeshShapeDistanceTraversalNodekIOS< S >
 CMeshShapeDistanceTraversalNodeOBBRSS< S >
 CMeshShapeDistanceTraversalNodeRSS< S >Traversal node for distance between mesh and shape, when mesh BVH is one of the oriented node (RSS, kIOS, OBBRSS)
 Chpp::fcl::details::MinkowskiDiffMinkowski difference class of two shapes
 Chpp::fcl::ConvexBase::Neighbors
 Chpp::fcl::OBBOriented bounding box class
 Chpp::fcl::OBBRSSClass merging the OBB and RSS, can handle collision and distance simultaneously
 Chpp::fcl::QuadrilateralQuadrilateral with 4 indices for points
 Chpp::fcl::QueryRequestBase class for all query requests
 Chpp::fcl::CollisionRequestRequest to the collision algorithm
 Chpp::fcl::DistanceRequestRequest to the distance computation
 Chpp::fcl::QueryResultBase class for all query results
 Chpp::fcl::CollisionResultCollision result
 Chpp::fcl::DistanceResultDistance result
 Chpp::fcl::RSSA class for rectangle sphere-swept bounding volume
 CShapeBVHDistanceTraversalNode
 CShapeMeshDistanceTraversalNode< S, BV >Traversal node for distance between shape and mesh
 CShapeMeshDistanceTraversalNode< S, kIOS >
 CShapeMeshDistanceTraversalNodekIOS< S >
 CShapeMeshDistanceTraversalNode< S, OBBRSS >
 CShapeMeshDistanceTraversalNodeOBBRSS< S >
 CShapeMeshDistanceTraversalNode< S, RSS >
 CShapeMeshDistanceTraversalNodeRSS< S >Traversal node for distance between shape and mesh, when mesh BVH is one of the oriented node (RSS, kIOS, OBBRSS)
 Chpp::fcl::details::MinkowskiDiff::ShapeData
 Chpp::fcl::details::GJK::Simplex
 Chpp::fcl::details::EPA::SimplexF
 Chpp::fcl::details::EPA::SimplexHorizon
 Chpp::fcl::details::EPA::SimplexList
 Chpp::fcl::details::GJK::SimplexV
 Chpp::fcl::TimerThis class mimics the way "boost/timer/timer.hpp" operates while using the modern std::chrono library. Importantly, this class will only have an effect for C++11 and more
 Chpp::fcl::Transform3fSimple transform class used locally by InterpMotion
 Chpp::fcl::TraversalTraitsCollision< TypeA, TypeB >
 Chpp::fcl::TraversalTraitsDistance< TypeA, TypeB >
 Chpp::fcl::TriangleTriangle with 3 indices for points
 Chpp::fcl::internal::TriangleAndVertices
 Chpp::fcl::details::UpdateBoundingVolume< BV >
 Chpp::fcl::details::UpdateBoundingVolume< AABB >