Go to the documentation of this file.
   38 #ifndef FCL_TRAVERSAL_MESHSHAPEDISTANCETRAVERSALNODE_H 
   39 #define FCL_TRAVERSAL_MESHSHAPEDISTANCETRAVERSALNODE_H 
   51 template <
typename BV, 
typename Shape, 
typename NarrowPhaseSolver>
 
   57   using S = 
typename BV::S;
 
   62   void leafTesting(
int b1, 
int b2) 
const;
 
   65   bool canStop(
S c) 
const;
 
   76 template <
typename BV, 
typename Shape, 
typename NarrowPhaseSolver>
 
   85     const NarrowPhaseSolver* nsolver,
 
   86     bool enable_statistics,
 
   92 template <
typename BV, 
typename Shape, 
typename NarrowPhaseSolver>
 
  101     const NarrowPhaseSolver* nsolver,
 
  107 template <
typename BV, 
typename Shape, 
typename NarrowPhaseSolver>
 
  114     const NarrowPhaseSolver* nsolver,
 
  117     bool use_refit = 
false, 
bool refit_bottomup = 
false);
 
  120 template <
typename Shape, 
typename NarrowPhaseSolver>
 
  123     RSS<typename Shape::S>, Shape, NarrowPhaseSolver>
 
  126   using S = 
typename Shape::S;
 
  134   S BVTesting(
int b1, 
int b2) 
const;
 
  136   void leafTesting(
int b1, 
int b2) 
const;
 
  139 template <
typename Shape, 
typename NarrowPhaseSolver>
 
  146     const NarrowPhaseSolver* nsolver,
 
  150 template <
typename Shape, 
typename NarrowPhaseSolver>
 
  155   using S = 
typename Shape::S;
 
  163   S BVTesting(
int b1, 
int b2) 
const;
 
  165   void leafTesting(
int b1, 
int b2) 
const;
 
  170 template <
typename Shape, 
typename NarrowPhaseSolver>
 
  175     const NarrowPhaseSolver* nsolver,
 
  179 template <
typename Shape, 
typename NarrowPhaseSolver>
 
  184   using S = 
typename Shape::S;
 
  192   S BVTesting(
int b1, 
int b2) 
const;
 
  194   void leafTesting(
int b1, 
int b2) 
const;
 
  199 template <
typename Shape, 
typename NarrowPhaseSolver>
 
  206     const NarrowPhaseSolver* nsolver,
 
  
request to the distance computation
Traversal node for distance between mesh and shape.
Eigen::Transform< S, 3, Eigen::Isometry > Transform3
A class describing the kIOS collision structure, which is a set of spheres.
const NarrowPhaseSolver * nsolver
Triangle with 3 indices for points.
Eigen::Matrix< S, 3, 1 > Vector3
void distancePreprocessOrientedNode(const BVHModel< BV > *model1, const BVHModel< BV > *model2, const Vector3< typename BV::S > *vertices1, Vector3< typename BV::S > *vertices2, Triangle *tri_indices1, Triangle *tri_indices2, int init_tri_id1, int init_tri_id2, const Matrix3< typename BV::S > &R, const Vector3< typename BV::S > &T, const DistanceRequest< typename BV::S > &request, DistanceResult< typename BV::S > &result)
void meshShapeDistanceOrientedNodeLeafTesting(int b1, int, const BVHModel< BV > *model1, const Shape &model2, Vector3< typename BV::S > *vertices, Triangle *tri_indices, const Transform3< typename BV::S > &tf1, const Transform3< typename BV::S > &tf2, const NarrowPhaseSolver *nsolver, bool enable_statistics, int &num_leaf_tests, const DistanceRequest< typename BV::S > &, DistanceResult< typename BV::S > &result)
Traversal node for distance computation between BVH and shape.
template bool initialize(MeshCollisionTraversalNodeOBB< double > &node, const BVHModel< OBB< double >> &model1, const Transform3< double > &tf1, const BVHModel< OBB< double >> &model2, const Transform3< double > &tf2, const CollisionRequest< double > &request, CollisionResult< double > &result)
A class describing the bounding hierarchy of a mesh model or a point cloud model (which is viewed as ...
typename kIOS< Shape::S > ::S S
fcl
Author(s): 
autogenerated on Fri Mar 14 2025 02:38:18