Go to the documentation of this file.
38 #ifndef FCL_TRAVERSAL_OCTREE_MESHOCTREEDISTANCETRAVERSALNODE_INL_H
39 #define FCL_TRAVERSAL_OCTREE_MESHOCTREEDISTANCETRAVERSALNODE_INL_H
50 template <
typename BV,
typename NarrowPhaseSolver>
61 template <
typename BV,
typename NarrowPhaseSolver>
69 template <
typename BV,
typename NarrowPhaseSolver>
73 otsolver->OcTreeMeshDistance(
74 model2, model1, this->tf2, this->tf1, this->request, *this->result);
78 template <
typename BV,
typename NarrowPhaseSolver>
83 const OcTree<typename BV::S>& model2,
request to the distance computation
Algorithms for collision related with octree.
Eigen::Transform< S, 3, Eigen::Isometry > Transform3
const BVHModel< BV > * model1
Traversal node for mesh-octree distance.
DistanceRequest< BV::S > request
request setting for distance
Transform3< BV::S > tf1
configuation of first object
DistanceResult< BV::S > * result
distance result kept during the traversal iteration
void leafTesting(int, int) const
Leaf test between node b1 and b2, if they are both leafs.
MeshOcTreeDistanceTraversalNode()
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)
const OcTree< S > * model2
A class describing the bounding hierarchy of a mesh model or a point cloud model (which is viewed as ...
S BVTesting(int, int) const
BV test between b1 and b2.
Transform3< BV::S > tf2
configuration of second object
const OcTreeSolver< NarrowPhaseSolver > * otsolver
fcl
Author(s):
autogenerated on Tue Dec 5 2023 03:40:48