hpp-fcl: include/hpp/fcl/internal/traversal_recurse.h Source File

hpp-fcl 1.7.5 HPP fork of FCL -- The Flexible Collision Library

traversal_recurse.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_RECURSE_H
39 #define HPP_FCL_TRAVERSAL_RECURSE_H
40
42
43 #include <hpp/fcl/BVH/BVH_front.h>
44 #include <queue>
45 #include <hpp/fcl/internal/traversal_node_base.h>
46 #include <hpp/fcl/internal/traversal_node_bvhs.h>
47
48 namespace hpp
49 {
50 namespace fcl
51 {
52
57 void collisionRecurse(CollisionTraversalNodeBase* node, int b1, int b2,
58 BVHFrontList* front_list, FCL_REAL& sqrDistLowerBound);
59
60 void collisionNonRecurse(CollisionTraversalNodeBase* node,
61 BVHFrontList* front_list, FCL_REAL& sqrDistLowerBound);
62
64 void distanceRecurse(DistanceTraversalNodeBase* node, int b1, int b2, BVHFrontList* front_list);
65
67 void distanceQueueRecurse(DistanceTraversalNodeBase* node, int b1, int b2, BVHFrontList* front_list, int qsize);
68
70 void propagateBVHFrontListCollisionRecurse
71 (CollisionTraversalNodeBase* node, const CollisionRequest& request,
72 CollisionResult& result, BVHFrontList* front_list);
73
74 }
75
76 } // namespace hpp
77
79
80 #endif
BVH_front.h
hpp::fcl::BVHFrontList
std::list< BVHFrontNode > BVHFrontList
BVH front list is a list of front nodes.
Definition: BVH_front.h:71
hpp::fcl::FCL_REAL
double FCL_REAL
Definition: data_types.h:66
hpp
Main namespace.
Definition: AABB.h:44
traversal_node_base.h
traversal_node_bvhs.h