mesh_continuous_collision_traversal_node.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_MESHCONTINUOUSCOLLISIONTRAVERSALNODE_H
39 #define FCL_TRAVERSAL_MESHCONTINUOUSCOLLISIONTRAVERSALNODE_H
40 
42 
43 namespace fcl
44 {
45 
46 namespace detail
47 {
48 
50 template <typename S>
51 struct FCL_EXPORT BVHContinuousCollisionPair
52 {
54 
55  BVHContinuousCollisionPair(int id1_, int id2_, S time);
56 
58  int id1;
59 
61  int id2;
62 
65 };
66 
68 template <typename BV>
70  : public BVHCollisionTraversalNode<BV>
71 {
72 public:
73 
74  using S = typename BV::S;
75 
77 
79  void leafTesting(int b1, int b2) const;
80 
82  bool canStop() const;
83 
86 
89 
92 
93  mutable int num_vf_tests;
94  mutable int num_ee_tests;
95 
96  mutable std::vector<BVHContinuousCollisionPair<S>> pairs;
97 
98  mutable S time_of_contact;
99 };
100 
103 template <typename BV>
104 FCL_EXPORT
105 bool initialize(
107  const BVHModel<BV>& model1,
108  const Transform3<typename BV::S>& tf1,
109  const BVHModel<BV>& model2,
110  const Transform3<typename BV::S>& tf2,
111  const CollisionRequest<typename BV::S>& request);
112 
113 } // namespace detail
114 } // namespace fcl
115 
117 
118 #endif
Main namespace.
Traversal node for continuous collision between BVH models.
int id1
The index of one in-collision primitive.
Eigen::Transform< S, 3, Eigen::Isometry > Transform3
Definition: types.h:91
Eigen::Matrix< S, 3, 1 > Vector3
Definition: types.h:70
S collision_time
Collision time normalized in [0, 1]. The collision time out of [0, 1] means collision-free.
Triangle with 3 indices for points.
Definition: triangle.h:48
Parameters for performing collision request.
int id2
The index of the other in-collision primitive.
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)
Traversal node for continuous collision between meshes.
Traversal node for collision between BVH models.
A class describing the bounding hierarchy of a mesh model or a point cloud model (which is viewed as ...
Definition: BVH_model.h:57


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