27 #ifdef USE_BUGGY_SPHERE_BOX_ALGORITHM
29 #endif //USE_BUGGY_SPHERE_BOX_ALGORITHM
80 #ifdef USE_BUGGY_SPHERE_BOX_ALGORITHM
86 #endif //USE_BUGGY_SPHERE_BOX_ALGORITHM
111 collisionAlgorithmMaxElementSize =
btMax(collisionAlgorithmMaxElementSize,maxSize2);
112 collisionAlgorithmMaxElementSize =
btMax(collisionAlgorithmMaxElementSize,maxSize3);
176 #ifdef USE_BUGGY_SPHERE_BOX_ALGORITHM
181 #endif //USE_BUGGY_SPHERE_BOX_ALGORITHM
215 #ifdef USE_BUGGY_SPHERE_BOX_ALGORITHM
225 #endif //USE_BUGGY_SPHERE_BOX_ALGORITHM
btCollisionAlgorithmCreateFunc * m_convexPlaneCF
btPoolAllocator * m_persistentManifoldPool
btPersistentManifold is a contact point cache, it stays persistent as long as objects are overlapping...
bool m_ownsCollisionAlgorithmPool
void setConvexConvexMultipointIterations(int numPerturbationIterations=3, int minimumPointsPerturbationThreshold=3)
Use this method to allow to generate multiple contact points between at once, between two objects usi...
btPoolAllocator * m_collisionAlgorithmPool
btConvexPenetrationDepthSolver * m_pdSolver
int m_numPerturbationIterations
static bool isCompound(int proxyType)
int m_customCollisionAlgorithmMaxElementSize
btPoolAllocator * m_collisionAlgorithmPool
btCollisionAlgorithmCreateFunc * m_boxBoxCF
btCollisionAlgorithmCreateFunc * m_triangleSphereCF
virtual btCollisionAlgorithmCreateFunc * getCollisionAlgorithmCreateFunc(int proxyType0, int proxyType1)
bool m_ownsPersistentManifoldPool
int m_defaultMaxCollisionAlgorithmPoolSize
btDefaultCollisionConfiguration(const btDefaultCollisionConstructionInfo &constructionInfo=btDefaultCollisionConstructionInfo())
virtual ~btConvexPenetrationDepthSolver()
btVoronoiSimplexSolver is an implementation of the closest point distance algorithm from a 1-4 points...
btCollisionAlgorithmCreateFunc * m_swappedConvexConcaveCreateFunc
btVoronoiSimplexSolver * m_simplexSolver
virtual ~btDefaultCollisionConfiguration()
Used by the btCollisionDispatcher to register and create instances for btCollisionAlgorithm.
The btConvexSeparatingDistanceUtil can help speed up convex collision detection by conservatively upd...
#define btAlignedFree(ptr)
int m_useEpaPenetrationAlgorithm
MinkowskiPenetrationDepthSolver implements bruteforce penetration depth estimation.
btPoolAllocator * m_persistentManifoldPool
btCollisionAlgorithmCreateFunc * m_emptyCreateFunc
btConvexConcaveCollisionAlgorithm supports collision between convex shapes and (concave) trianges mes...
void setPlaneConvexMultipointIterations(int numPerturbationIterations=3, int minimumPointsPerturbationThreshold=3)
btCollisionAlgorithmCreateFunc * m_sphereTriangleCF
btCollisionAlgorithmCreateFunc * m_sphereSphereCF
EpaPenetrationDepthSolver uses the Expanding Polytope Algorithm to calculate the penetration depth be...
btCollisionAlgorithmCreateFunc * m_planeConvexCF
btCollisionAlgorithmCreateFunc * m_compoundCreateFunc
int m_numPerturbationIterations
The btPoolAllocator class allows to efficiently allocate a large pool of objects, instead of dynamica...
btGjkPairDetector uses GJK to implement the btDiscreteCollisionDetectorInterface
btCompoundCollisionAlgorithm supports collision between CompoundCollisionShapes and other collision s...
static bool isConcave(int proxyType)
const T & btMax(const T &a, const T &b)
btCollisionAlgorithmCreateFunc * m_boxSphereCF
Enabling USE_SEPDISTANCE_UTIL2 requires 100% reliable distance computation.
btCollisionAlgorithmCreateFunc * m_compoundCompoundCreateFunc
#define btAlignedAlloc(size, alignment)
btCollisionAlgorithmCreateFunc * m_convexConcaveCreateFunc
int m_defaultMaxPersistentManifoldPoolSize
int m_minimumPointsPerturbationThreshold
int m_minimumPointsPerturbationThreshold
static bool isConvex(int proxyType)
btCollisionAlgorithmCreateFunc * m_sphereBoxCF
btCollisionAlgorithmCreateFunc * m_convexConvexCreateFunc
btCollisionAlgorithmCreateFunc * m_swappedCompoundCreateFunc
virtual ~btCollisionAlgorithmCreateFunc()