hpp-fcl: Class Hierarchy

hpp-fcl 1.7.7 HPP fork of FCL -- The Flexible Collision Library

Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 1234]

C hpp::fcl::AABB | A class describing the AABB collision structure, which is a box in 3D space determined by two diagonal points
▼C hpp::fcl::BVFitterTpl< BV > | The class for the default algorithm fitting a bounding volume to a set of points
C hpp::fcl::BVFitter< BV > | The class for the default algorithm fitting a bounding volume to a set of points
▼C hpp::fcl::BVFitterTpl< AABB > |
C hpp::fcl::BVFitter< AABB > | Specification of BVFitter for AABB bounding volume
▼C hpp::fcl::BVFitterTpl< kIOS > |
C hpp::fcl::BVFitter< kIOS > | Specification of BVFitter for kIOS bounding volume
▼C hpp::fcl::BVFitterTpl< OBB > |
C hpp::fcl::BVFitter< OBB > | Specification of BVFitter for OBB bounding volume
▼C hpp::fcl::BVFitterTpl< OBBRSS > |
C hpp::fcl::BVFitter< OBBRSS > | Specification of BVFitter for OBBRSS bounding volume
▼C hpp::fcl::BVFitterTpl< RSS > |
C hpp::fcl::BVFitter< RSS > | Specification of BVFitter for RSS bounding volume
C hpp::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. The front list reflects the subset of a BVTT that is traversed for that particular proximity query
▼C hpp::fcl::BVNodeBase | BVNodeBase encodes the tree structure for BVH
C hpp::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
▼C hpp::fcl::BVSplitter< BV > | A class describing the split rule that splits each BV node
C boost::serialization::internal::BVSplitterAccessor< BV > |
C hpp::fcl::CollisionFunctionMatrix | Collision matrix stores the functions for collision between different types of objects and provides a uniform call interface
▼C hpp::fcl::CollisionGeometry | The geometry for the object for collision or distance computation
▼C hpp::fcl::BVHModelBase | A base class describing the bounding hierarchy of a mesh model or a point cloud model (which is viewed as a degraded version of mesh)
C boost::serialization::internal::BVHModelBaseAccessor |
▼C hpp::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)
C boost::serialization::internal::BVHModelAccessor< BV > |
C hpp::fcl::OcTree | Octree is one type of collision geometry which can encode uncertainty information in the sensor data
▼C hpp::fcl::ShapeBase | Base class for all basic geometric shapes
C hpp::fcl::Box | Center at zero point, axis aligned box
C hpp::fcl::Capsule | Capsule 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) \)
C hpp::fcl::Cone | Cone The base of the cone is at \( z = - halfLength \) and the top is at \( z = halfLength \)
▼C hpp::fcl::ConvexBase | Base for convex polytope
C hpp::fcl::Convex< PolygonT > | Convex polytope
C hpp::fcl::Cylinder | Cylinder along Z axis. The cylinder is defined at its centroid
C hpp::fcl::Halfspace | Half 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
C hpp::fcl::Plane | Infinite plane
C hpp::fcl::Sphere | Center at zero point sphere
C hpp::fcl::TriangleP | Triangle stores the points instead of only indices of points
C hpp::fcl::CollisionObject | Object for collision or distance computation, contains the geometry and the transform information
C hpp::fcl::ComputeCollision |
C hpp::fcl::ComputeDistance |
C hpp::fcl::Contact | Contact information returned by collision
C hpp::fcl::details::ContactPoint |
C hpp::fcl::CPUTimes |
C hpp::fcl::DistanceFunctionMatrix | Distance matrix stores the functions for distance between different types of objects and provides a uniform call interface
C hpp::fcl::details::EPA | Class for EPA algorithm
C hpp::fcl::details::GJK | Class for GJK algorithm
C hpp::fcl::GJKSolver | Collision and distance solver based on GJK algorithm implemented in fcl (rewritten the code from the GJK in bullet)
C hpp::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
C hpp::fcl::CachedMeshLoader::Key |
C hpp::fcl::kIOS | A class describing the kIOS collision structure, which is a set of spheres
C hpp::fcl::internal::Loader |
C hpp::fcl::internal::memory_footprint_evaluator< T > |
C hpp::fcl::internal::memory_footprint_evaluator< ::hpp::fcl::BVHModel< BV > > |
▼C hpp::fcl::MeshLoader |
C hpp::fcl::CachedMeshLoader |
▼CMeshShapeDistanceTraversalNode |
C MeshShapeDistanceTraversalNodeOBBRSS< S > |
C MeshShapeDistanceTraversalNodeRSS< S > | Traversal node for distance between mesh and shape, when mesh BVH is one of the oriented node (RSS, kIOS, OBBRSS)
C MeshShapeDistanceTraversalNodekIOS< S > |
C hpp::fcl::details::MinkowskiDiff | Minkowski difference class of two shapes
C hpp::fcl::ConvexBase::Neighbors |
C hpp::fcl::OBB | Oriented bounding box class
C hpp::fcl::OBBRSS | Class merging the OBB and RSS, can handle collision and distance simultaneously
▼C hpp::fcl::QueryRequest | Base class for all query requests
C hpp::fcl::CollisionRequest | Request to the collision algorithm
C hpp::fcl::DistanceRequest | Request to the distance computation
▼C hpp::fcl::QueryResult | Base class for all query results
C hpp::fcl::CollisionResult | Collision result
C hpp::fcl::DistanceResult | Distance result
C hpp::fcl::RSS | A class for rectangle sphere-swept bounding volume
▼CShapeBVHDistanceTraversalNode |
▼C ShapeMeshDistanceTraversalNode< S, OBBRSS > |
C ShapeMeshDistanceTraversalNodeOBBRSS< S > |
▼C ShapeMeshDistanceTraversalNode< S, kIOS > |
C ShapeMeshDistanceTraversalNodekIOS< S > |
▼C ShapeMeshDistanceTraversalNode< S, RSS > |
C ShapeMeshDistanceTraversalNodeRSS< S > | Traversal node for distance between shape and mesh, when mesh BVH is one of the oriented node (RSS, kIOS, OBBRSS)
C ShapeMeshDistanceTraversalNode< S, BV > | Traversal node for distance between shape and mesh
C hpp::fcl::details::MinkowskiDiff::ShapeData |
C hpp::fcl::details::GJK::Simplex |
C hpp::fcl::details::EPA::SimplexF |
C hpp::fcl::details::EPA::SimplexHorizon |
C hpp::fcl::details::EPA::SimplexList |
C hpp::fcl::details::GJK::SimplexV |
C hpp::fcl::Timer | This 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
C hpp::fcl::Transform3f | Simple transform class used locally by InterpMotion
C hpp::fcl::TraversalTraitsCollision< TypeA, TypeB > |
C hpp::fcl::TraversalTraitsDistance< TypeA, TypeB > |
C hpp::fcl::Triangle | Triangle with 3 indices for points
C hpp::fcl::internal::TriangleAndVertices |