Bullet Collision Detection & Physics Library: btGImpactBvh.h Source File

Bullet Collision Detection & Physics Library

- Main Page
- Namespaces
- Classes
- Files

- File List
- File Members

btGImpactBvh.h
Go to the documentation of this file.
1#ifndef BT_GIMPACT_BVH_H_INCLUDED
2#define BT_GIMPACT_BVH_H_INCLUDED
3
7/*
8This source file is part of GIMPACT Library.
9
10For the latest info, see http://gimpact.sourceforge.net/
11
12Copyright (c) 2007 Francisco Leon Najera. C.C. 80087371.
13email: projectileman@yahoo.com
14
15
16This software is provided 'as-is', without any express or implied warranty.
17In no event will the authors be held liable for any damages arising from the use of this software.
18Permission is granted to anyone to use this software for any purpose,
19including commercial applications, and to alter it and redistribute it freely,
20subject to the following restrictions:
21
221. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
232. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
243. This notice may not be removed or altered from any source distribution.
25*/
26
27#include "LinearMath/btAlignedObjectArray.h"
28
29#include "btBoxCollision.h"
30#include "btTriangleShapeEx.h"
31#include "btGImpactBvhStructs.h"
32
34 class btPairSet : public btAlignedObjectArray<GIM_PAIR>
35{
36public:
37 btPairSet()
38 {
39 reserve(32);
40 }
41 inline void push_pair(int index1, int index2)
42 {
43 push_back(GIM_PAIR(index1, index2));
44 }
45
46 inline void push_pair_inv(int index1, int index2)
47 {
48 push_back(GIM_PAIR(index2, index1));
49 }
50};
51
52 class GIM_BVH_DATA_ARRAY : public btAlignedObjectArray<GIM_BVH_DATA>
53{
54};
55
56 class GIM_BVH_TREE_NODE_ARRAY : public btAlignedObjectArray<GIM_BVH_TREE_NODE>
57{
58};
59
61 class btBvhTree
62{
63protected:
64 int m_num_nodes;
65 GIM_BVH_TREE_NODE_ARRAY m_node_array;
66
67protected:
68 int _sort_and_calc_splitting_index(
69 GIM_BVH_DATA_ARRAY& primitive_boxes,
70 int startIndex, int endIndex, int splitAxis);
71
72 int _calc_splitting_axis(GIM_BVH_DATA_ARRAY& primitive_boxes, int startIndex, int endIndex);
73
74 void _build_sub_tree(GIM_BVH_DATA_ARRAY& primitive_boxes, int startIndex, int endIndex);
75
76public:
77 btBvhTree()
78 {
79 m_num_nodes = 0;
80 }
81
84 void build_tree(GIM_BVH_DATA_ARRAY& primitive_boxes);
85
86 SIMD_FORCE_INLINE void clearNodes()
87 {
88 m_node_array.clear();
89 m_num_nodes = 0;
90 }
91
93 SIMD_FORCE_INLINE int getNodeCount() const
94 {
95 return m_num_nodes;
96 }
97
99 SIMD_FORCE_INLINE bool isLeafNode(int nodeindex) const
100 {
101 return m_node_array[nodeindex].isLeafNode();
102 }
103
104 SIMD_FORCE_INLINE int getNodeData(int nodeindex) const
105 {
106 return m_node_array[nodeindex].getDataIndex();
107 }
108
109 SIMD_FORCE_INLINE void getNodeBound(int nodeindex, btAABB& bound) const
110 {
111 bound = m_node_array[nodeindex].m_bound;
112 }
113
114 SIMD_FORCE_INLINE void setNodeBound(int nodeindex, const btAABB& bound)
115 {
116 m_node_array[nodeindex].m_bound = bound;
117 }
118
119 SIMD_FORCE_INLINE int getLeftNode(int nodeindex) const
120 {
121 return nodeindex + 1;
122 }
123
124 SIMD_FORCE_INLINE int getRightNode(int nodeindex) const
125 {
126 if (m_node_array[nodeindex + 1].isLeafNode()) return nodeindex + 2;
127 return nodeindex + 1 + m_node_array[nodeindex + 1].getEscapeIndex();
128 }
129
130 SIMD_FORCE_INLINE int getEscapeNodeIndex(int nodeindex) const
131 {
132 return m_node_array[nodeindex].getEscapeIndex();
133 }
134
135 SIMD_FORCE_INLINE const GIM_BVH_TREE_NODE* get_node_pointer(int index = 0) const
136 {
137 return &m_node_array[index];
138 }
139
141};
142
144
149 class btPrimitiveManagerBase
150{
151public:
152 virtual ~btPrimitiveManagerBase() {}
153
155 virtual bool is_trimesh() const = 0;
156 virtual int get_primitive_count() const = 0;
157 virtual void get_primitive_box(int prim_index, btAABB& primbox) const = 0;
159 virtual void get_primitive_triangle(int prim_index, btPrimitiveTriangle& triangle) const = 0;
160};
161
163
167 class btGImpactBvh
168{
169protected:
170 btBvhTree m_box_tree;
171 btPrimitiveManagerBase* m_primitive_manager;
172
173protected:
174 //stackless refit
175 void refit();
176
177public:
179 btGImpactBvh()
180 {
181 m_primitive_manager = NULL;
182 }
183
185 btGImpactBvh(btPrimitiveManagerBase* primitive_manager)
186 {
187 m_primitive_manager = primitive_manager;
188 }
189
190 SIMD_FORCE_INLINE btAABB getGlobalBox() const
191 {
192 btAABB totalbox;
193 getNodeBound(0, totalbox);
194 return totalbox;
195 }
196
197 SIMD_FORCE_INLINE void setPrimitiveManager(btPrimitiveManagerBase* primitive_manager)
198 {
199 m_primitive_manager = primitive_manager;
200 }
201
202 SIMD_FORCE_INLINE btPrimitiveManagerBase* getPrimitiveManager() const
203 {
204 return m_primitive_manager;
205 }
206
209
211 SIMD_FORCE_INLINE void update()
212 {
213 refit();
214 }
215
217 void buildSet();
218
220 bool boxQuery(const btAABB& box, btAlignedObjectArray<int>& collided_results) const;
221
223 SIMD_FORCE_INLINE bool boxQueryTrans(const btAABB& box,
224 const btTransform& transform, btAlignedObjectArray<int>& collided_results) const
225 {
226 btAABB transbox = box;
227 transbox.appy_transform(transform);
228 return boxQuery(transbox, collided_results);
229 }
230
232 bool rayQuery(
233 const btVector3& ray_dir, const btVector3& ray_origin,
234 btAlignedObjectArray<int>& collided_results) const;
235
237 SIMD_FORCE_INLINE bool hasHierarchy() const
238 {
239 return true;
240 }
241
243 SIMD_FORCE_INLINE bool isTrimesh() const
244 {
245 return m_primitive_manager->is_trimesh();
246 }
247
249 SIMD_FORCE_INLINE int getNodeCount() const
250 {
251 return m_box_tree.getNodeCount();
252 }
253
255 SIMD_FORCE_INLINE bool isLeafNode(int nodeindex) const
256 {
257 return m_box_tree.isLeafNode(nodeindex);
258 }
259
260 SIMD_FORCE_INLINE int getNodeData(int nodeindex) const
261 {
262 return m_box_tree.getNodeData(nodeindex);
263 }
264
265 SIMD_FORCE_INLINE void getNodeBound(int nodeindex, btAABB& bound) const
266 {
267 m_box_tree.getNodeBound(nodeindex, bound);
268 }
269
270 SIMD_FORCE_INLINE void setNodeBound(int nodeindex, const btAABB& bound)
271 {
272 m_box_tree.setNodeBound(nodeindex, bound);
273 }
274
275 SIMD_FORCE_INLINE int getLeftNode(int nodeindex) const
276 {
277 return m_box_tree.getLeftNode(nodeindex);
278 }
279
280 SIMD_FORCE_INLINE int getRightNode(int nodeindex) const
281 {
282 return m_box_tree.getRightNode(nodeindex);
283 }
284
285 SIMD_FORCE_INLINE int getEscapeNodeIndex(int nodeindex) const
286 {
287 return m_box_tree.getEscapeNodeIndex(nodeindex);
288 }
289
290 SIMD_FORCE_INLINE void getNodeTriangle(int nodeindex, btPrimitiveTriangle& triangle) const
291 {
292 m_primitive_manager->get_primitive_triangle(getNodeData(nodeindex), triangle);
293 }
294
295 SIMD_FORCE_INLINE const GIM_BVH_TREE_NODE* get_node_pointer(int index = 0) const
296 {
297 return m_box_tree.get_node_pointer(index);
298 }
299
300#ifdef TRI_COLLISION_PROFILING
301 static float getAverageTreeCollisionTime();
302#endif //TRI_COLLISION_PROFILING
303
304 static void find_collision(btGImpactBvh* boxset1, const btTransform& trans1,
305 btGImpactBvh* boxset2, const btTransform& trans2,
306 btPairSet& collision_pairs);
307};
308
309#endif // BT_GIMPACT_BVH_H_INCLUDED
btAlignedObjectArray.h
btBoxCollision.h
btGImpactBvhStructs.h
SIMD_FORCE_INLINE
#define SIMD_FORCE_INLINE
Definition: btScalar.h:98
btTriangleShapeEx.h
GIM_BVH_DATA_ARRAY
Definition: btGImpactBvh.h:53
GIM_BVH_TREE_NODE_ARRAY
Definition: btGImpactBvh.h:57
GIM_BVH_TREE_NODE
Node Structure for trees.
Definition: btGImpactBvhStructs.h:42
btAABB
Axis aligned box.
Definition: btBoxCollision.h:216
btAABB::appy_transform
void appy_transform(const btTransform &trans)
Apply a transform to an AABB.
Definition: btBoxCollision.h:354
btAlignedObjectArray
The btAlignedObjectArray template class uses a subset of the stl::vector interface for its methods It...
Definition: btAlignedObjectArray.h:46
btAlignedObjectArray::clear
void clear()
clear the array, deallocated memory. Generally it is better to use array.resize(0),...
Definition: btAlignedObjectArray.h:176
btAlignedObjectArray< GIM_PAIR >::push_back
void push_back(const GIM_PAIR &_Val)
Definition: btAlignedObjectArray.h:257
btAlignedObjectArray< GIM_PAIR >::reserve
void reserve(int _Count)
Definition: btAlignedObjectArray.h:280
btBvhTree
Basic Box tree structure.
Definition: btGImpactBvh.h:62
btBvhTree::_build_sub_tree
void _build_sub_tree(GIM_BVH_DATA_ARRAY &primitive_boxes, int startIndex, int endIndex)
Definition: btGImpactBvh.cpp:153
btBvhTree::_calc_splitting_axis
int _calc_splitting_axis(GIM_BVH_DATA_ARRAY &primitive_boxes, int startIndex, int endIndex)
Definition: btGImpactBvh.cpp:65
btBvhTree::m_node_array
GIM_BVH_TREE_NODE_ARRAY m_node_array
Definition: btGImpactBvh.h:65
btBvhTree::getRightNode
int getRightNode(int nodeindex) const
Definition: btGImpactBvh.h:124
btBvhTree::getNodeBound
void getNodeBound(int nodeindex, btAABB &bound) const
Definition: btGImpactBvh.h:109
btBvhTree::m_num_nodes
int m_num_nodes
Definition: btGImpactBvh.h:64
btBvhTree::setNodeBound
void setNodeBound(int nodeindex, const btAABB &bound)
Definition: btGImpactBvh.h:114
btBvhTree::getNodeCount
int getNodeCount() const
node count
Definition: btGImpactBvh.h:93
btBvhTree::clearNodes
void clearNodes()
Definition: btGImpactBvh.h:86
btBvhTree::get_node_pointer
const GIM_BVH_TREE_NODE * get_node_pointer(int index=0) const
Definition: btGImpactBvh.h:135
btBvhTree::getNodeData
int getNodeData(int nodeindex) const
Definition: btGImpactBvh.h:104
btBvhTree::getLeftNode
int getLeftNode(int nodeindex) const
Definition: btGImpactBvh.h:119
btBvhTree::_sort_and_calc_splitting_index
int _sort_and_calc_splitting_index(GIM_BVH_DATA_ARRAY &primitive_boxes, int startIndex, int endIndex, int splitAxis)
Definition: btGImpactBvh.cpp:95
btBvhTree::isLeafNode
bool isLeafNode(int nodeindex) const
tells if the node is a leaf
Definition: btGImpactBvh.h:99
btBvhTree::build_tree
void build_tree(GIM_BVH_DATA_ARRAY &primitive_boxes)
prototype functions for box tree management
Definition: btGImpactBvh.cpp:200
btBvhTree::btBvhTree
btBvhTree()
Definition: btGImpactBvh.h:77
btBvhTree::getEscapeNodeIndex
int getEscapeNodeIndex(int nodeindex) const
Definition: btGImpactBvh.h:130
btGImpactBvh
Structure for containing Boxes.
Definition: btGImpactBvh.h:168
btGImpactBvh::buildSet
void buildSet()
this rebuild the entire set
Definition: btGImpactBvh.cpp:253
btGImpactBvh::isTrimesh
bool isTrimesh() const
tells if this set is a trimesh
Definition: btGImpactBvh.h:243
btGImpactBvh::getRightNode
int getRightNode(int nodeindex) const
Definition: btGImpactBvh.h:280
btGImpactBvh::getNodeCount
int getNodeCount() const
node count
Definition: btGImpactBvh.h:249
btGImpactBvh::getGlobalBox
btAABB getGlobalBox() const
Definition: btGImpactBvh.h:190
btGImpactBvh::isLeafNode
bool isLeafNode(int nodeindex) const
tells if the node is a leaf
Definition: btGImpactBvh.h:255
btGImpactBvh::getLeftNode
int getLeftNode(int nodeindex) const
Definition: btGImpactBvh.h:275
btGImpactBvh::boxQueryTrans
bool boxQueryTrans(const btAABB &box, const btTransform &transform, btAlignedObjectArray< int > &collided_results) const
returns the indices of the primitives in the m_primitive_manager
Definition: btGImpactBvh.h:223
btGImpactBvh::boxQuery
bool boxQuery(const btAABB &box, btAlignedObjectArray< int > &collided_results) const
returns the indices of the primitives in the m_primitive_manager
Definition: btGImpactBvh.cpp:269
btGImpactBvh::setPrimitiveManager
void setPrimitiveManager(btPrimitiveManagerBase *primitive_manager)
Definition: btGImpactBvh.h:197
btGImpactBvh::getNodeBound
void getNodeBound(int nodeindex, btAABB &bound) const
Definition: btGImpactBvh.h:265
btGImpactBvh::getEscapeNodeIndex
int getEscapeNodeIndex(int nodeindex) const
Definition: btGImpactBvh.h:285
btGImpactBvh::getNodeTriangle
void getNodeTriangle(int nodeindex, btPrimitiveTriangle &triangle) const
Definition: btGImpactBvh.h:290
btGImpactBvh::hasHierarchy
bool hasHierarchy() const
tells if this set has hierarcht
Definition: btGImpactBvh.h:237
btGImpactBvh::getPrimitiveManager
btPrimitiveManagerBase * getPrimitiveManager() const
Definition: btGImpactBvh.h:202
btGImpactBvh::get_node_pointer
const GIM_BVH_TREE_NODE * get_node_pointer(int index=0) const
Definition: btGImpactBvh.h:295
btGImpactBvh::btGImpactBvh
btGImpactBvh()
this constructor doesn't build the tree. you must call buildSet
Definition: btGImpactBvh.h:179
btGImpactBvh::getNodeData
int getNodeData(int nodeindex) const
Definition: btGImpactBvh.h:260
btGImpactBvh::rayQuery
bool rayQuery(const btVector3 &ray_dir, const btVector3 &ray_origin, btAlignedObjectArray< int > &collided_results) const
returns the indices of the primitives in the m_primitive_manager
Definition: btGImpactBvh.cpp:305
btGImpactBvh::m_box_tree
btBvhTree m_box_tree
Definition: btGImpactBvh.h:170
btGImpactBvh::m_primitive_manager
btPrimitiveManagerBase * m_primitive_manager
Definition: btGImpactBvh.h:171
btGImpactBvh::update
void update()
node manager prototype functions
Definition: btGImpactBvh.h:211
btGImpactBvh::setNodeBound
void setNodeBound(int nodeindex, const btAABB &bound)
Definition: btGImpactBvh.h:270
btGImpactBvh::find_collision
static void find_collision(btGImpactBvh *boxset1, const btTransform &trans1, btGImpactBvh *boxset2, const btTransform &trans2, btPairSet &collision_pairs)
Definition: btGImpactBvh.cpp:444
btGImpactBvh::btGImpactBvh
btGImpactBvh(btPrimitiveManagerBase *primitive_manager)
this constructor doesn't build the tree. you must call buildSet
Definition: btGImpactBvh.h:185
btGImpactBvh::refit
void refit()
Definition: btGImpactBvh.cpp:213
btPairSet
A pairset array.
Definition: btGImpactBvh.h:35
btPairSet::push_pair
void push_pair(int index1, int index2)
Definition: btGImpactBvh.h:41
btPairSet::btPairSet
btPairSet()
Definition: btGImpactBvh.h:37
btPairSet::push_pair_inv
void push_pair_inv(int index1, int index2)
Definition: btGImpactBvh.h:46
btPrimitiveManagerBase
Prototype Base class for primitive classification.
Definition: btGImpactBvh.h:150
btPrimitiveManagerBase::get_primitive_triangle
virtual void get_primitive_triangle(int prim_index, btPrimitiveTriangle &triangle) const =0
retrieves only the points of the triangle, and the collision margin
btPrimitiveManagerBase::~btPrimitiveManagerBase
virtual ~btPrimitiveManagerBase()
Definition: btGImpactBvh.h:152
btPrimitiveManagerBase::is_trimesh
virtual bool is_trimesh() const =0
determines if this manager consist on only triangles, which special case will be optimized
btPrimitiveManagerBase::get_primitive_count
virtual int get_primitive_count() const =0
btPrimitiveManagerBase::get_primitive_box
virtual void get_primitive_box(int prim_index, btAABB &primbox) const =0
btPrimitiveTriangle
Definition: btTriangleShapeEx.h:70
btTransform
The btTransform class supports rigid transforms with only translation and rotation and no scaling/she...
Definition: btTransform.h:30
btVector3
btVector3 can be used to represent 3D points and vectors.
Definition: btVector3.h:82
GIM_PAIR
Overlapping pair.
Definition: gim_pair.h:7