The SimpleBroadphase is just a unit-test for btAxisSweep3, bt32BitAxisSweep3, or btDbvtBroadphase, so use those classes instead.
More...
#include <btSimpleBroadphase.h>
|
| btSimpleBroadphase (int maxProxies=16384, btOverlappingPairCache *overlappingPairCache=0) |
|
virtual | ~btSimpleBroadphase () |
|
virtual btBroadphaseProxy * | createProxy (const btVector3 &aabbMin, const btVector3 &aabbMax, int shapeType, void *userPtr, short int collisionFilterGroup, short int collisionFilterMask, btDispatcher *dispatcher, void *multiSapProxy) |
|
virtual void | calculateOverlappingPairs (btDispatcher *dispatcher) |
| calculateOverlappingPairs is optional: incremental algorithms (sweep and prune) might do it during the set aabb More...
|
|
virtual void | destroyProxy (btBroadphaseProxy *proxy, btDispatcher *dispatcher) |
|
virtual void | setAabb (btBroadphaseProxy *proxy, const btVector3 &aabbMin, const btVector3 &aabbMax, btDispatcher *dispatcher) |
|
virtual void | getAabb (btBroadphaseProxy *proxy, btVector3 &aabbMin, btVector3 &aabbMax) const |
|
virtual void | rayTest (const btVector3 &rayFrom, const btVector3 &rayTo, btBroadphaseRayCallback &rayCallback, const btVector3 &aabbMin=btVector3(0, 0, 0), const btVector3 &aabbMax=btVector3(0, 0, 0)) |
|
virtual void | aabbTest (const btVector3 &aabbMin, const btVector3 &aabbMax, btBroadphaseAabbCallback &callback) |
|
btOverlappingPairCache * | getOverlappingPairCache () |
|
const btOverlappingPairCache * | getOverlappingPairCache () const |
|
bool | testAabbOverlap (btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1) |
|
virtual void | getBroadphaseAabb (btVector3 &aabbMin, btVector3 &aabbMax) const |
| getAabb returns the axis aligned bounding box in the 'global' coordinate frame will add some transform later More...
|
|
virtual void | printStats () |
|
virtual | ~btBroadphaseInterface () |
|
The SimpleBroadphase is just a unit-test for btAxisSweep3, bt32BitAxisSweep3, or btDbvtBroadphase, so use those classes instead.
It is a brute force aabb culling broadphase based on O(n^2) aabb checks
Definition at line 49 of file btSimpleBroadphase.h.
btSimpleBroadphase::btSimpleBroadphase |
( |
int |
maxProxies = 16384 , |
|
|
btOverlappingPairCache * |
overlappingPairCache = 0 |
|
) |
| |
btSimpleBroadphase::~btSimpleBroadphase |
( |
| ) |
|
|
virtual |
int btSimpleBroadphase::allocHandle |
( |
| ) |
|
|
inlineprotected |
void btSimpleBroadphase::calculateOverlappingPairs |
( |
btDispatcher * |
dispatcher | ) |
|
|
virtual |
calculateOverlappingPairs is optional: incremental algorithms (sweep and prune) might do it during the set aabb
if you don't like to skip the invalid pairs in the array, execute following code:
Implements btBroadphaseInterface.
Definition at line 213 of file btSimpleBroadphase.cpp.
btBroadphaseProxy * btSimpleBroadphase::createProxy |
( |
const btVector3 & |
aabbMin, |
|
|
const btVector3 & |
aabbMax, |
|
|
int |
shapeType, |
|
|
void * |
userPtr, |
|
|
short int |
collisionFilterGroup, |
|
|
short int |
collisionFilterMask, |
|
|
btDispatcher * |
dispatcher, |
|
|
void * |
multiSapProxy |
|
) |
| |
|
virtual |
virtual void btSimpleBroadphase::getBroadphaseAabb |
( |
btVector3 & |
aabbMin, |
|
|
btVector3 & |
aabbMax |
|
) |
| const |
|
inlinevirtual |
virtual void btSimpleBroadphase::printStats |
( |
| ) |
|
|
inlinevirtual |
void btSimpleBroadphase::resetPool |
( |
btDispatcher * |
dispatcher | ) |
|
|
protectedvirtual |
void btSimpleBroadphase::validate |
( |
| ) |
|
|
protected |
int btSimpleBroadphase::m_firstFreeHandle |
|
protected |
int btSimpleBroadphase::m_invalidPair |
|
protected |
int btSimpleBroadphase::m_LastHandleIndex |
|
protected |
int btSimpleBroadphase::m_maxHandles |
|
protected |
int btSimpleBroadphase::m_numHandles |
|
protected |
bool btSimpleBroadphase::m_ownsPairCache |
|
protected |
void* btSimpleBroadphase::m_pHandlesRawPtr |
|
protected |
The documentation for this class was generated from the following files: