hpp-fcl  3.0.0
HPP fork of FCL -- The Flexible Collision Library
traversal_node_shapes.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-2015, 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 HPP_FCL_TRAVERSAL_NODE_SHAPES_H
39 #define HPP_FCL_TRAVERSAL_NODE_SHAPES_H
40 
42 
43 #include "hpp/fcl/collision_data.h"
44 #include "hpp/fcl/BV/BV.h"
48 
49 namespace hpp {
50 namespace fcl {
51 
54 
56 template <typename S1, typename S2>
57 class HPP_FCL_DLLAPI ShapeCollisionTraversalNode
58  : public CollisionTraversalNodeBase {
59  public:
60  ShapeCollisionTraversalNode(const CollisionRequest& request)
61  : CollisionTraversalNodeBase(request) {
62  model1 = NULL;
63  model2 = NULL;
64 
65  nsolver = NULL;
66  }
67 
69  bool BVDisjoints(int, int, FCL_REAL&) const {
70  HPP_FCL_THROW_PRETTY("Not implemented", std::runtime_error);
71  }
72 
74  void leafCollides(int, int, FCL_REAL&) const {
75  ShapeShapeCollide<S1, S2>(this->model1, this->tf1, this->model2, this->tf2,
76  this->nsolver, this->request, *(this->result));
77  }
78 
79  const S1* model1;
80  const S2* model2;
81 
82  const GJKSolver* nsolver;
83 };
84 
86 
89 
91 template <typename S1, typename S2>
92 class HPP_FCL_DLLAPI ShapeDistanceTraversalNode
93  : public DistanceTraversalNodeBase {
94  public:
95  ShapeDistanceTraversalNode() : DistanceTraversalNodeBase() {
96  model1 = NULL;
97  model2 = NULL;
98 
99  nsolver = NULL;
100  }
101 
103  FCL_REAL BVDistanceLowerBound(unsigned int, unsigned int) const {
104  return -1; // should not be used
105  }
106 
108  void leafComputeDistance(unsigned int, unsigned int) const {
109  ShapeShapeDistance<S1, S2>(this->model1, this->tf1, this->model2, this->tf2,
110  this->nsolver, this->request, *(this->result));
111  }
112 
113  const S1* model1;
114  const S2* model2;
115 
116  const GJKSolver* nsolver;
117 };
118 
120 
121 } // namespace fcl
122 
123 } // namespace hpp
124 
126 
127 #endif
#define HPP_FCL_DLLAPI
Definition: config.hh:88
#define HPP_FCL_THROW_PRETTY(message, exception)
Definition: fwd.hh:64
double FCL_REAL
Definition: data_types.h:66
Main namespace.
Definition: broadphase_bruteforce.h:44