hpp-fcl: Class List

hpp-fcl 1.6.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 hpp | Main namespace
▼N fcl |
▼N details |
C ContactPoint |
▼C EPA | Class for EPA algorithm
C SimplexF |
C SimplexHorizon |
C SimplexList |
▼C GJK | Class for GJK algorithm
C Simplex |
C SimplexV |
▼C MinkowskiDiff | Minkowski difference class of two shapes
C ShapeData |
▼N internal |
C Loader |
C TriangleAndVertices |
▼N tools |
▼C Profiler | This is a simple thread-safe tool for counting time spent in various chunks of code. This is different from external profiling tools in that it allows the user to count time spent in various bits of code (sub-function granularity) or count how many times certain pieces of code are executed
C ScopedBlock | This instance will call Profiler::begin() when constructed and Profiler::end() when it goes out of scope
C ScopedStart | This instance will call Profiler::start() when constructed and Profiler::stop() when it goes out of scope. If the profiler was already started, this block's constructor and destructor take no action
C AABB | A class describing the AABB collision structure, which is a box in 3D space determined by two diagonal points
C Box | Center at zero point, axis aligned box
C BVFitter | The class for the default algorithm fitting a bounding volume to a set of points
C BVFitter< AABB > | Specification of BVFitter for AABB bounding volume
C BVFitter< kIOS > | Specification of BVFitter for kIOS bounding volume
C BVFitter< OBB > | Specification of BVFitter for OBB bounding volume
C BVFitter< OBBRSS > | Specification of BVFitter for OBBRSS bounding volume
C BVFitter< RSS > | Specification of BVFitter for RSS bounding volume
C BVFitterTpl | The class for the default algorithm fitting a bounding volume to a set of points
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 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 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 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 BVNodeBase | BVNodeBase encodes the tree structure for BVH
C BVSplitter | A class describing the split rule that splits each BV node
▼C CachedMeshLoader |
C Key |
C Capsule | Capsule It is \( { x \in \mathcal{R}^3, d(x, AB) < 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 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 CollisionRequest | Request to the collision algorithm
C CollisionResult | Collision result
C ComputeCollision |
C ComputeDistance |
C Cone | Cone The base of the cone is at \( z = - halfLength \) and the top is at \( z = halfLength \)
C Contact | Contact information returned by collision
C Convex | Convex polytope
▼C ConvexBase | Base for convex polytope
C Neighbors |
C Cylinder | Cylinder along Z axis. The cylinder is defined at its centroid
C DistanceFunctionMatrix | Distance matrix stores the functions for distance between different types of objects and provides a uniform call interface
C DistanceRequest | Request to the distance computation
C DistanceResult | Distance result
C GJKSolver | Collision and distance solver based on GJK algorithm implemented in fcl (rewritten the code from the GJK in bullet)
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 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 MeshLoader |
C OBB | Oriented bounding box class
C OBBRSS | Class merging the OBB and RSS, can handle collision and distance simultaneously
C OcTree | Octree is one type of collision geometry which can encode uncertainty information in the sensor data
C Plane | Infinite plane
C QueryRequest | Base class for all query requests
C QueryResult | Base class for all query results
C RSS | A class for rectangle sphere-swept bounding volume
C ShapeBase | Base class for all basic geometric shapes
C Sphere | Center at zero point sphere
C Transform3f | Simple transform class used locally by InterpMotion
C TraversalTraitsCollision |
C TraversalTraitsDistance |
C Triangle | Triangle with 3 indices for points
C TriangleP | Triangle stores the points instead of only indices of points
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)