improved performance of constraint solver by precalculating the cross product/impulse arm added collision comparison code: ODE box-box, also sphere-triangle added safety check into GJK, and an assert for AABB's that are very large write partid/triangle index outside of GJK
73 lines
2.8 KiB
C++
73 lines
2.8 KiB
C++
/*
|
|
Bullet Continuous Collision Detection and Physics Library
|
|
Copyright (c) 2003-2006 Erwin Coumans http://continuousphysics.com/Bullet/
|
|
|
|
This software is provided 'as-is', without any express or implied warranty.
|
|
In no event will the authors be held liable for any damages arising from the use of this software.
|
|
Permission is granted to anyone to use this software for any purpose,
|
|
including commercial applications, and to alter it and redistribute it freely,
|
|
subject to the following restrictions:
|
|
|
|
1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
|
|
2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
|
|
3. This notice may not be removed or altered from any source distribution.
|
|
*/
|
|
|
|
#include "BoxBoxCollisionAlgorithm.h"
|
|
#include "BulletCollision/CollisionDispatch/btCollisionDispatcher.h"
|
|
#include "BulletCollision/CollisionShapes/btBoxShape.h"
|
|
#include "BulletCollision/CollisionDispatch/btCollisionObject.h"
|
|
#include "BoxBoxDetector.h"
|
|
|
|
BoxBoxCollisionAlgorithm::BoxBoxCollisionAlgorithm(btPersistentManifold* mf,const btCollisionAlgorithmConstructionInfo& ci,btCollisionObject* obj0,btCollisionObject* obj1)
|
|
: btCollisionAlgorithm(ci),
|
|
m_ownManifold(false),
|
|
m_manifoldPtr(mf)
|
|
{
|
|
if (!m_manifoldPtr && m_dispatcher->needsCollision(obj0,obj1))
|
|
{
|
|
m_manifoldPtr = m_dispatcher->getNewManifold(obj0,obj1);
|
|
m_ownManifold = true;
|
|
}
|
|
}
|
|
|
|
BoxBoxCollisionAlgorithm::~BoxBoxCollisionAlgorithm()
|
|
{
|
|
if (m_ownManifold)
|
|
{
|
|
if (m_manifoldPtr)
|
|
m_dispatcher->releaseManifold(m_manifoldPtr);
|
|
}
|
|
}
|
|
|
|
void BoxBoxCollisionAlgorithm::processCollision (btCollisionObject* body0,btCollisionObject* body1,const btDispatcherInfo& dispatchInfo,btManifoldResult* resultOut)
|
|
{
|
|
if (!m_manifoldPtr)
|
|
return;
|
|
|
|
btCollisionObject* col0 = body0;
|
|
btCollisionObject* col1 = body1;
|
|
btBoxShape* box0 = (btBoxShape*)col0->m_collisionShape;
|
|
btBoxShape* box1 = (btBoxShape*)col1->m_collisionShape;
|
|
|
|
|
|
|
|
/// report a contact. internally this will be kept persistent, and contact reduction is done
|
|
resultOut->setPersistentManifold(m_manifoldPtr);
|
|
|
|
btDiscreteCollisionDetectorInterface::ClosestPointInput input;
|
|
input.m_maximumDistanceSquared = 1e30f;
|
|
input.m_transformA = body0->m_worldTransform;
|
|
input.m_transformB = body1->m_worldTransform;
|
|
|
|
BoxBoxDetector detector(box0,box1);
|
|
detector.getClosestPoints(input,*resultOut,dispatchInfo.m_debugDraw);
|
|
|
|
}
|
|
|
|
float BoxBoxCollisionAlgorithm::calculateTimeOfImpact(btCollisionObject* body0,btCollisionObject* body1,const btDispatcherInfo& dispatchInfo,btManifoldResult* resultOut)
|
|
{
|
|
//not yet
|
|
return 1.f;
|
|
}
|