| ►Nfcl | Main namespace |
| ►Ndetail | |
| ►Nimplementation_array | |
| ►CHierarchyTree | Class for hierarchy tree structure |
| CSortByMorton | |
| CNodeBase | |
| CnodeBaseLess | Functor comparing two nodes |
| CSelectImpl | |
| CSelectImpl< S, AABB< S > > | |
| CApplyImpl | |
| CApplyImpl< S, kIOS< S > > | |
| CApplyImpl< S, OBB< S > > | |
| CApplyImpl< S, OBBRSS< S > > | |
| CApplyImpl< S, RSS< S > > | |
| CBoxSpecification | |
| CBVFitter | The class for the default algorithm fitting a bounding volume to a set of points |
| CBVFitterBase | Interface for fitting a bv given the triangles or points inside it |
| CBVHCollideImpl | |
| CBVHCollideImpl< S, kIOS< S > > | |
| CBVHCollideImpl< S, OBB< S > > | |
| CBVHCollideImpl< S, OBBRSS< S > > | |
| CBVHCollisionTraversalNode | Traversal node for collision between BVH models |
| CBVHContinuousCollisionPair | Traversal node for continuous collision between BVH models |
| CBVHDistanceImpl | |
| CBVHDistanceImpl< S, kIOS< S > > | |
| CBVHDistanceImpl< S, OBBRSS< S > > | |
| CBVHDistanceImpl< S, RSS< S > > | |
| CBVHDistanceTraversalNode | Traversal node for distance computation between BVH models |
| CBVHFrontNode | 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 |
| CBVHShapeCollider | |
| CBVHShapeCollider< kIOS< typename Shape::S >, Shape, NarrowPhaseSolver > | |
| CBVHShapeCollider< OBB< typename Shape::S >, Shape, NarrowPhaseSolver > | |
| CBVHShapeCollider< OBBRSS< typename Shape::S >, Shape, NarrowPhaseSolver > | |
| CBVHShapeCollider< RSS< typename Shape::S >, Shape, NarrowPhaseSolver > | |
| CBVHShapeCollisionTraversalNode | Traversal node for collision between BVH and shape |
| CBVHShapeDistancer | |
| CBVHShapeDistancer< kIOS< typename Shape::S >, Shape, NarrowPhaseSolver > | |
| CBVHShapeDistancer< OBBRSS< typename Shape::S >, Shape, NarrowPhaseSolver > | |
| CBVHShapeDistancer< RSS< typename Shape::S >, Shape, NarrowPhaseSolver > | |
| CBVHShapeDistanceTraversalNode | Traversal node for distance computation between BVH and shape |
| CBVSplitter | A class describing the split rule that splits each BV node |
| CBVSplitterBase | Base interface for BV splitting algorithm |
| CBVT | Bounding volume test structure |
| CBVT_Comparer | Comparer between two BVT |
| CBVTQ | |
| CCanStopImpl | |
| CCanStopImpl< S, OBB< S > > | |
| CCanStopImpl< S, OBBRSS< S > > | |
| CCanStopImpl< S, RSS< S > > | |
| Cccd_box_t | |
| Cccd_cap_t | |
| Cccd_cone_t | |
| Cccd_convex_t | |
| Cccd_cyl_t | |
| Cccd_ellipsoid_t | |
| Cccd_obj_t | |
| Cccd_sphere_t | |
| Cccd_triangle_t | |
| CCollisionFunctionMatrix | Collision matrix stores the functions for collision between different types of objects and provides a uniform call interface |
| CCollisionTraversalNodeBase | Node structure encoding the information required for collision traversal |
| CComputeBVImpl | |
| CComputeBVImpl< S, AABB< S >, Box< S > > | |
| CComputeBVImpl< S, AABB< S >, Capsule< S > > | |
| CComputeBVImpl< S, AABB< S >, Cone< S > > | |
| CComputeBVImpl< S, AABB< S >, Convex< S > > | |
| CComputeBVImpl< S, AABB< S >, Cylinder< S > > | |
| CComputeBVImpl< S, AABB< S >, Ellipsoid< S > > | |
| CComputeBVImpl< S, AABB< S >, Halfspace< S > > | |
| CComputeBVImpl< S, AABB< S >, Plane< S > > | |
| CComputeBVImpl< S, AABB< S >, Sphere< S > > | |
| CComputeBVImpl< S, AABB< S >, TriangleP< S > > | |
| CComputeBVImpl< S, KDOP< S, 16 >, Halfspace< S > > | |
| CComputeBVImpl< S, KDOP< S, 16 >, Plane< S > > | |
| CComputeBVImpl< S, KDOP< S, 18 >, Halfspace< S > > | |
| CComputeBVImpl< S, KDOP< S, 18 >, Plane< S > > | |
| CComputeBVImpl< S, KDOP< S, 24 >, Halfspace< S > > | |
| CComputeBVImpl< S, KDOP< S, 24 >, Plane< S > > | |
| CComputeBVImpl< S, kIOS< S >, Halfspace< S > > | |
| CComputeBVImpl< S, kIOS< S >, Plane< S > > | |
| CComputeBVImpl< S, OBB< S >, Box< S > > | |
| CComputeBVImpl< S, OBB< S >, Capsule< S > > | |
| CComputeBVImpl< S, OBB< S >, Cone< S > > | |
| CComputeBVImpl< S, OBB< S >, Convex< S > > | |
| CComputeBVImpl< S, OBB< S >, Cylinder< S > > | |
| CComputeBVImpl< S, OBB< S >, Ellipsoid< S > > | |
| CComputeBVImpl< S, OBB< S >, Halfspace< S > > | |
| CComputeBVImpl< S, OBB< S >, Plane< S > > | |
| CComputeBVImpl< S, OBB< S >, Sphere< S > > | |
| CComputeBVImpl< S, OBBRSS< S >, Halfspace< S > > | |
| CComputeBVImpl< S, OBBRSS< S >, Plane< S > > | |
| CComputeBVImpl< S, RSS< S >, Halfspace< S > > | |
| CComputeBVImpl< S, RSS< S >, Plane< S > > | |
| CComputeRuleCenterImpl | |
| CComputeRuleCenterImpl< S, kIOS< S > > | |
| CComputeRuleCenterImpl< S, OBB< S > > | |
| CComputeRuleCenterImpl< S, OBBRSS< S > > | |
| CComputeRuleCenterImpl< S, RSS< S > > | |
| CComputeRuleMeanImpl | |
| CComputeRuleMeanImpl< S, kIOS< S > > | |
| CComputeRuleMeanImpl< S, OBB< S > > | |
| CComputeRuleMeanImpl< S, OBBRSS< S > > | |
| CComputeRuleMeanImpl< S, RSS< S > > | |
| CComputeRuleMedianImpl | |
| CComputeRuleMedianImpl< S, kIOS< S > > | |
| CComputeRuleMedianImpl< S, OBB< S > > | |
| CComputeRuleMedianImpl< S, OBBRSS< S > > | |
| CComputeRuleMedianImpl< S, RSS< S > > | |
| CComputeSplitVectorImpl | |
| CComputeSplitVectorImpl< S, kIOS< S > > | |
| CComputeSplitVectorImpl< S, OBBRSS< S > > | |
| CConservativeAdvancementFunctionMatrix | |
| CConservativeAdvancementImpl | |
| CConservativeAdvancementImpl< S, BVHModel< OBBRSS< S > >, NarrowPhaseSolver > | |
| CConservativeAdvancementImpl< S, BVHModel< RSS< S > >, NarrowPhaseSolver > | |
| CConservativeAdvancementStackData | |
| CConvertBVImpl | Convert a bounding volume of type BV1 in configuration tf1 to a bounding volume of type BV2 in I configuration |
| CConvertBVImpl< S, AABB< S >, AABB< S > > | Convert from AABB to AABB, not very tight but is fast |
| CConvertBVImpl< S, AABB< S >, OBB< S > > | |
| CConvertBVImpl< S, AABB< S >, RSS< S > > | |
| CConvertBVImpl< S, BV1, AABB< S > > | |
| CConvertBVImpl< S, BV1, OBB< S > > | |
| CConvertBVImpl< S, OBB< S >, OBB< S > > | |
| CConvertBVImpl< S, OBB< S >, RSS< S > > | |
| CConvertBVImpl< S, OBBRSS< S >, OBB< S > > | |
| CConvertBVImpl< S, OBBRSS< S >, RSS< S > > | |
| CConvertBVImpl< S, RSS< S >, OBB< S > > | |
| CConvertBVImpl< S, RSS< S >, RSS< S > > | |
| CdataDoubleVal | |
| CdataIntVal | |
| CDistanceFunctionMatrix | Distance matrix stores the functions for distance between different types of objects and provides a uniform call interface |
| CDistanceTraversalNodeBase | Node structure encoding the information required for distance traversal |
| ►CEPA | Class for EPA algorithm |
| CSimplexF | |
| CSimplexHorizon | |
| CSimplexList | |
| CEquilateralTetrahedron | |
| CExtractClosestPoint | |
| CFailedAtThisConfiguration | |
| CFitImpl | |
| CFitImpl< S, kIOS< S > > | |
| CFitImpl< S, OBB< S > > | |
| CFitImpl< S, OBBRSS< S > > | |
| CFitImpl< S, RSS< S > > | |
| CFitter | |
| CFitter< S, kIOS< S > > | |
| CFitter< S, OBB< S > > | |
| CFitter< S, OBBRSS< S > > | |
| CFitter< S, RSS< S > > | |
| CGetBVAxisImpl | For OBB and RSS, there is local coordinate of BV, so normal need to be transformed |
| CGetBVAxisImpl< S, OBBRSS< S > > | |
| ►CGJK | Class for GJK algorithm |
| CSimplex | |
| CSimplexV | |
| CGJKInitializer | Initialize GJK stuffs |
| CGJKInitializer< S, Box< S > > | Initialize GJK Box |
| CGJKInitializer< S, Capsule< S > > | Initialize GJK Capsule |
| CGJKInitializer< S, Cone< S > > | Initialize GJK Cone |
| CGJKInitializer< S, Convex< S > > | Initialize GJK Convex |
| CGJKInitializer< S, Cylinder< S > > | Initialize GJK Cylinder |
| CGJKInitializer< S, Ellipsoid< S > > | Initialize GJK Ellipsoid |
| CGJKInitializer< S, Sphere< S > > | Initialize GJK Sphere |
| CGJKSolver_indep | Collision and distance solver based on GJK algorithm implemented in fcl (rewritten the code from the GJK in bullet) |
| CGJKSolver_libccd | Collision and distance solver based on libccd library |
| CHexagram | |
| ►CHierarchyTree | Class for hierarchy tree structure |
| CSortByMorton | |
| CIntersect | CCD intersect kernel among primitives |
| CIntervalTree | Interval tree |
| CIntervalTreeNode | The node for interval tree |
| Cit_recursion_node | Class describes the information needed when we take the right branch in searching for intervals but possibly come back and check the left branch as well |
| CMeshCollisionTraversalNode | Traversal node for collision between two meshes |
| CMeshCollisionTraversalNodekIOS | |
| CMeshCollisionTraversalNodeOBB | Traversal node for collision between two meshes if their underlying BVH node is oriented node (OBB, RSS, OBBRSS, kIOS) |
| CMeshCollisionTraversalNodeOBBRSS | |
| CMeshCollisionTraversalNodeRSS | |
| CMeshConservativeAdvancementTraversalNode | Continuous collision node using conservative advancement. when using this default version, must refit the BVH in current configuration (R_t, T_t) into default configuration |
| CMeshConservativeAdvancementTraversalNodeOBBRSS | |
| CMeshConservativeAdvancementTraversalNodeRSS | |
| CMeshContinuousCollisionTraversalNode | Traversal node for continuous collision between meshes |
| CMeshDistanceTraversalNode | Traversal node for distance computation between two meshes |
| CMeshDistanceTraversalNodekIOS | |
| CMeshDistanceTraversalNodeOBBRSS | |
| CMeshDistanceTraversalNodeRSS | Traversal node for distance computation between two meshes if their underlying BVH node is oriented node (RSS, OBBRSS, kIOS) |
| CMeshOcTreeCollisionTraversalNode | Traversal node for mesh-octree collision |
| CMeshOcTreeDistanceTraversalNode | Traversal node for mesh-octree distance |
| CMeshShapeCollisionTraversalNode | Traversal node for collision between mesh and shape |
| CMeshShapeCollisionTraversalNodekIOS | |
| CMeshShapeCollisionTraversalNodeOBB | Traversal node for mesh and shape, when mesh BVH is one of the oriented node (OBB, RSS, OBBRSS, kIOS) |
| CMeshShapeCollisionTraversalNodeOBBRSS | |
| CMeshShapeCollisionTraversalNodeRSS | |
| CMeshShapeConservativeAdvancementTraversalNode | Traversal node for conservative advancement computation between BVH and shape |
| CMeshShapeConservativeAdvancementTraversalNodeOBBRSS | |
| CMeshShapeConservativeAdvancementTraversalNodeRSS | |
| CMeshShapeDistanceTraversalNode | Traversal node for distance between mesh and shape |
| CMeshShapeDistanceTraversalNodekIOS | |
| CMeshShapeDistanceTraversalNodeOBBRSS | |
| CMeshShapeDistanceTraversalNodeRSS | Traversal node for distance between mesh and shape, when mesh BVH is one of the oriented node (RSS, OBBRSS, kIOS) |
| CMinkowskiDiff | Minkowski difference class of two shapes |
| CNodeBase | Dynamic AABB tree node |
| COcTreeCollisionTraversalNode | Traversal node for octree collision |
| COcTreeDistanceTraversalNode | Traversal node for octree distance |
| COcTreeMeshCollisionTraversalNode | Traversal node for octree-mesh collision |
| COcTreeMeshDistanceTraversalNode | Traversal node for octree-mesh distance |
| COcTreeShapeCollisionTraversalNode | Traversal node for octree-shape collision |
| COcTreeShapeDistanceTraversalNode | Traversal node for octree-shape distance |
| COcTreeSolver | Algorithms for collision related with octree |
| CPolySolver | A class solves polynomial degree (1,2,3) equations |
| CPolytope | |
| ►CProfiler | 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 |
| CAvgInfo | Information maintained about averaged values |
| CPerThread | Information to be maintained for each thread |
| CTimeInfo | Information about time spent in a section of the code |
| ►CProject | Project functions |
| CProjectResult | |
| CScalarRepr | |
| CScalarRepr< double > | |
| CScalarRepr< float > | |
| CScalarTrait | |
| CScalarTrait< double > | |
| CScalarTrait< float > | |
| CScalarTrait< long double > | |
| CSeed | |
| CSelectImpl | |
| CSelectImpl< S, AABB< S > > | |
| CSetImpl | |
| CSetImpl< S, kIOS< S > > | |
| CSetImpl< S, OBB< S > > | |
| CSetImpl< S, OBBRSS< S > > | |
| CSetImpl< S, RSS< S > > | |
| CShapeBVHCollisionTraversalNode | Traversal node for collision between shape and BVH |
| CShapeBVHDistanceTraversalNode | Traversal node for distance computation between shape and BVH |
| CShapeCollisionTraversalNode | Traversal node for collision between two shapes |
| CShapeConservativeAdvancementTraversalNode | |
| CShapeDistanceIndepImpl | |
| CShapeDistanceIndepImpl< S, Box< S >, Sphere< S > > | |
| CShapeDistanceIndepImpl< S, Capsule< S >, Capsule< S > > | |
| CShapeDistanceIndepImpl< S, Capsule< S >, Sphere< S > > | |
| CShapeDistanceIndepImpl< S, Cylinder< S >, Sphere< S > > | |
| CShapeDistanceIndepImpl< S, Sphere< S >, Box< S > > | |
| CShapeDistanceIndepImpl< S, Sphere< S >, Capsule< S > > | |
| CShapeDistanceIndepImpl< S, Sphere< S >, Cylinder< S > > | |
| CShapeDistanceIndepImpl< S, Sphere< S >, Sphere< S > > | |
| CShapeDistanceLibccdImpl | |
| CShapeDistanceLibccdImpl< S, Box< S >, Sphere< S > > | |
| CShapeDistanceLibccdImpl< S, Capsule< S >, Capsule< S > > | |
| CShapeDistanceLibccdImpl< S, Capsule< S >, Sphere< S > > | |
| CShapeDistanceLibccdImpl< S, Cylinder< S >, Sphere< S > > | |
| CShapeDistanceLibccdImpl< S, Sphere< S >, Box< S > > | |
| CShapeDistanceLibccdImpl< S, Sphere< S >, Capsule< S > > | |
| CShapeDistanceLibccdImpl< S, Sphere< S >, Cylinder< S > > | |
| CShapeDistanceLibccdImpl< S, Sphere< S >, Sphere< S > > | |
| CShapeDistanceTraversalNode | Traversal node for distance between two shapes |
| CShapeIntersectIndepImpl | |
| CShapeIntersectIndepImpl< S, Halfspace< S >, Halfspace< S > > | |
| CShapeIntersectIndepImpl< S, Halfspace< S >, Plane< S > > | |
| CShapeIntersectIndepImpl< S, Plane< S >, Halfspace< S > > | |
| CShapeIntersectIndepImpl< S, Plane< S >, Plane< S > > | |
| CShapeIntersectLibccdImpl | |
| CShapeIntersectLibccdImpl< S, Halfspace< S >, Halfspace< S > > | |
| CShapeIntersectLibccdImpl< S, Halfspace< S >, Plane< S > > | |
| CShapeIntersectLibccdImpl< S, Plane< S >, Halfspace< S > > | |
| CShapeIntersectLibccdImpl< S, Plane< S >, Plane< S > > | |
| CShapeMeshCollisionTraversalNode | Traversal node for collision between shape and mesh |
| CShapeMeshCollisionTraversalNodekIOS | |
| CShapeMeshCollisionTraversalNodeOBB | Traversal node for shape and mesh, when mesh BVH is one of the oriented node (OBB, RSS, OBBRSS, kIOS) |
| CShapeMeshCollisionTraversalNodeOBBRSS | |
| CShapeMeshCollisionTraversalNodeRSS | |
| CShapeMeshConservativeAdvancementTraversalNode | |
| CShapeMeshConservativeAdvancementTraversalNodeOBBRSS | |
| CShapeMeshConservativeAdvancementTraversalNodeRSS | |
| CShapeMeshDistanceTraversalNode | Traversal node for distance between shape and mesh |
| CShapeMeshDistanceTraversalNodekIOS | |
| CShapeMeshDistanceTraversalNodeOBBRSS | |
| CShapeMeshDistanceTraversalNodeRSS | |
| CShapeOcTreeCollisionTraversalNode | Traversal node for shape-octree collision |
| CShapeOcTreeDistanceTraversalNode | Traversal node for shape-octree distance |
| CShapeSignedDistanceLibccdImpl | |
| CShapeTransformedTriangleDistanceIndepImpl | |
| CShapeTransformedTriangleDistanceIndepImpl< S, Sphere< S > > | |
| CShapeTransformedTriangleDistanceLibccdImpl | |
| CShapeTransformedTriangleDistanceLibccdImpl< S, Sphere< S > > | |
| CShapeTransformedTriangleIntersectIndepImpl | |
| CShapeTransformedTriangleIntersectIndepImpl< S, Halfspace< S > > | |
| CShapeTransformedTriangleIntersectIndepImpl< S, Plane< S > > | |
| CShapeTransformedTriangleIntersectIndepImpl< S, Sphere< S > > | |
| CShapeTransformedTriangleIntersectLibccdImpl | |
| CShapeTransformedTriangleIntersectLibccdImpl< S, Halfspace< S > > | |
| CShapeTransformedTriangleIntersectLibccdImpl< S, Plane< S > > | |
| CShapeTransformedTriangleIntersectLibccdImpl< S, Sphere< S > > | |
| CShapeTriangleDistanceIndepImpl | |
| CShapeTriangleDistanceIndepImpl< S, Sphere< S > > | |
| CShapeTriangleDistanceLibccdImpl | |
| CShapeTriangleDistanceLibccdImpl< S, Sphere< S > > | |
| CShapeTriangleIntersectIndepImpl | |
| CShapeTriangleIntersectIndepImpl< S, Sphere< S > > | |
| CShapeTriangleIntersectLibccdImpl | |
| CShapeTriangleIntersectLibccdImpl< S, Sphere< S > > | |
| CSimpleHashTable | A simple hash table implemented as multiple buckets. HashFnc is any extended hash function: HashFnc(key) = {index1, index2, ..., } |
| CSimpleInterval | Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_ by Cormen, Leisserson, and Rivest |
| CSortDoubleByValue | |
| CSortIntByValue | |
| CSparseHashTable | A hash table implemented using unordered_map |
| CSpatialHash | Spatial hash function: hash an AABB to a set of integer values |
| CSphereSpecification | |
| CTetrahedron | |
| CTraversalNodeBase | Node structure encoding the information required for traversal |
| CTriangleDistance | Triangle distance functions |
| Cunordered_map_hash_table | |
| CUpdateImpl | |
| ►Ntest | |
| CDistanceRes | Structure for minimum distance between two meshes and the corresponding nearest point pair |
| CTimer | |
| CTStruct | |
| CAABB | A class describing the AABB collision structure, which is a box in 3D space determined by two diagonal points |
| ►Caligned_allocator_cpp11 | Aligned allocator that is compatible with c++11 |
| Crebind | |
| CBox | Center at zero point, axis aligned box |
| CBroadPhaseCollisionManager | 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 |
| CBroadPhaseContinuousCollisionManager | Base class for broad phase continuous collision. It helps to accelerate the continuous collision/distance between N objects. Also support self collision, self distance and collision/distance with another M objects |
| CBVHModel | A class describing the bounding hierarchy of a mesh model or a point cloud model (which is viewed as a degraded version of mesh) |
| CBVMotionBoundVisitor | Compute the motion bound for a bounding volume, given the closest direction n between two query objects |
| CBVNode | 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 |
| CBVNodeBase | BVNodeBase encodes the tree structure for BVH |
| CCapsule | Center at zero point capsule |
| CCollisionGeometry | The geometry for the object for collision or distance computation |
| CCollisionObject | Object for collision or distance computation, contains the geometry and the transform information |
| CCollisionRequest | Parameters for performing collision request |
| CCollisionResult | Collision result |
| CCone | Center at zero cone |
| Cconstants | |
| CContact | Contact information returned by collision |
| CContactPoint | Minimal contact information returned by collision |
| CContinuousCollisionObject | Object for continuous collision or distance computation, contains the geometry and the motion information |
| CContinuousCollisionRequest | |
| CContinuousCollisionResult | Continuous collision result |
| CConvex | A convex polytope |
| CConvexTester | |
| CCostSource | Cost source describes an area with a cost. The area is described by an AABB region |
| CCylinder | Center at zero cylinder |
| CDefaultCollisionData | Collision data for use with the DefaultCollisionFunction. It stores the collision request and the result given by collision algorithm (and stores the conclusion of whether further evaluation of the broadphase collision manager has been deemed unnecessary) |
| CDefaultContinuousCollisionData | Collision data for use with the DefaultContinuousCollisionFunction. It stores the collision request and the result given by the collision algorithm (and stores the conclusion of whether further evaluation of the broadphase collision manager has been deemed unnecessary) |
| CDefaultDistanceData | Distance data for use with the DefaultDistanceFunction. It stores the distance request and the result given by distance algorithm (and stores the conclusion of whether further evaluation of the broadphase collision manager has been deemed unnecessary) |
| CDistanceRequest | Request to the distance computation |
| CDistanceResult | Distance result |
| CDummyCollisionObject | Dummy collision object with a point AABB |
| CDynamicAABBTreeCollisionManager | |
| CDynamicAABBTreeCollisionManager_Array | |
| CEllipsoid | Center at zero point ellipsoid |
| CException | |
| CGetDistancesImpl | |
| CGetDistancesImpl< S, 5 > | |
| CGetDistancesImpl< S, 6 > | |
| CGetDistancesImpl< S, 9 > | |
| CGetNodeTypeImpl | |
| CGetNodeTypeImpl< AABB< S > > | |
| CGetNodeTypeImpl< KDOP< S, 16 > > | |
| CGetNodeTypeImpl< KDOP< S, 18 > > | |
| CGetNodeTypeImpl< KDOP< S, 24 > > | |
| CGetNodeTypeImpl< kIOS< S > > | |
| CGetNodeTypeImpl< OBB< S > > | |
| CGetNodeTypeImpl< OBBRSS< S > > | |
| CGetNodeTypeImpl< RSS< S > > | |
| CGetOrientationImpl | |
| CGetOrientationImpl< S, OBB< S > > | |
| CGetOrientationImpl< S, OBBRSS< S > > | |
| CGetOrientationImpl< S, RSS< S > > | |
| CHalfspace | Half Space: this is equivalent to the Planed 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 |
| CIMatrix3 | |
| CInterpMotion | Linear interpolation motion Each Motion is assumed to have constant linear velocity and angular velocity The motion is R(t)(p - p_ref) + p_ref + T(t) Therefore, R(0) = R0, R(1) = R1 T(0) = T0 + R0 p_ref - p_ref T(1) = T1 + R1 p_ref - p_ref |
| CInterval | Interval class for [a, b] |
| CIntervalTreeCollisionManager | Collision manager based on interval tree |
| CIntervalTreeCollisionManager< S > | SAP end point |
| CIVector3 | |
| CKDOP | 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 |
| ►CkIOS | A class describing the kIOS collision structure, which is a set of spheres |
| CkIOS_Sphere | One sphere in kIOS |
| CLibSVMClassifier | |
| CMakeParentRelativeRecurseImpl | |
| CMakeParentRelativeRecurseImpl< S, OBB< S > > | |
| CMakeParentRelativeRecurseImpl< S, OBBRSS< S > > | |
| CMakeParentRelativeRecurseImpl< S, RSS< S > > | |
| CMotionBase | |
| CNaiveCollisionManager | Brute force N-body collision manager |
| COBB | Oriented bounding box class |
| COBBRSS | Class merging the OBB and RSS, can handle collision and distance simultaneously |
| CPlane | Infinite plane |
| CRNG | Random number generation. An instance of this class cannot be used by multiple threads at once (member functions are not const). However, the constructor is thread safe and different instances can be used safely in any number of threads. It is also guaranteed that all created instances will have a different random seed |
| CRSS | A class for rectangle swept sphere bounding volume |
| CSamplerBase | |
| CSamplerR | |
| CSamplerSE2 | |
| CSamplerSE2_disk | |
| CSamplerSE3Euler | |
| CSamplerSE3Euler_ball | |
| CSamplerSE3Quat | |
| CSamplerSE3Quat_ball | |
| ►CSaPCollisionManager | Rigorous SAP collision manager |
| CEndPoint | End point for an interval |
| CSaPAABB | SAP interval for one object |
| CSaPPair | A pair of objects that are not culling away and should further check collision |
| CSaPCollisionManager< S > | Functor to help unregister one object |
| CScrewMotion | |
| CShapeBase | Base class for all basic geometric shapes |
| CSortByXLow | Functor sorting objects according to the AABB lower x bound |
| CSortByYLow | Functor sorting objects according to the AABB lower y bound |
| CSortByZLow | Functor sorting objects according to the AABB lower z bound |
| CSpatialHashingCollisionManager | Spatial hashing collision mananger |
| CSphere | Center at zero point sphere |
| CSplineMotion | |
| CSSaPCollisionManager | Simple SAP collision manager |
| CTaylorModel | TaylorModel implements a third order Taylor model, i.e., a cubic approximation of a function over a time interval, with an interval remainder. All the operations on two Taylor models assume their time intervals are the same |
| CTBVMotionBoundVisitor | |
| CTBVMotionBoundVisitorVisitImpl | |
| CTBVMotionBoundVisitorVisitImpl< S, RSS< S >, InterpMotion< S > > | Compute the motion bound for a bounding volume along a given direction n according to mu < |v * n| + ||w x n||(r + max(||ci*||)) where ||ci*|| = ||R0(ci) x w||. w is the angular axis (normalized) and ci are the endpoints of the generator primitives of RSS. Notice that all bv parameters are in the local frame of the object, but n should be in the global frame (the reason is that the motion (t1, t2 and t) is in global frame) |
| CTBVMotionBoundVisitorVisitImpl< S, RSS< S >, ScrewMotion< S > > | Compute the motion bound for a bounding volume along a given direction n according to mu < |v * n| + ||w x n||(r + max(||ci*||)) where ||ci*|| = ||R0(ci) x w||. w is the angular axis (normalized) and ci are the endpoints of the generator primitives of RSS. Notice that all bv parameters are in the local frame of the object, but n should be in the global frame (the reason is that the motion (t1, t2 and t) is in global frame) |
| CTBVMotionBoundVisitorVisitImpl< S, RSS< S >, SplineMotion< S > > | |
| CTBVMotionBoundVisitorVisitImpl< S, RSS< S >, TranslationMotion< S > > | Compute the motion bound for a bounding volume along a given direction n |
| CTimeInterval | |
| CTMatrix3 | |
| CTranslationMotion | |
| CTriangle | Triangle with 3 indices for points |
| CTriangleMotionBoundVisitor | |
| CTriangleMotionBoundVisitorVisitImpl | |
| CTriangleMotionBoundVisitorVisitImpl< S, InterpMotion< S > > | Compute the motion bound for a triangle along a given direction n according to mu < |v * n| + ||w x n||(max||ci*||) where ||ci*|| = ||R0(ci) x w|| / |w|. w is the angular velocity and ci are the triangle vertex coordinates. Notice that the triangle is in the local frame of the object, but n should be in the global frame (the reason is that the motion (t1, t2 and t) is in global frame) |
| CTriangleMotionBoundVisitorVisitImpl< S, ScrewMotion< S > > | Compute the motion bound for a triangle along a given direction n according to mu < |v * n| + ||w x n||(max||ci*||) where ||ci*|| = ||R0(ci) x w|| / |w|. w is the angular velocity and ci are the triangle vertex coordinates. Notice that the triangle is in the local frame of the object, but n should be in the global frame (the reason is that the motion (t1, t2 and t) is in global frame) |
| CTriangleMotionBoundVisitorVisitImpl< S, SplineMotion< S > > | |
| CTriangleMotionBoundVisitorVisitImpl< S, TranslationMotion< S > > | Compute the motion bound for a triangle along a given direction n |
| CTriangleP | Triangle stores the points instead of only indices of points |
| CTVector3 | |
| CVariance3 | Class for variance matrix in 3d |
| C_ccd_list_t | |
| C_ccd_pt_edge_t | |
| C_ccd_pt_el_t | |
| C_ccd_pt_face_t | |
| C_ccd_pt_t | |
| C_ccd_pt_vertex_t | |
| C_ccd_simplex_t | |
| C_ccd_support_t | |
| CBoxBoxTest | |
| CBoxSpecification | |
| ►CCache | |
| Chead_t | |
| CCapsuleCapsuleSegmentTest | |
| CCollisionDataForUniquenessChecking | |
| Cdecision_function | |
| CKernel | |
| CONE_CLASS_Q | |
| CQMatrix | |
| CSegmentSegmentNearestPtTest | |
| ►CSolver | |
| CSolutionInfo | |
| CSolver_NU | |
| CSphereSpecification | |
| CSphereSphereDistance | |
| CSVC_Q | |
| Csvm_model | |
| Csvm_node | |
| Csvm_parameter | |
| Csvm_problem | |
| CSVR_Q | |