#include <btConvex2dConvex2dAlgorithm.h>

Classes | |
| struct | CreateFunc |
Public Member Functions | |
| btConvex2dConvex2dAlgorithm (btPersistentManifold *mf, const btCollisionAlgorithmConstructionInfo &ci, btCollisionObject *body0, btCollisionObject *body1, btSimplexSolverInterface *simplexSolver, btConvexPenetrationDepthSolver *pdSolver, int numPerturbationIterations, int minimumPointsPerturbationThreshold) | |
| virtual btScalar | calculateTimeOfImpact (btCollisionObject *body0, btCollisionObject *body1, const btDispatcherInfo &dispatchInfo, btManifoldResult *resultOut) |
| virtual void | getAllContactManifolds (btManifoldArray &manifoldArray) |
| const btPersistentManifold * | getManifold () |
| virtual void | processCollision (btCollisionObject *body0, btCollisionObject *body1, const btDispatcherInfo &dispatchInfo, btManifoldResult *resultOut) |
| void | setLowLevelOfDetail (bool useLowLevel) |
| virtual | ~btConvex2dConvex2dAlgorithm () |
Private Attributes | |
| bool | m_lowLevelOfDetail |
| btPersistentManifold * | m_manifoldPtr |
| int | m_minimumPointsPerturbationThreshold |
| int | m_numPerturbationIterations |
| bool | m_ownManifold |
| btConvexPenetrationDepthSolver * | m_pdSolver |
| btSimplexSolverInterface * | m_simplexSolver |
The convex2dConvex2dAlgorithm collision algorithm support 2d collision detection for btConvex2dShape Currently it requires the btMinkowskiPenetrationDepthSolver, it has support for 2d penetration depth computation
Definition at line 33 of file btConvex2dConvex2dAlgorithm.h.
| btConvex2dConvex2dAlgorithm::btConvex2dConvex2dAlgorithm | ( | btPersistentManifold * | mf, | |
| const btCollisionAlgorithmConstructionInfo & | ci, | |||
| btCollisionObject * | body0, | |||
| btCollisionObject * | body1, | |||
| btSimplexSolverInterface * | simplexSolver, | |||
| btConvexPenetrationDepthSolver * | pdSolver, | |||
| int | numPerturbationIterations, | |||
| int | minimumPointsPerturbationThreshold | |||
| ) |
| virtual btConvex2dConvex2dAlgorithm::~btConvex2dConvex2dAlgorithm | ( | ) | [virtual] |
| virtual btScalar btConvex2dConvex2dAlgorithm::calculateTimeOfImpact | ( | btCollisionObject * | body0, | |
| btCollisionObject * | body1, | |||
| const btDispatcherInfo & | dispatchInfo, | |||
| btManifoldResult * | resultOut | |||
| ) | [virtual] |
Implements btCollisionAlgorithm.
| virtual void btConvex2dConvex2dAlgorithm::getAllContactManifolds | ( | btManifoldArray & | manifoldArray | ) | [inline, virtual] |
should we use m_ownManifold to avoid adding duplicates?
Implements btCollisionAlgorithm.
Definition at line 57 of file btConvex2dConvex2dAlgorithm.h.
| const btPersistentManifold* btConvex2dConvex2dAlgorithm::getManifold | ( | ) | [inline] |
Definition at line 68 of file btConvex2dConvex2dAlgorithm.h.
| virtual void btConvex2dConvex2dAlgorithm::processCollision | ( | btCollisionObject * | body0, | |
| btCollisionObject * | body1, | |||
| const btDispatcherInfo & | dispatchInfo, | |||
| btManifoldResult * | resultOut | |||
| ) | [virtual] |
Implements btCollisionAlgorithm.
| void btConvex2dConvex2dAlgorithm::setLowLevelOfDetail | ( | bool | useLowLevel | ) |
bool btConvex2dConvex2dAlgorithm::m_lowLevelOfDetail [private] |
Definition at line 41 of file btConvex2dConvex2dAlgorithm.h.
btPersistentManifold* btConvex2dConvex2dAlgorithm::m_manifoldPtr [private] |
Definition at line 40 of file btConvex2dConvex2dAlgorithm.h.
Definition at line 44 of file btConvex2dConvex2dAlgorithm.h.
int btConvex2dConvex2dAlgorithm::m_numPerturbationIterations [private] |
Definition at line 43 of file btConvex2dConvex2dAlgorithm.h.
bool btConvex2dConvex2dAlgorithm::m_ownManifold [private] |
Definition at line 39 of file btConvex2dConvex2dAlgorithm.h.
Definition at line 36 of file btConvex2dConvex2dAlgorithm.h.
Definition at line 35 of file btConvex2dConvex2dAlgorithm.h.