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>
47 
48 namespace hpp {
49 namespace fcl {
50 
55 void collisionRecurse(CollisionTraversalNodeBase* node, unsigned int b1,
56  unsigned int b2, BVHFrontList* front_list,
57  FCL_REAL& sqrDistLowerBound);
58 
59 void collisionNonRecurse(CollisionTraversalNodeBase* node,
60  BVHFrontList* front_list, FCL_REAL& sqrDistLowerBound);
61 
63 void distanceRecurse(DistanceTraversalNodeBase* node, unsigned int b1,
64  unsigned int b2, BVHFrontList* front_list);
65 
67 void distanceQueueRecurse(DistanceTraversalNodeBase* node, unsigned int b1,
68  unsigned int b2, BVHFrontList* front_list,
69  unsigned int qsize);
70 
72 void propagateBVHFrontListCollisionRecurse(CollisionTraversalNodeBase* node,
73  const CollisionRequest& request,
74  CollisionResult& result,
75  BVHFrontList* front_list);
76 
77 } // namespace fcl
78 
79 } // namespace hpp
80 
82 
83 #endif
Main namespace.
void distanceQueueRecurse(DistanceTraversalNodeBase *node, unsigned int b1, unsigned int b2, BVHFrontList *front_list, unsigned int qsize)
void distanceRecurse(DistanceTraversalNodeBase *node, unsigned int b1, unsigned int b2, BVHFrontList *front_list)
double FCL_REAL
Definition: data_types.h:65
void collisionNonRecurse(CollisionTraversalNodeBase *node, BVHFrontList *front_list, FCL_REAL &sqrDistLowerBound)
void collisionRecurse(CollisionTraversalNodeBase *node, unsigned int b1, unsigned int b2, BVHFrontList *front_list, FCL_REAL &sqrDistLowerBound)
void propagateBVHFrontListCollisionRecurse(CollisionTraversalNodeBase *node, const CollisionRequest &, CollisionResult &result, BVHFrontList *front_list)
std::list< BVHFrontNode > BVHFrontList
BVH front list is a list of front nodes.
Definition: BVH_front.h:67


hpp-fcl
Author(s):
autogenerated on Fri Jun 2 2023 02:39:02