FCL  0.6.0
Flexible Collision Library
bvh_distance_traversal_node.h
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_BVHDISTANCETRAVERSALNODE_H
39 #define FCL_TRAVERSAL_BVHDISTANCETRAVERSALNODE_H
40 
41 #include "fcl/narrowphase/detail/traversal/traversal_node_base.h"
42 #include "fcl/narrowphase/detail/traversal/distance/distance_traversal_node_base.h"
43 #include "fcl/geometry/bvh/BVH_model.h"
44 
45 namespace fcl
46 {
47 
48 namespace detail
49 {
50 
52 template <typename BV>
54  : public DistanceTraversalNodeBase<typename BV::S>
55 {
56 public:
57 
58  using S = typename BV::S;
59 
61 
63  bool isFirstNodeLeaf(int b) const;
64 
66  bool isSecondNodeLeaf(int b) const;
67 
69  bool firstOverSecond(int b1, int b2) const;
70 
72  int getFirstLeftChild(int b) const;
73 
75  int getFirstRightChild(int b) const;
76 
78  int getSecondLeftChild(int b) const;
79 
81  int getSecondRightChild(int b) const;
82 
84  S BVTesting(int b1, int b2) const;
85 
90 
92  mutable int num_bv_tests;
93  mutable int num_leaf_tests;
94  mutable S query_time_seconds;
95 };
96 
97 } // namespace detail
98 } // namespace fcl
99 
100 #include "fcl/narrowphase/detail/traversal/distance/bvh_distance_traversal_node-inl.h"
101 
102 #endif
const BVHModel< BV > * model1
The first BVH model.
Definition: bvh_distance_traversal_node.h:87
Main namespace.
Definition: broadphase_bruteforce-inl.h:45
bool isSecondNodeLeaf(int b) const
Whether the BV node in the second BVH tree is leaf.
Definition: bvh_distance_traversal_node-inl.h:71
S BVTesting(int b1, int b2) const
BV culling test in one BVTT node.
Definition: bvh_distance_traversal_node-inl.h:121
Traversal node for distance computation between BVH models.
Definition: bvh_distance_traversal_node.h:53
int num_bv_tests
statistical information
Definition: bvh_distance_traversal_node.h:92
Node structure encoding the information required for distance traversal.
Definition: distance_traversal_node_base.h:53
bool isFirstNodeLeaf(int b) const
Whether the BV node in the first BVH tree is leaf.
Definition: bvh_distance_traversal_node-inl.h:64
int getSecondLeftChild(int b) const
Obtain the left child of BV node in the second BVH.
Definition: bvh_distance_traversal_node-inl.h:107
int getFirstLeftChild(int b) const
Obtain the left child of BV node in the first BVH.
Definition: bvh_distance_traversal_node-inl.h:93
A class describing the bounding hierarchy of a mesh model or a point cloud model (which is viewed as ...
Definition: BVH_model.h:57
const BVHModel< BV > * model2
The second BVH model.
Definition: bvh_distance_traversal_node.h:89
int getFirstRightChild(int b) const
Obtain the right child of BV node in the first BVH.
Definition: bvh_distance_traversal_node-inl.h:100
int getSecondRightChild(int b) const
Obtain the right child of BV node in the second BVH.
Definition: bvh_distance_traversal_node-inl.h:114
bool firstOverSecond(int b1, int b2) const
Determine the traversal order, is the first BVTT subtree better.
Definition: bvh_distance_traversal_node-inl.h:78