Structure for containing Boxes. More...
#include <btGImpactQuantizedBvh.h>
Public Member Functions | |
| btGImpactQuantizedBvh (btPrimitiveManagerBase *primitive_manager) | |
| this constructor doesn't build the tree. you must call buildSet | |
| btGImpactQuantizedBvh () | |
| this constructor doesn't build the tree. you must call buildSet | |
| SIMD_FORCE_INLINE btAABB | getGlobalBox () const |
| SIMD_FORCE_INLINE btPrimitiveManagerBase * | getPrimitiveManager () const |
| SIMD_FORCE_INLINE void | setPrimitiveManager (btPrimitiveManagerBase *primitive_manager) |
Protected Member Functions | |
| void | refit () |
Protected Attributes | |
| btQuantizedBvhTree | m_box_tree |
| btPrimitiveManagerBase * | m_primitive_manager |
|
| |
| bool | boxQuery (const btAABB &box, btAlignedObjectArray< int > &collided_results) const |
| returns the indices of the primitives in the m_primitive_manager | |
| SIMD_FORCE_INLINE bool | boxQueryTrans (const btAABB &box, const btTransform &transform, btAlignedObjectArray< int > &collided_results) const |
| returns the indices of the primitives in the m_primitive_manager | |
| void | buildSet () |
| this rebuild the entire set | |
| SIMD_FORCE_INLINE const BT_QUANTIZED_BVH_NODE * | get_node_pointer (int index=0) const |
| SIMD_FORCE_INLINE int | getEscapeNodeIndex (int nodeindex) const |
| SIMD_FORCE_INLINE int | getLeftNode (int nodeindex) const |
| SIMD_FORCE_INLINE void | getNodeBound (int nodeindex, btAABB &bound) const |
| SIMD_FORCE_INLINE int | getNodeCount () const |
| node count | |
| SIMD_FORCE_INLINE int | getNodeData (int nodeindex) const |
| SIMD_FORCE_INLINE void | getNodeTriangle (int nodeindex, btPrimitiveTriangle &triangle) const |
| SIMD_FORCE_INLINE int | getRightNode (int nodeindex) const |
| SIMD_FORCE_INLINE bool | hasHierarchy () const |
| tells if this set has hierarcht | |
| SIMD_FORCE_INLINE bool | isLeafNode (int nodeindex) const |
| tells if the node is a leaf | |
| SIMD_FORCE_INLINE bool | isTrimesh () const |
| tells if this set is a trimesh | |
| 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 | |
| SIMD_FORCE_INLINE void | setNodeBound (int nodeindex, const btAABB &bound) |
| SIMD_FORCE_INLINE void | update () |
| this attemps to refit the box set. | |
| static void | find_collision (btGImpactQuantizedBvh *boxset1, const btTransform &trans1, btGImpactQuantizedBvh *boxset2, const btTransform &trans2, btPairSet &collision_pairs) |
| static float | getAverageTreeCollisionTime () |
Structure for containing Boxes.
This class offers an structure for managing a box tree of primitives. Requires a Primitive prototype (like btPrimitiveManagerBase )
Definition at line 226 of file btGImpactQuantizedBvh.h.
| btGImpactQuantizedBvh::btGImpactQuantizedBvh | ( | ) | [inline] |
this constructor doesn't build the tree. you must call buildSet
Definition at line 238 of file btGImpactQuantizedBvh.h.
| btGImpactQuantizedBvh::btGImpactQuantizedBvh | ( | btPrimitiveManagerBase * | primitive_manager | ) | [inline] |
this constructor doesn't build the tree. you must call buildSet
Definition at line 244 of file btGImpactQuantizedBvh.h.
| bool btGImpactQuantizedBvh::boxQuery | ( | const btAABB & | box, | |
| btAlignedObjectArray< int > & | collided_results | |||
| ) | const |
returns the indices of the primitives in the m_primitive_manager
| SIMD_FORCE_INLINE bool btGImpactQuantizedBvh::boxQueryTrans | ( | const btAABB & | box, | |
| const btTransform & | transform, | |||
| btAlignedObjectArray< int > & | collided_results | |||
| ) | const [inline] |
returns the indices of the primitives in the m_primitive_manager
Definition at line 283 of file btGImpactQuantizedBvh.h.
| void btGImpactQuantizedBvh::buildSet | ( | ) |
this rebuild the entire set
| static void btGImpactQuantizedBvh::find_collision | ( | btGImpactQuantizedBvh * | boxset1, | |
| const btTransform & | trans1, | |||
| btGImpactQuantizedBvh * | boxset2, | |||
| const btTransform & | trans2, | |||
| btPairSet & | collision_pairs | |||
| ) | [static] |
| SIMD_FORCE_INLINE const BT_QUANTIZED_BVH_NODE* btGImpactQuantizedBvh::get_node_pointer | ( | int | index = 0 |
) | const [inline] |
Definition at line 357 of file btGImpactQuantizedBvh.h.
| static float btGImpactQuantizedBvh::getAverageTreeCollisionTime | ( | ) | [static] |
| SIMD_FORCE_INLINE int btGImpactQuantizedBvh::getEscapeNodeIndex | ( | int | nodeindex | ) | const [inline] |
Definition at line 346 of file btGImpactQuantizedBvh.h.
| SIMD_FORCE_INLINE btAABB btGImpactQuantizedBvh::getGlobalBox | ( | ) | const [inline] |
Definition at line 249 of file btGImpactQuantizedBvh.h.
| SIMD_FORCE_INLINE int btGImpactQuantizedBvh::getLeftNode | ( | int | nodeindex | ) | const [inline] |
Definition at line 336 of file btGImpactQuantizedBvh.h.
| SIMD_FORCE_INLINE void btGImpactQuantizedBvh::getNodeBound | ( | int | nodeindex, | |
| btAABB & | bound | |||
| ) | const [inline] |
Definition at line 325 of file btGImpactQuantizedBvh.h.
| SIMD_FORCE_INLINE int btGImpactQuantizedBvh::getNodeCount | ( | ) | const [inline] |
node count
Definition at line 309 of file btGImpactQuantizedBvh.h.
| SIMD_FORCE_INLINE int btGImpactQuantizedBvh::getNodeData | ( | int | nodeindex | ) | const [inline] |
Definition at line 320 of file btGImpactQuantizedBvh.h.
| SIMD_FORCE_INLINE void btGImpactQuantizedBvh::getNodeTriangle | ( | int | nodeindex, | |
| btPrimitiveTriangle & | triangle | |||
| ) | const [inline] |
Definition at line 351 of file btGImpactQuantizedBvh.h.
| SIMD_FORCE_INLINE btPrimitiveManagerBase* btGImpactQuantizedBvh::getPrimitiveManager | ( | ) | const [inline] |
Definition at line 261 of file btGImpactQuantizedBvh.h.
| SIMD_FORCE_INLINE int btGImpactQuantizedBvh::getRightNode | ( | int | nodeindex | ) | const [inline] |
Definition at line 341 of file btGImpactQuantizedBvh.h.
| SIMD_FORCE_INLINE bool btGImpactQuantizedBvh::hasHierarchy | ( | ) | const [inline] |
tells if this set has hierarcht
Definition at line 297 of file btGImpactQuantizedBvh.h.
| SIMD_FORCE_INLINE bool btGImpactQuantizedBvh::isLeafNode | ( | int | nodeindex | ) | const [inline] |
tells if the node is a leaf
Definition at line 315 of file btGImpactQuantizedBvh.h.
| SIMD_FORCE_INLINE bool btGImpactQuantizedBvh::isTrimesh | ( | ) | const [inline] |
tells if this set is a trimesh
Definition at line 303 of file btGImpactQuantizedBvh.h.
| bool btGImpactQuantizedBvh::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
| void btGImpactQuantizedBvh::refit | ( | ) | [protected] |
| SIMD_FORCE_INLINE void btGImpactQuantizedBvh::setNodeBound | ( | int | nodeindex, | |
| const btAABB & | bound | |||
| ) | [inline] |
Definition at line 330 of file btGImpactQuantizedBvh.h.
| SIMD_FORCE_INLINE void btGImpactQuantizedBvh::setPrimitiveManager | ( | btPrimitiveManagerBase * | primitive_manager | ) | [inline] |
Definition at line 256 of file btGImpactQuantizedBvh.h.
| SIMD_FORCE_INLINE void btGImpactQuantizedBvh::update | ( | ) | [inline] |
this attemps to refit the box set.
node manager prototype functions
Definition at line 271 of file btGImpactQuantizedBvh.h.
btQuantizedBvhTree btGImpactQuantizedBvh::m_box_tree [protected] |
Definition at line 229 of file btGImpactQuantizedBvh.h.
Definition at line 230 of file btGImpactQuantizedBvh.h.
