FCL  0.6.0
Flexible Collision Library
shape_distance_traversal_node-inl.h
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 
41 #include "fcl/narrowphase/detail/traversal/distance/shape_distance_traversal_node.h"
42 
43 namespace fcl
44 {
45 
46 namespace detail
47 {
48 
49 //==============================================================================
50 template <typename Shape1, typename Shape2, typename NarrowPhaseSolver>
51 ShapeDistanceTraversalNode<Shape1, Shape2, NarrowPhaseSolver>::
52 ShapeDistanceTraversalNode() : DistanceTraversalNodeBase<typename Shape1::S>()
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  nsolver->shapeDistance(
86  *model1, this->tf1, *model2, this->tf2, &distance, &closest_p1, &closest_p2);
87 
88  this->result->update(
89  distance,
90  model1,
91  model2,
94  closest_p1,
95  closest_p2);
96 }
97 
98 //==============================================================================
99 template <typename Shape1, typename Shape2, typename NarrowPhaseSolver>
100 bool initialize(
102  const Shape1& shape1,
103  const Transform3<typename Shape1::S>& tf1,
104  const Shape2& shape2,
105  const Transform3<typename Shape1::S>& tf2,
106  const NarrowPhaseSolver* nsolver,
109 {
110  node.request = request;
111  node.result = &result;
112 
113  node.model1 = &shape1;
114  node.tf1 = tf1;
115  node.model2 = &shape2;
116  node.tf2 = tf2;
117  node.nsolver = nsolver;
118 
119  return true;
120 }
121 
122 } // namespace detail
123 } // namespace fcl
124 
125 #endif
Main namespace.
Definition: broadphase_bruteforce-inl.h:45
Traversal node for distance between two shapes.
Definition: shape_distance_traversal_node.h:52
void leafTesting(int, int) const
Distance testing between leaves (two shapes)
Definition: shape_distance_traversal_node-inl.h:70
distance result
Definition: distance_request.h:48
void update(S distance, const CollisionGeometry< S > *o1_, const CollisionGeometry< S > *o2_, int b1_, int b2_)
add distance information into the result
Definition: distance_result-inl.h:64
Transform3< Shape1::S > tf2
configuration of second object
Definition: traversal_node_base.h:88
S BVTesting(int, int) const
BV culling test in one BVTT node.
Definition: shape_distance_traversal_node-inl.h:63
DistanceRequest< Shape1::S > request
request setting for distance
Definition: distance_traversal_node_base.h:73
DistanceResult< Shape1::S > * result
distance result kept during the traversal iteration
Definition: distance_traversal_node_base.h:76
Transform3< Shape1::S > tf1
configuation of first object
Definition: traversal_node_base.h:85
S distance(const Eigen::MatrixBase< DerivedA > &R0, const Eigen::MatrixBase< DerivedB > &T0, const kIOS< S > &b1, const kIOS< S > &b2, Vector3< S > *P, Vector3< S > *Q)
Approximate distance between two kIOS bounding volumes.
Definition: kIOS-inl.h:266
request to the distance computation
Definition: distance_request.h:52