btConvex2dConvex2dAlgorithm Class Reference

The convex2dConvex2dAlgorithm collision algorithm support 2d collision detection for btConvex2dShape Currently it requires the btMinkowskiPenetrationDepthSolver, it has support for 2d penetration depth computation. More...

#include <btConvex2dConvex2dAlgorithm.h>

Inheritance diagram for btConvex2dConvex2dAlgorithm:

[legend]

Collaboration diagram for btConvex2dConvex2dAlgorithm:

[legend]

List of all members.

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	~btConvex2dConvex2dAlgorithm ()
virtual void	processCollision (btCollisionObject body0, btCollisionObject body1, const btDispatcherInfo &dispatchInfo, btManifoldResult *resultOut)
virtual btScalar	calculateTimeOfImpact (btCollisionObject body0, btCollisionObject body1, const btDispatcherInfo &dispatchInfo, btManifoldResult *resultOut)
virtual void	getAllContactManifolds (btManifoldArray &manifoldArray)
void	setLowLevelOfDetail (bool useLowLevel)
const btPersistentManifold *	getManifold ()
Private Attributes
btSimplexSolverInterface *	m_simplexSolver
btConvexPenetrationDepthSolver *	m_pdSolver
bool	m_ownManifold
btPersistentManifold *	m_manifoldPtr
bool	m_lowLevelOfDetail
int	m_numPerturbationIterations
int	m_minimumPointsPerturbationThreshold

Detailed Description

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.

Constructor & Destructor Documentation

btConvex2dConvex2dAlgorithm::btConvex2dConvex2dAlgorithm	(	btPersistentManifold *	mf,
		const btCollisionAlgorithmConstructionInfo &	ci,
		btCollisionObject *	body0,
		btCollisionObject *	body1,
		btSimplexSolverInterface *	simplexSolver,
		btConvexPenetrationDepthSolver *	pdSolver,
		int	numPerturbationIterations,
		int	minimumPointsPerturbationThreshold
	)

Definition at line 60 of file btConvex2dConvex2dAlgorithm.cpp.

btConvex2dConvex2dAlgorithm::~btConvex2dConvex2dAlgorithm ( ) [virtual]

Definition at line 77 of file btConvex2dConvex2dAlgorithm.cpp.

Member Function Documentation

btScalar btConvex2dConvex2dAlgorithm::calculateTimeOfImpact	(	btCollisionObject *	body0,
		btCollisionObject *	body1,
		const btDispatcherInfo &	dispatchInfo,
		btManifoldResult *	resultOut
	)			`[virtual]`

Rather then checking ALL pairs, only calculate TOI when motion exceeds threshold

Linear motion for one of objects needs to exceed m_ccdSquareMotionThreshold col0->m_worldTransform,

Convex0 against sphere for Convex1

Simplification, one object is simplified as a sphere

Sphere (for convex0) against Convex1

Simplification, one object is simplified as a sphere

Implements btCollisionAlgorithm.

Definition at line 156 of file btConvex2dConvex2dAlgorithm.cpp.

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.

void btConvex2dConvex2dAlgorithm::processCollision	(	btCollisionObject *	body0,
		btCollisionObject *	body1,
		const btDispatcherInfo &	dispatchInfo,
		btManifoldResult *	resultOut
	)			`[virtual]`