shape_distance_traversal_node-inl.h
Go to the documentation of this file.
1 /*
2  * Software License Agreement (BSD License)
3  *
4  * Copyright (c) 2011-2014, Willow Garage, Inc.
5  * Copyright (c) 2014-2016, Open Source Robotics Foundation
6  * All rights reserved.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions
10  * are met:
11  *
12  * * Redistributions of source code must retain the above copyright
13  * notice, this list of conditions and the following disclaimer.
14  * * Redistributions in binary form must reproduce the above
15  * copyright notice, this list of conditions and the following
16  * disclaimer in the documentation and/or other materials provided
17  * with the distribution.
18  * * Neither the name of Open Source Robotics Foundation nor the names of its
19  * contributors may be used to endorse or promote products derived
20  * from this software without specific prior written permission.
21  *
22  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
23  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
24  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
25  * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
26  * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
27  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
28  * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
29  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
30  * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
32  * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
33  * POSSIBILITY OF SUCH DAMAGE.
34  */
35 
38 #ifndef FCL_TRAVERSAL_SHAPEDISTANCETRAVERSALNODE_INL_H
39 #define FCL_TRAVERSAL_SHAPEDISTANCETRAVERSALNODE_INL_H
40 
42 
43 namespace fcl
44 {
45 
46 namespace detail
47 {
48 
49 //==============================================================================
50 template <typename Shape1, typename Shape2, typename NarrowPhaseSolver>
53 {
54  model1 = nullptr;
55  model2 = nullptr;
56 
57  nsolver = nullptr;
58 }
59 
60 //==============================================================================
61 template <typename Shape1, typename Shape2, typename NarrowPhaseSolver>
62 typename Shape1::S
64 {
65  return -1; // should not be used
66 }
67 
68 //==============================================================================
69 template <typename Shape1, typename Shape2, typename NarrowPhaseSolver>
71  int, int) const
72 {
73  using S = typename Shape1::S;
74 
75  S distance;
76  // NOTE(JS): The closest points are set to zeros in order to suppress the
77  // maybe-uninitialized warning. It seems the warnings occur since
78  // NarrowPhaseSolver::shapeDistance() conditionally set the closest points.
79  // If this wasn't intentional then please remove the initialization of the
80  // closest points, and change the function NarrowPhaseSolver::shapeDistance()
81  // to always set the closest points.
82  Vector3<S> closest_p1 = Vector3<S>::Zero();
83  Vector3<S> closest_p2 = Vector3<S>::Zero();
84 
85  if (this->request.enable_signed_distance == true)
86  {
87  nsolver->shapeSignedDistance(*model1, this->tf1, *model2, this->tf2, &distance, &closest_p1, &closest_p2);
88  }
89  else
90  {
91  nsolver->shapeDistance(*model1, this->tf1, *model2, this->tf2, &distance, &closest_p1, &closest_p2);
92  }
93 
94  this->result->update(
95  distance,
96  model1,
97  model2,
100  closest_p1,
101  closest_p2);
102 }
103 
104 //==============================================================================
105 template <typename Shape1, typename Shape2, typename NarrowPhaseSolver>
108  const Shape1& shape1,
110  const Shape2& shape2,
112  const NarrowPhaseSolver* nsolver,
115 {
116  node.request = request;
117  node.result = &result;
118 
119  node.model1 = &shape1;
120  node.tf1 = tf1;
121  node.model2 = &shape2;
122  node.tf2 = tf2;
123  node.nsolver = nsolver;
124 
125  return true;
126 }
127 
128 } // namespace detail
129 } // namespace fcl
130 
131 #endif
Main namespace.
Traversal node for distance between two shapes.
void leafTesting(int, int) const
Distance testing between leaves (two shapes)
Eigen::Transform< S, 3, Eigen::Isometry > Transform3
Definition: types.h:91
distance result
Transform3< Shape1::S > tf2
configuration of second object
Eigen::Matrix< S, 3, 1 > Vector3
Definition: types.h:70
Node structure encoding the information required for distance traversal.
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)
DistanceRequest< Shape1::S > request
request setting for distance
template void distance(DistanceTraversalNodeBase< double > *node, BVHFrontList *front_list, int qsize)
DistanceResult< Shape1::S > * result
distance result kept during the traversal iteration
bool enable_signed_distance
Whether to compute exact negative distance.
Transform3< Shape1::S > tf1
configuation of first object
void update(S distance, const CollisionGeometry< S > *o1_, const CollisionGeometry< S > *o2_, int b1_, int b2_)
add distance information into the result
request to the distance computation
S BVTesting(int, int) const
BV culling test in one BVTT node.


fcl_catkin
Author(s):
autogenerated on Thu Mar 23 2023 03:00:18