hpp-fcl: Class List

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

Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 12345]

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