octree_collision_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_OCTREE_OCTREECOLLISIONTRAVERSALNODE_INL_H
39 #define FCL_TRAVERSAL_OCTREE_OCTREECOLLISIONTRAVERSALNODE_INL_H
40 
42 
43 namespace fcl
44 {
45 
46 namespace detail
47 {
48 
49 //==============================================================================
50 template <typename NarrowPhaseSolver>
52 {
53  model1 = nullptr;
54  model2 = nullptr;
55 
56  otsolver = nullptr;
57 }
58 
59 //==============================================================================
60 template <typename NarrowPhaseSolver>
62  int, int) const
63 {
64  return false;
65 }
66 
67 //==============================================================================
68 template <typename NarrowPhaseSolver>
70  int, int) const
71 {
72  otsolver->OcTreeIntersect(
73  model1, model2, tf1, tf2, this->request, *this->result);
74 }
75 
76 //==============================================================================
77 template <typename NarrowPhaseSolver>
80  const OcTree<typename NarrowPhaseSolver::S>& model1,
82  const OcTree<typename NarrowPhaseSolver::S>& model2,
84  const OcTreeSolver<NarrowPhaseSolver>* otsolver,
87 {
88  node.request = request;
89  node.result = &result;
90 
91  node.model1 = &model1;
92  node.model2 = &model2;
93 
94  node.otsolver = otsolver;
95 
96  node.tf1 = tf1;
97  node.tf2 = tf2;
98 
99  return true;
100 }
101 
102 } // namespace detail
103 } // namespace fcl
104 
105 #endif
const OcTreeSolver< NarrowPhaseSolver > * otsolver
Main namespace.
collision result
Eigen::Transform< S, 3, Eigen::Isometry > Transform3
Definition: types.h:91
CollisionRequest< NarrowPhaseSolver::S > request
request setting for collision
Parameters for performing collision request.
Algorithms for collision related with octree.
Definition: octree_solver.h:59
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)
void leafTesting(int, int) const
Leaf test between node b1 and b2, if they are both leafs.
CollisionResult< NarrowPhaseSolver::S > * result
collision result kept during the traversal iteration
bool BVTesting(int, int) const
BV test between b1 and b2.


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