19 #ifndef BT_AXIS_SWEEP_3_INTERNAL_H 20 #define BT_AXIS_SWEEP_3_INTERNAL_H 30 #define USE_OVERLAP_TEST_ON_REMOVES 1 35 template <
typename BP_FP_INT_TYPE>
53 BP_FP_INT_TYPE
IsMax()
const {
return static_cast<BP_FP_INT_TYPE
>(m_pos & 1);}
63 BP_FP_INT_TYPE m_minEdges[3], m_maxEdges[3];
108 bool testOverlap2D(
const Handle* pHandleA,
const Handle* pHandleB,
int axis0,
int axis1);
110 #ifdef DEBUG_BROADPHASE 111 void debugPrintAxis(
int axis,
bool checkCardinality=
true);
112 #endif //DEBUG_BROADPHASE 173 m_userPairCallback = pairCallback;
205 #ifdef DEBUG_BROADPHASE 208 template <
typename BP_FP_INT_TYPE>
212 printf(
"SAP Axis %d, numEdges=%d\n",axis,numEdges);
215 for (i=0;i<numEdges+1;i++)
218 Handle* pHandlePrev =
getHandle(pEdge->m_handle);
219 int handleIndex = pEdge->IsMax()? pHandlePrev->m_maxEdges[axis] : pHandlePrev->m_minEdges[axis];
221 beginOrEnd=pEdge->IsMax()?
'E':
'B';
222 printf(
" [%c,h=%d,p=%x,i=%d]\n",beginOrEnd,pEdge->m_handle,pEdge->m_pos,handleIndex);
225 if (checkCardinality)
228 #endif //DEBUG_BROADPHASE 230 template <
typename BP_FP_INT_TYPE>
234 BP_FP_INT_TYPE handleId =
addHandle(aabbMin,aabbMax, userPtr,collisionFilterGroup,collisionFilterMask,dispatcher);
248 template <
typename BP_FP_INT_TYPE>
257 template <
typename BP_FP_INT_TYPE>
269 template <
typename BP_FP_INT_TYPE>
278 BP_FP_INT_TYPE axis = 0;
290 template <
typename BP_FP_INT_TYPE>
299 BP_FP_INT_TYPE axis = 0;
317 template <
typename BP_FP_INT_TYPE>
326 template <
typename BP_FP_INT_TYPE>
331 unsigned short vecInMin[3];
332 unsigned short vecInMax[3];
351 template <
typename BP_FP_INT_TYPE>
361 BP_FP_INT_TYPE maxHandles =
static_cast<BP_FP_INT_TYPE
>(userMaxHandles+1);
370 if (!disableRaycastAccelerator)
399 m_pHandles[i].SetNextFree(static_cast<BP_FP_INT_TYPE>(i + 1));
405 for (
int i = 0; i < 3; i++)
417 for (
int axis = 0; axis < 3; axis++)
426 #ifdef DEBUG_BROADPHASE 427 debugPrintAxis(axis);
428 #endif //DEBUG_BROADPHASE 434 template <
typename BP_FP_INT_TYPE>
445 for (
int i = 2; i >= 0; i--)
458 template <
typename BP_FP_INT_TYPE>
461 #ifdef OLD_CLAMPING_METHOD 476 #endif //OLD_CLAMPING_METHOD 480 template <
typename BP_FP_INT_TYPE>
492 template <
typename BP_FP_INT_TYPE>
504 template <
typename BP_FP_INT_TYPE>
508 BP_FP_INT_TYPE min[3], max[3];
518 pHandle->
m_uniqueId =
static_cast<int>(handle);
525 BP_FP_INT_TYPE limit =
static_cast<BP_FP_INT_TYPE
>(
m_numHandles * 2);
529 for (BP_FP_INT_TYPE axis = 0; axis < 3; axis++)
542 pHandle->
m_minEdges[axis] =
static_cast<BP_FP_INT_TYPE
>(limit - 1);
559 template <
typename BP_FP_INT_TYPE>
578 for (axis = 0;axis<3;axis++)
584 for ( axis = 0; axis < 3; axis++)
587 BP_FP_INT_TYPE max = pHandle->
m_maxEdges[axis];
602 #ifdef DEBUG_BROADPHASE 603 debugPrintAxis(axis,
false);
604 #endif //DEBUG_BROADPHASE 616 template <
typename BP_FP_INT_TYPE>
624 m_pHandles[i].SetNextFree(static_cast<BP_FP_INT_TYPE>(i + 1));
633 template <
typename BP_FP_INT_TYPE>
657 for (i=0;i<overlappingPairArray.
size();i++)
662 bool isDuplicate = (pair == previousPair);
666 bool needsRemoval =
false;
675 needsRemoval =
false;
702 #define CLEAN_INVALID_PAIRS 1 703 #ifdef CLEAN_INVALID_PAIRS 710 #endif//CLEAN_INVALID_PAIRS 718 template <
typename BP_FP_INT_TYPE>
726 for (
int axis = 0; axis < 3; axis++)
737 template <
typename BP_FP_INT_TYPE>
752 template <
typename BP_FP_INT_TYPE>
761 BP_FP_INT_TYPE min[3], max[3];
766 for (
int axis = 0; axis < 3; axis++)
768 BP_FP_INT_TYPE emin = pHandle->
m_minEdges[axis];
769 BP_FP_INT_TYPE emax = pHandle->
m_maxEdges[axis];
791 #ifdef DEBUG_BROADPHASE 792 debugPrintAxis(axis);
793 #endif //DEBUG_BROADPHASE 803 template <
typename BP_FP_INT_TYPE>
808 Edge* pPrev = pEdge - 1;
818 const int axis1 = (1 << axis) & 3;
819 const int axis2 = (1 << axis1) & 3;
820 if (updateOverlaps &&
testOverlap2D(pHandleEdge, pHandlePrev,axis1,axis2))
848 #ifdef DEBUG_BROADPHASE 849 debugPrintAxis(axis);
850 #endif //DEBUG_BROADPHASE 855 template <
typename BP_FP_INT_TYPE>
859 Edge* pNext = pEdge + 1;
870 const int axis1 = (1 << axis) & 3;
871 const int axis2 = (1 << axis1) & 3;
877 #endif //USE_OVERLAP_TEST_ON_REMOVES 911 template <
typename BP_FP_INT_TYPE>
916 Edge* pPrev = pEdge - 1;
928 const int axis1 = (1 << axis) & 3;
929 const int axis2 = (1 << axis1) & 3;
934 #endif //USE_OVERLAP_TEST_ON_REMOVES 967 #ifdef DEBUG_BROADPHASE 968 debugPrintAxis(axis);
969 #endif //DEBUG_BROADPHASE 974 template <
typename BP_FP_INT_TYPE>
978 Edge* pNext = pEdge + 1;
985 const int axis1 = (1 << axis) & 3;
986 const int axis2 = (1 << axis1) & 3;
991 if (updateOverlaps &&
testOverlap2D(pHandleEdge, pHandleNext,axis1,axis2))
virtual void aabbTest(const btVector3 &aabbMin, const btVector3 &aabbMax, btBroadphaseAabbCallback &callback)
virtual void resetPool(btDispatcher *dispatcher)
reset broadphase internal structures, to ensure determinism/reproducability
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 getAabb(btBroadphaseProxy *proxy, btVector3 &aabbMin, btVector3 &aabbMax) const
virtual void cleanOverlappingPair(btBroadphasePair &pair, btDispatcher *dispatcher)=0
#define USE_OVERLAP_TEST_ON_REMOVES
void setValue(const btScalar &_x, const btScalar &_y, const btScalar &_z)
The btAxisSweep3 is an efficient implementation of the 3d axis sweep and prune broadphase.
Handle * getHandle(BP_FP_INT_TYPE index) const
btBroadphaseProxy * m_dbvtProxy
virtual bool hasDeferredRemoval()=0
btNullPairCache skips add/removal of overlapping pairs. Userful for benchmarking and unit testing...
BP_FP_INT_TYPE getNumHandles() const
void sortMaxUp(int axis, BP_FP_INT_TYPE edge, btDispatcher *dispatcher, bool updateOverlaps)
virtual void printStats()
void freeHandle(BP_FP_INT_TYPE handle)
#define SIMD_FORCE_INLINE
The btDbvtBroadphase implements a broadphase using two dynamic AABB bounding volume hierarchies/trees...
BP_FP_INT_TYPE m_handleSentinel
void processAllOverlappingPairs(btOverlapCallback *callback)
BP_FP_INT_TYPE m_firstFreeHandle
bool TestAabbAgainstAabb2(const btVector3 &aabbMin1, const btVector3 &aabbMax1, const btVector3 &aabbMin2, const btVector3 &aabbMax2)
conservative test for overlap between two aabbs
void removeHandle(BP_FP_INT_TYPE handle, btDispatcher *dispatcher)
BP_FP_INT_TYPE m_minEdges[3]
const btScalar & getZ() const
Return the z value.
The btOverlappingPairCache provides an interface for overlapping pair management (add, remove, storage), used by the btBroadphaseInterface broadphases.
int m_collisionFilterMask
void unQuantize(btBroadphaseProxy *proxy, btVector3 &aabbMin, btVector3 &aabbMax) const
unQuantize should be conservative: aabbMin/aabbMax should be larger then 'getAabb' result ...
bool testAabbOverlap(btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1)
int size() const
return the number of elements in the array
virtual void setAabb(btBroadphaseProxy *proxy, const btVector3 &aabbMin, const btVector3 &aabbMax, btDispatcher *dispatcher)
const btOverlappingPairCallback * getOverlappingPairUserCallback() const
BP_FP_INT_TYPE m_maxHandles
virtual btBroadphasePairArray & getOverlappingPairArray()=0
virtual void calculateOverlappingPairs(btDispatcher *dispatcher)
calculateOverlappingPairs is optional: incremental algorithms (sweep and prune) might do it during th...
BP_FP_INT_TYPE addHandle(const btVector3 &aabbMin, const btVector3 &aabbMax, void *pOwner, int collisionFilterGroup, int collisionFilterMask, btDispatcher *dispatcher)
virtual void destroyProxy(btBroadphaseProxy *proxy, btDispatcher *dispatcher)
virtual void destroyProxy(btBroadphaseProxy *proxy, btDispatcher *dispatcher)
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))
const btScalar & getY() const
Return the y value.
void updateHandle(BP_FP_INT_TYPE handle, const btVector3 &aabbMin, const btVector3 &aabbMax, btDispatcher *dispatcher)
#define btAlignedFree(ptr)
BP_FP_INT_TYPE m_maxEdges[3]
void sortMinUp(int axis, BP_FP_INT_TYPE edge, btDispatcher *dispatcher, bool updateOverlaps)
virtual void setAabb(btBroadphaseProxy *proxy, const btVector3 &aabbMin, const btVector3 &aabbMax, btDispatcher *dispatcher)
void setOverlappingPairUserCallback(btOverlappingPairCallback *pairCallback)
const btScalar & getX() const
Return the x value.
bool testOverlap2D(const Handle *pHandleA, const Handle *pHandleB, int axis0, int axis1)
BP_FP_INT_TYPE m_bpHandleMask
int m_collisionFilterGroup
virtual void removeOverlappingPairsContainingProxy(btBroadphaseProxy *proxy0, btDispatcher *dispatcher)=0
The btBroadphaseInterface class provides an interface to detect aabb-overlapping object pairs...
virtual void getBroadphaseAabb(btVector3 &aabbMin, btVector3 &aabbMax) const
getAabb returns the axis aligned bounding box in the 'global' coordinate frame will add some transfor...
virtual ~btOverlappingPairCache()
BP_FP_INT_TYPE GetNextFree() const
The btBroadphaseProxy is the main class that can be used with the Bullet broadphases.
btBroadphaseProxy * m_pProxy1
void sortMinDown(int axis, BP_FP_INT_TYPE edge, btDispatcher *dispatcher, bool updateOverlaps)
btCollisionAlgorithm * m_algorithm
btOverlappingPairCache * m_nullPairCache
btVector3 can be used to represent 3D points and vectors.
virtual bool process(const btBroadphaseProxy *proxy)=0
btOverlappingPairCache * m_pairCache
btBroadphaseProxy * m_pProxy0
btDbvtBroadphase * m_raycastAccelerator
additional dynamic aabb structure, used to accelerate ray cast queries.
BP_FP_INT_TYPE IsMax() const
virtual btBroadphasePair * addOverlappingPair(btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1)=0
const btOverlappingPairCache * getOverlappingPairCache() const
BP_FP_INT_TYPE allocHandle()
void sortMaxDown(int axis, BP_FP_INT_TYPE edge, btDispatcher *dispatcher, bool updateOverlaps)
void resize(int newsize, const T &fillData=T())
The internal templace class btAxisSweep3Internal implements the sweep and prune broadphase.
btOverlappingPairCache * getOverlappingPairCache()
void SetNextFree(BP_FP_INT_TYPE next)
void quantize(BP_FP_INT_TYPE *out, const btVector3 &point, int isMax) const
#define btAlignedAlloc(size, alignment)
BP_FP_INT_TYPE m_numHandles
void setMax(const btVector3 &other)
Set each element to the max of the current values and the values of another btVector3.
virtual ~btAxisSweep3Internal()
The btDispatcher interface class can be used in combination with broadphase to dispatch calculations ...
BT_DECLARE_ALIGNED_ALLOCATOR()
btAxisSweep3Internal(const btVector3 &worldAabbMin, const btVector3 &worldAabbMax, BP_FP_INT_TYPE handleMask, BP_FP_INT_TYPE handleSentinel, BP_FP_INT_TYPE maxHandles=16384, btOverlappingPairCache *pairCache=0, bool disableRaycastAccelerator=false)
btBroadphaseProxy * createProxy(const btVector3 &aabbMin, const btVector3 &aabbMax, int shapeType, void *userPtr, int collisionFilterGroup, int collisionFilterMask, btDispatcher *dispatcher)
Hash-space based Pair Cache, thanks to Erin Catto, Box2D, http://www.box2d.org, and Pierre Terdiman...
The btOverlappingPairCallback class is an additional optional broadphase user callback for adding/rem...
void setMin(const btVector3 &other)
Set each element to the min of the current values and the values of another btVector3.
float btScalar
The btScalar type abstracts floating point numbers, to easily switch between double and single floati...
void quickSort(const L &CompareFunc)
virtual void * removeOverlappingPair(btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1, btDispatcher *dispatcher)=0
virtual btBroadphaseProxy * createProxy(const btVector3 &aabbMin, const btVector3 &aabbMax, int shapeType, void *userPtr, int collisionFilterGroup, int collisionFilterMask, btDispatcher *dispatcher)
virtual void aabbTest(const btVector3 &aabbMin, const btVector3 &aabbMax, btBroadphaseAabbCallback &callback)
btOverlappingPairCallback * m_userPairCallback
btOverlappingPairCallback is an additional optional user callback for adding/removing overlapping pai...
The btBroadphasePair class contains a pair of aabb-overlapping objects.