Nelze vybrat více než 25 témat Téma musí začínat písmenem nebo číslem, může obsahovat pomlčky („-“) a může být dlouhé až 35 znaků.
 
 
 

1519 řádky
52 KiB

  1. /*
  2. Bullet Continuous Collision Detection and Physics Library
  3. Copyright (c) 2003-2006 Erwin Coumans http://continuousphysics.com/Bullet/
  4. This software is provided 'as-is', without any express or implied warranty.
  5. In no event will the authors be held liable for any damages arising from the use of this software.
  6. Permission is granted to anyone to use this software for any purpose,
  7. including commercial applications, and to alter it and redistribute it freely,
  8. subject to the following restrictions:
  9. 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.
  10. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
  11. 3. This notice may not be removed or altered from any source distribution.
  12. */
  13. #include "btCollisionWorld.h"
  14. #include "btCollisionDispatcher.h"
  15. #include "BulletCollision/CollisionDispatch/btCollisionObject.h"
  16. #include "BulletCollision/CollisionShapes/btCollisionShape.h"
  17. #include "BulletCollision/CollisionShapes/btConvexShape.h"
  18. #include "BulletCollision/NarrowPhaseCollision/btGjkEpaPenetrationDepthSolver.h"
  19. #include "BulletCollision/CollisionShapes/btSphereShape.h" //for raycasting
  20. #include "BulletCollision/CollisionShapes/btBvhTriangleMeshShape.h" //for raycasting
  21. #include "BulletCollision/NarrowPhaseCollision/btRaycastCallback.h"
  22. #include "BulletCollision/CollisionShapes/btCompoundShape.h"
  23. #include "BulletCollision/NarrowPhaseCollision/btSubSimplexConvexCast.h"
  24. #include "BulletCollision/NarrowPhaseCollision/btGjkConvexCast.h"
  25. #include "BulletCollision/NarrowPhaseCollision/btContinuousConvexCollision.h"
  26. #include "BulletCollision/BroadphaseCollision/btCollisionAlgorithm.h"
  27. #include "BulletCollision/BroadphaseCollision/btBroadphaseInterface.h"
  28. #include "BulletCollision/BroadphaseCollision/btDbvt.h"
  29. #include "LinearMath/btAabbUtil2.h"
  30. #include "LinearMath/btQuickprof.h"
  31. #include "LinearMath/btStackAlloc.h"
  32. #include "LinearMath/btSerializer.h"
  33. #include "BulletCollision/CollisionShapes/btConvexPolyhedron.h"
  34. //#define DISABLE_DBVT_COMPOUNDSHAPE_RAYCAST_ACCELERATION
  35. //#define USE_BRUTEFORCE_RAYBROADPHASE 1
  36. //RECALCULATE_AABB is slower, but benefit is that you don't need to call 'stepSimulation' or 'updateAabbs' before using a rayTest
  37. //#define RECALCULATE_AABB_RAYCAST 1
  38. //When the user doesn't provide dispatcher or broadphase, create basic versions (and delete them in destructor)
  39. #include "BulletCollision/CollisionDispatch/btCollisionDispatcher.h"
  40. #include "BulletCollision/BroadphaseCollision/btSimpleBroadphase.h"
  41. #include "BulletCollision/CollisionDispatch/btCollisionConfiguration.h"
  42. ///for debug drawing
  43. //for debug rendering
  44. #include "BulletCollision/CollisionShapes/btBoxShape.h"
  45. #include "BulletCollision/CollisionShapes/btCapsuleShape.h"
  46. #include "BulletCollision/CollisionShapes/btCompoundShape.h"
  47. #include "BulletCollision/CollisionShapes/btConeShape.h"
  48. #include "BulletCollision/CollisionShapes/btConvexTriangleMeshShape.h"
  49. #include "BulletCollision/CollisionShapes/btCylinderShape.h"
  50. #include "BulletCollision/CollisionShapes/btMultiSphereShape.h"
  51. #include "BulletCollision/CollisionShapes/btPolyhedralConvexShape.h"
  52. #include "BulletCollision/CollisionShapes/btSphereShape.h"
  53. #include "BulletCollision/CollisionShapes/btTriangleCallback.h"
  54. #include "BulletCollision/CollisionShapes/btTriangleMeshShape.h"
  55. #include "BulletCollision/CollisionShapes/btStaticPlaneShape.h"
  56. btCollisionWorld::btCollisionWorld(btDispatcher* dispatcher,btBroadphaseInterface* pairCache, btCollisionConfiguration* collisionConfiguration)
  57. :m_dispatcher1(dispatcher),
  58. m_broadphasePairCache(pairCache),
  59. m_debugDrawer(0),
  60. m_forceUpdateAllAabbs(true)
  61. {
  62. m_stackAlloc = collisionConfiguration->getStackAllocator();
  63. m_dispatchInfo.m_stackAllocator = m_stackAlloc;
  64. }
  65. btCollisionWorld::~btCollisionWorld()
  66. {
  67. //clean up remaining objects
  68. int i;
  69. for (i=0;i<m_collisionObjects.size();i++)
  70. {
  71. btCollisionObject* collisionObject= m_collisionObjects[i];
  72. btBroadphaseProxy* bp = collisionObject->getBroadphaseHandle();
  73. if (bp)
  74. {
  75. //
  76. // only clear the cached algorithms
  77. //
  78. getBroadphase()->getOverlappingPairCache()->cleanProxyFromPairs(bp,m_dispatcher1);
  79. getBroadphase()->destroyProxy(bp,m_dispatcher1);
  80. collisionObject->setBroadphaseHandle(0);
  81. }
  82. }
  83. }
  84. void btCollisionWorld::addCollisionObject(btCollisionObject* collisionObject,short int collisionFilterGroup,short int collisionFilterMask)
  85. {
  86. btAssert(collisionObject);
  87. //check that the object isn't already added
  88. btAssert( m_collisionObjects.findLinearSearch(collisionObject) == m_collisionObjects.size());
  89. m_collisionObjects.push_back(collisionObject);
  90. //calculate new AABB
  91. btTransform trans = collisionObject->getWorldTransform();
  92. btVector3 minAabb;
  93. btVector3 maxAabb;
  94. collisionObject->getCollisionShape()->getAabb(trans,minAabb,maxAabb);
  95. int type = collisionObject->getCollisionShape()->getShapeType();
  96. collisionObject->setBroadphaseHandle( getBroadphase()->createProxy(
  97. minAabb,
  98. maxAabb,
  99. type,
  100. collisionObject,
  101. collisionFilterGroup,
  102. collisionFilterMask,
  103. m_dispatcher1,0
  104. )) ;
  105. }
  106. void btCollisionWorld::updateSingleAabb(btCollisionObject* colObj)
  107. {
  108. btVector3 minAabb,maxAabb;
  109. colObj->getCollisionShape()->getAabb(colObj->getWorldTransform(), minAabb,maxAabb);
  110. //need to increase the aabb for contact thresholds
  111. btVector3 contactThreshold(gContactBreakingThreshold,gContactBreakingThreshold,gContactBreakingThreshold);
  112. minAabb -= contactThreshold;
  113. maxAabb += contactThreshold;
  114. if(getDispatchInfo().m_useContinuous && colObj->getInternalType()==btCollisionObject::CO_RIGID_BODY && !colObj->isStaticOrKinematicObject())
  115. {
  116. btVector3 minAabb2,maxAabb2;
  117. colObj->getCollisionShape()->getAabb(colObj->getInterpolationWorldTransform(),minAabb2,maxAabb2);
  118. minAabb2 -= contactThreshold;
  119. maxAabb2 += contactThreshold;
  120. minAabb.setMin(minAabb2);
  121. maxAabb.setMax(maxAabb2);
  122. }
  123. btBroadphaseInterface* bp = (btBroadphaseInterface*)m_broadphasePairCache;
  124. //moving objects should be moderately sized, probably something wrong if not
  125. if ( colObj->isStaticObject() || ((maxAabb-minAabb).length2() < btScalar(1e12)))
  126. {
  127. bp->setAabb(colObj->getBroadphaseHandle(),minAabb,maxAabb, m_dispatcher1);
  128. } else
  129. {
  130. //something went wrong, investigate
  131. //this assert is unwanted in 3D modelers (danger of loosing work)
  132. colObj->setActivationState(DISABLE_SIMULATION);
  133. static bool reportMe = true;
  134. if (reportMe && m_debugDrawer)
  135. {
  136. reportMe = false;
  137. m_debugDrawer->reportErrorWarning("Overflow in AABB, object removed from simulation");
  138. m_debugDrawer->reportErrorWarning("If you can reproduce this, please email bugs@continuousphysics.com\n");
  139. m_debugDrawer->reportErrorWarning("Please include above information, your Platform, version of OS.\n");
  140. m_debugDrawer->reportErrorWarning("Thanks.\n");
  141. }
  142. }
  143. }
  144. void btCollisionWorld::updateAabbs()
  145. {
  146. BT_PROFILE("updateAabbs");
  147. btTransform predictedTrans;
  148. for ( int i=0;i<m_collisionObjects.size();i++)
  149. {
  150. btCollisionObject* colObj = m_collisionObjects[i];
  151. //only update aabb of active objects
  152. if (m_forceUpdateAllAabbs || colObj->isActive())
  153. {
  154. updateSingleAabb(colObj);
  155. }
  156. }
  157. }
  158. void btCollisionWorld::performDiscreteCollisionDetection()
  159. {
  160. BT_PROFILE("performDiscreteCollisionDetection");
  161. btDispatcherInfo& dispatchInfo = getDispatchInfo();
  162. updateAabbs();
  163. {
  164. BT_PROFILE("calculateOverlappingPairs");
  165. m_broadphasePairCache->calculateOverlappingPairs(m_dispatcher1);
  166. }
  167. btDispatcher* dispatcher = getDispatcher();
  168. {
  169. BT_PROFILE("dispatchAllCollisionPairs");
  170. if (dispatcher)
  171. dispatcher->dispatchAllCollisionPairs(m_broadphasePairCache->getOverlappingPairCache(),dispatchInfo,m_dispatcher1);
  172. }
  173. }
  174. void btCollisionWorld::removeCollisionObject(btCollisionObject* collisionObject)
  175. {
  176. //bool removeFromBroadphase = false;
  177. {
  178. btBroadphaseProxy* bp = collisionObject->getBroadphaseHandle();
  179. if (bp)
  180. {
  181. //
  182. // only clear the cached algorithms
  183. //
  184. getBroadphase()->getOverlappingPairCache()->cleanProxyFromPairs(bp,m_dispatcher1);
  185. getBroadphase()->destroyProxy(bp,m_dispatcher1);
  186. collisionObject->setBroadphaseHandle(0);
  187. }
  188. }
  189. //swapremove
  190. m_collisionObjects.remove(collisionObject);
  191. }
  192. void btCollisionWorld::rayTestSingle(const btTransform& rayFromTrans,const btTransform& rayToTrans,
  193. btCollisionObject* collisionObject,
  194. const btCollisionShape* collisionShape,
  195. const btTransform& colObjWorldTransform,
  196. RayResultCallback& resultCallback)
  197. {
  198. btSphereShape pointShape(btScalar(0.0));
  199. pointShape.setMargin(0.f);
  200. const btConvexShape* castShape = &pointShape;
  201. if (collisionShape->isConvex())
  202. {
  203. // BT_PROFILE("rayTestConvex");
  204. btConvexCast::CastResult castResult;
  205. castResult.m_fraction = resultCallback.m_closestHitFraction;
  206. btConvexShape* convexShape = (btConvexShape*) collisionShape;
  207. btVoronoiSimplexSolver simplexSolver;
  208. #define USE_SUBSIMPLEX_CONVEX_CAST 1
  209. #ifdef USE_SUBSIMPLEX_CONVEX_CAST
  210. btSubsimplexConvexCast convexCaster(castShape,convexShape,&simplexSolver);
  211. #else
  212. //btGjkConvexCast convexCaster(castShape,convexShape,&simplexSolver);
  213. //btContinuousConvexCollision convexCaster(castShape,convexShape,&simplexSolver,0);
  214. #endif //#USE_SUBSIMPLEX_CONVEX_CAST
  215. if (convexCaster.calcTimeOfImpact(rayFromTrans,rayToTrans,colObjWorldTransform,colObjWorldTransform,castResult))
  216. {
  217. //add hit
  218. if (castResult.m_normal.length2() > btScalar(0.0001))
  219. {
  220. if (castResult.m_fraction < resultCallback.m_closestHitFraction)
  221. {
  222. #ifdef USE_SUBSIMPLEX_CONVEX_CAST
  223. //rotate normal into worldspace
  224. castResult.m_normal = rayFromTrans.getBasis() * castResult.m_normal;
  225. #endif //USE_SUBSIMPLEX_CONVEX_CAST
  226. castResult.m_normal.normalize();
  227. btCollisionWorld::LocalRayResult localRayResult
  228. (
  229. collisionObject,
  230. 0,
  231. castResult.m_normal,
  232. castResult.m_fraction
  233. );
  234. bool normalInWorldSpace = true;
  235. resultCallback.addSingleResult(localRayResult, normalInWorldSpace);
  236. }
  237. }
  238. }
  239. } else {
  240. if (collisionShape->isConcave())
  241. {
  242. // BT_PROFILE("rayTestConcave");
  243. if (collisionShape->getShapeType()==TRIANGLE_MESH_SHAPE_PROXYTYPE)
  244. {
  245. ///optimized version for btBvhTriangleMeshShape
  246. btBvhTriangleMeshShape* triangleMesh = (btBvhTriangleMeshShape*)collisionShape;
  247. btTransform worldTocollisionObject = colObjWorldTransform.inverse();
  248. btVector3 rayFromLocal = worldTocollisionObject * rayFromTrans.getOrigin();
  249. btVector3 rayToLocal = worldTocollisionObject * rayToTrans.getOrigin();
  250. //ConvexCast::CastResult
  251. struct BridgeTriangleRaycastCallback : public btTriangleRaycastCallback
  252. {
  253. btCollisionWorld::RayResultCallback* m_resultCallback;
  254. btCollisionObject* m_collisionObject;
  255. btTriangleMeshShape* m_triangleMesh;
  256. btTransform m_colObjWorldTransform;
  257. BridgeTriangleRaycastCallback( const btVector3& from,const btVector3& to,
  258. btCollisionWorld::RayResultCallback* resultCallback, btCollisionObject* collisionObject,btTriangleMeshShape* triangleMesh,const btTransform& colObjWorldTransform):
  259. //@BP Mod
  260. btTriangleRaycastCallback(from,to, resultCallback->m_flags),
  261. m_resultCallback(resultCallback),
  262. m_collisionObject(collisionObject),
  263. m_triangleMesh(triangleMesh),
  264. m_colObjWorldTransform(colObjWorldTransform)
  265. {
  266. }
  267. virtual btScalar reportHit(const btVector3& hitNormalLocal, btScalar hitFraction, int partId, int triangleIndex )
  268. {
  269. btCollisionWorld::LocalShapeInfo shapeInfo;
  270. shapeInfo.m_shapePart = partId;
  271. shapeInfo.m_triangleIndex = triangleIndex;
  272. btVector3 hitNormalWorld = m_colObjWorldTransform.getBasis() * hitNormalLocal;
  273. btCollisionWorld::LocalRayResult rayResult
  274. (m_collisionObject,
  275. &shapeInfo,
  276. hitNormalWorld,
  277. hitFraction);
  278. bool normalInWorldSpace = true;
  279. return m_resultCallback->addSingleResult(rayResult,normalInWorldSpace);
  280. }
  281. };
  282. BridgeTriangleRaycastCallback rcb(rayFromLocal,rayToLocal,&resultCallback,collisionObject,triangleMesh,colObjWorldTransform);
  283. rcb.m_hitFraction = resultCallback.m_closestHitFraction;
  284. triangleMesh->performRaycast(&rcb,rayFromLocal,rayToLocal);
  285. } else
  286. {
  287. //generic (slower) case
  288. btConcaveShape* concaveShape = (btConcaveShape*)collisionShape;
  289. btTransform worldTocollisionObject = colObjWorldTransform.inverse();
  290. btVector3 rayFromLocal = worldTocollisionObject * rayFromTrans.getOrigin();
  291. btVector3 rayToLocal = worldTocollisionObject * rayToTrans.getOrigin();
  292. //ConvexCast::CastResult
  293. struct BridgeTriangleRaycastCallback : public btTriangleRaycastCallback
  294. {
  295. btCollisionWorld::RayResultCallback* m_resultCallback;
  296. btCollisionObject* m_collisionObject;
  297. btConcaveShape* m_triangleMesh;
  298. btTransform m_colObjWorldTransform;
  299. BridgeTriangleRaycastCallback( const btVector3& from,const btVector3& to,
  300. btCollisionWorld::RayResultCallback* resultCallback, btCollisionObject* collisionObject,btConcaveShape* triangleMesh, const btTransform& colObjWorldTransform):
  301. //@BP Mod
  302. btTriangleRaycastCallback(from,to, resultCallback->m_flags),
  303. m_resultCallback(resultCallback),
  304. m_collisionObject(collisionObject),
  305. m_triangleMesh(triangleMesh),
  306. m_colObjWorldTransform(colObjWorldTransform)
  307. {
  308. }
  309. virtual btScalar reportHit(const btVector3& hitNormalLocal, btScalar hitFraction, int partId, int triangleIndex )
  310. {
  311. btCollisionWorld::LocalShapeInfo shapeInfo;
  312. shapeInfo.m_shapePart = partId;
  313. shapeInfo.m_triangleIndex = triangleIndex;
  314. btVector3 hitNormalWorld = m_colObjWorldTransform.getBasis() * hitNormalLocal;
  315. btCollisionWorld::LocalRayResult rayResult
  316. (m_collisionObject,
  317. &shapeInfo,
  318. hitNormalWorld,
  319. hitFraction);
  320. bool normalInWorldSpace = true;
  321. return m_resultCallback->addSingleResult(rayResult,normalInWorldSpace);
  322. }
  323. };
  324. BridgeTriangleRaycastCallback rcb(rayFromLocal,rayToLocal,&resultCallback,collisionObject,concaveShape, colObjWorldTransform);
  325. rcb.m_hitFraction = resultCallback.m_closestHitFraction;
  326. btVector3 rayAabbMinLocal = rayFromLocal;
  327. rayAabbMinLocal.setMin(rayToLocal);
  328. btVector3 rayAabbMaxLocal = rayFromLocal;
  329. rayAabbMaxLocal.setMax(rayToLocal);
  330. concaveShape->processAllTriangles(&rcb,rayAabbMinLocal,rayAabbMaxLocal);
  331. }
  332. } else {
  333. // BT_PROFILE("rayTestCompound");
  334. if (collisionShape->isCompound())
  335. {
  336. struct LocalInfoAdder2 : public RayResultCallback
  337. {
  338. RayResultCallback* m_userCallback;
  339. int m_i;
  340. LocalInfoAdder2 (int i, RayResultCallback *user)
  341. : m_userCallback(user), m_i(i)
  342. {
  343. m_closestHitFraction = m_userCallback->m_closestHitFraction;
  344. }
  345. virtual bool needsCollision(btBroadphaseProxy* p) const
  346. {
  347. return m_userCallback->needsCollision(p);
  348. }
  349. virtual btScalar addSingleResult (btCollisionWorld::LocalRayResult &r, bool b)
  350. {
  351. btCollisionWorld::LocalShapeInfo shapeInfo;
  352. shapeInfo.m_shapePart = -1;
  353. shapeInfo.m_triangleIndex = m_i;
  354. if (r.m_localShapeInfo == NULL)
  355. r.m_localShapeInfo = &shapeInfo;
  356. const btScalar result = m_userCallback->addSingleResult(r, b);
  357. m_closestHitFraction = m_userCallback->m_closestHitFraction;
  358. return result;
  359. }
  360. };
  361. struct RayTester : btDbvt::ICollide
  362. {
  363. btCollisionObject* m_collisionObject;
  364. const btCompoundShape* m_compoundShape;
  365. const btTransform& m_colObjWorldTransform;
  366. const btTransform& m_rayFromTrans;
  367. const btTransform& m_rayToTrans;
  368. RayResultCallback& m_resultCallback;
  369. RayTester(btCollisionObject* collisionObject,
  370. const btCompoundShape* compoundShape,
  371. const btTransform& colObjWorldTransform,
  372. const btTransform& rayFromTrans,
  373. const btTransform& rayToTrans,
  374. RayResultCallback& resultCallback):
  375. m_collisionObject(collisionObject),
  376. m_compoundShape(compoundShape),
  377. m_colObjWorldTransform(colObjWorldTransform),
  378. m_rayFromTrans(rayFromTrans),
  379. m_rayToTrans(rayToTrans),
  380. m_resultCallback(resultCallback)
  381. {
  382. }
  383. void Process(int i)
  384. {
  385. const btCollisionShape* childCollisionShape = m_compoundShape->getChildShape(i);
  386. const btTransform& childTrans = m_compoundShape->getChildTransform(i);
  387. btTransform childWorldTrans = m_colObjWorldTransform * childTrans;
  388. // replace collision shape so that callback can determine the triangle
  389. btCollisionShape* saveCollisionShape = m_collisionObject->getCollisionShape();
  390. m_collisionObject->internalSetTemporaryCollisionShape((btCollisionShape*)childCollisionShape);
  391. LocalInfoAdder2 my_cb(i, &m_resultCallback);
  392. rayTestSingle(
  393. m_rayFromTrans,
  394. m_rayToTrans,
  395. m_collisionObject,
  396. childCollisionShape,
  397. childWorldTrans,
  398. my_cb);
  399. // restore
  400. m_collisionObject->internalSetTemporaryCollisionShape(saveCollisionShape);
  401. }
  402. void Process(const btDbvtNode* leaf)
  403. {
  404. Process(leaf->dataAsInt);
  405. }
  406. };
  407. const btCompoundShape* compoundShape = static_cast<const btCompoundShape*>(collisionShape);
  408. const btDbvt* dbvt = compoundShape->getDynamicAabbTree();
  409. RayTester rayCB(
  410. collisionObject,
  411. compoundShape,
  412. colObjWorldTransform,
  413. rayFromTrans,
  414. rayToTrans,
  415. resultCallback);
  416. #ifndef DISABLE_DBVT_COMPOUNDSHAPE_RAYCAST_ACCELERATION
  417. if (dbvt)
  418. {
  419. btVector3 localRayFrom = colObjWorldTransform.inverseTimes(rayFromTrans).getOrigin();
  420. btVector3 localRayTo = colObjWorldTransform.inverseTimes(rayToTrans).getOrigin();
  421. btDbvt::rayTest(dbvt->m_root, localRayFrom , localRayTo, rayCB);
  422. }
  423. else
  424. #endif //DISABLE_DBVT_COMPOUNDSHAPE_RAYCAST_ACCELERATION
  425. {
  426. for (int i = 0, n = compoundShape->getNumChildShapes(); i < n; ++i)
  427. {
  428. rayCB.Process(i);
  429. }
  430. }
  431. }
  432. }
  433. }
  434. }
  435. void btCollisionWorld::objectQuerySingle(const btConvexShape* castShape,const btTransform& convexFromTrans,const btTransform& convexToTrans,
  436. btCollisionObject* collisionObject,
  437. const btCollisionShape* collisionShape,
  438. const btTransform& colObjWorldTransform,
  439. ConvexResultCallback& resultCallback, btScalar allowedPenetration)
  440. {
  441. if (collisionShape->isConvex())
  442. {
  443. //BT_PROFILE("convexSweepConvex");
  444. btConvexCast::CastResult castResult;
  445. castResult.m_allowedPenetration = allowedPenetration;
  446. castResult.m_fraction = resultCallback.m_closestHitFraction;//btScalar(1.);//??
  447. btConvexShape* convexShape = (btConvexShape*) collisionShape;
  448. btVoronoiSimplexSolver simplexSolver;
  449. btGjkEpaPenetrationDepthSolver gjkEpaPenetrationSolver;
  450. btContinuousConvexCollision convexCaster1(castShape,convexShape,&simplexSolver,&gjkEpaPenetrationSolver);
  451. //btGjkConvexCast convexCaster2(castShape,convexShape,&simplexSolver);
  452. //btSubsimplexConvexCast convexCaster3(castShape,convexShape,&simplexSolver);
  453. btConvexCast* castPtr = &convexCaster1;
  454. if (castPtr->calcTimeOfImpact(convexFromTrans,convexToTrans,colObjWorldTransform,colObjWorldTransform,castResult))
  455. {
  456. //add hit
  457. if (castResult.m_normal.length2() > btScalar(0.0001))
  458. {
  459. if (castResult.m_fraction < resultCallback.m_closestHitFraction)
  460. {
  461. castResult.m_normal.normalize();
  462. btCollisionWorld::LocalConvexResult localConvexResult
  463. (
  464. collisionObject,
  465. 0,
  466. castResult.m_normal,
  467. castResult.m_hitPoint,
  468. castResult.m_fraction
  469. );
  470. bool normalInWorldSpace = true;
  471. resultCallback.addSingleResult(localConvexResult, normalInWorldSpace);
  472. }
  473. }
  474. }
  475. } else {
  476. if (collisionShape->isConcave())
  477. {
  478. if (collisionShape->getShapeType()==TRIANGLE_MESH_SHAPE_PROXYTYPE)
  479. {
  480. //BT_PROFILE("convexSweepbtBvhTriangleMesh");
  481. btBvhTriangleMeshShape* triangleMesh = (btBvhTriangleMeshShape*)collisionShape;
  482. btTransform worldTocollisionObject = colObjWorldTransform.inverse();
  483. btVector3 convexFromLocal = worldTocollisionObject * convexFromTrans.getOrigin();
  484. btVector3 convexToLocal = worldTocollisionObject * convexToTrans.getOrigin();
  485. // rotation of box in local mesh space = MeshRotation^-1 * ConvexToRotation
  486. btTransform rotationXform = btTransform(worldTocollisionObject.getBasis() * convexToTrans.getBasis());
  487. //ConvexCast::CastResult
  488. struct BridgeTriangleConvexcastCallback : public btTriangleConvexcastCallback
  489. {
  490. btCollisionWorld::ConvexResultCallback* m_resultCallback;
  491. btCollisionObject* m_collisionObject;
  492. btTriangleMeshShape* m_triangleMesh;
  493. BridgeTriangleConvexcastCallback(const btConvexShape* castShape, const btTransform& from,const btTransform& to,
  494. btCollisionWorld::ConvexResultCallback* resultCallback, btCollisionObject* collisionObject,btTriangleMeshShape* triangleMesh, const btTransform& triangleToWorld):
  495. btTriangleConvexcastCallback(castShape, from,to, triangleToWorld, triangleMesh->getMargin()),
  496. m_resultCallback(resultCallback),
  497. m_collisionObject(collisionObject),
  498. m_triangleMesh(triangleMesh)
  499. {
  500. }
  501. virtual btScalar reportHit(const btVector3& hitNormalLocal, const btVector3& hitPointLocal, btScalar hitFraction, int partId, int triangleIndex )
  502. {
  503. btCollisionWorld::LocalShapeInfo shapeInfo;
  504. shapeInfo.m_shapePart = partId;
  505. shapeInfo.m_triangleIndex = triangleIndex;
  506. if (hitFraction <= m_resultCallback->m_closestHitFraction)
  507. {
  508. btCollisionWorld::LocalConvexResult convexResult
  509. (m_collisionObject,
  510. &shapeInfo,
  511. hitNormalLocal,
  512. hitPointLocal,
  513. hitFraction);
  514. bool normalInWorldSpace = true;
  515. return m_resultCallback->addSingleResult(convexResult,normalInWorldSpace);
  516. }
  517. return hitFraction;
  518. }
  519. };
  520. BridgeTriangleConvexcastCallback tccb(castShape, convexFromTrans,convexToTrans,&resultCallback,collisionObject,triangleMesh, colObjWorldTransform);
  521. tccb.m_hitFraction = resultCallback.m_closestHitFraction;
  522. tccb.m_allowedPenetration = allowedPenetration;
  523. btVector3 boxMinLocal, boxMaxLocal;
  524. castShape->getAabb(rotationXform, boxMinLocal, boxMaxLocal);
  525. triangleMesh->performConvexcast(&tccb,convexFromLocal,convexToLocal,boxMinLocal, boxMaxLocal);
  526. } else
  527. {
  528. if (collisionShape->getShapeType()==STATIC_PLANE_PROXYTYPE)
  529. {
  530. btConvexCast::CastResult castResult;
  531. castResult.m_allowedPenetration = allowedPenetration;
  532. castResult.m_fraction = resultCallback.m_closestHitFraction;
  533. btStaticPlaneShape* planeShape = (btStaticPlaneShape*) collisionShape;
  534. btContinuousConvexCollision convexCaster1(castShape,planeShape);
  535. btConvexCast* castPtr = &convexCaster1;
  536. if (castPtr->calcTimeOfImpact(convexFromTrans,convexToTrans,colObjWorldTransform,colObjWorldTransform,castResult))
  537. {
  538. //add hit
  539. if (castResult.m_normal.length2() > btScalar(0.0001))
  540. {
  541. if (castResult.m_fraction < resultCallback.m_closestHitFraction)
  542. {
  543. castResult.m_normal.normalize();
  544. btCollisionWorld::LocalConvexResult localConvexResult
  545. (
  546. collisionObject,
  547. 0,
  548. castResult.m_normal,
  549. castResult.m_hitPoint,
  550. castResult.m_fraction
  551. );
  552. bool normalInWorldSpace = true;
  553. resultCallback.addSingleResult(localConvexResult, normalInWorldSpace);
  554. }
  555. }
  556. }
  557. } else
  558. {
  559. //BT_PROFILE("convexSweepConcave");
  560. btConcaveShape* concaveShape = (btConcaveShape*)collisionShape;
  561. btTransform worldTocollisionObject = colObjWorldTransform.inverse();
  562. btVector3 convexFromLocal = worldTocollisionObject * convexFromTrans.getOrigin();
  563. btVector3 convexToLocal = worldTocollisionObject * convexToTrans.getOrigin();
  564. // rotation of box in local mesh space = MeshRotation^-1 * ConvexToRotation
  565. btTransform rotationXform = btTransform(worldTocollisionObject.getBasis() * convexToTrans.getBasis());
  566. //ConvexCast::CastResult
  567. struct BridgeTriangleConvexcastCallback : public btTriangleConvexcastCallback
  568. {
  569. btCollisionWorld::ConvexResultCallback* m_resultCallback;
  570. btCollisionObject* m_collisionObject;
  571. btConcaveShape* m_triangleMesh;
  572. BridgeTriangleConvexcastCallback(const btConvexShape* castShape, const btTransform& from,const btTransform& to,
  573. btCollisionWorld::ConvexResultCallback* resultCallback, btCollisionObject* collisionObject,btConcaveShape* triangleMesh, const btTransform& triangleToWorld):
  574. btTriangleConvexcastCallback(castShape, from,to, triangleToWorld, triangleMesh->getMargin()),
  575. m_resultCallback(resultCallback),
  576. m_collisionObject(collisionObject),
  577. m_triangleMesh(triangleMesh)
  578. {
  579. }
  580. virtual btScalar reportHit(const btVector3& hitNormalLocal, const btVector3& hitPointLocal, btScalar hitFraction, int partId, int triangleIndex )
  581. {
  582. btCollisionWorld::LocalShapeInfo shapeInfo;
  583. shapeInfo.m_shapePart = partId;
  584. shapeInfo.m_triangleIndex = triangleIndex;
  585. if (hitFraction <= m_resultCallback->m_closestHitFraction)
  586. {
  587. btCollisionWorld::LocalConvexResult convexResult
  588. (m_collisionObject,
  589. &shapeInfo,
  590. hitNormalLocal,
  591. hitPointLocal,
  592. hitFraction);
  593. bool normalInWorldSpace = false;
  594. return m_resultCallback->addSingleResult(convexResult,normalInWorldSpace);
  595. }
  596. return hitFraction;
  597. }
  598. };
  599. BridgeTriangleConvexcastCallback tccb(castShape, convexFromTrans,convexToTrans,&resultCallback,collisionObject,concaveShape, colObjWorldTransform);
  600. tccb.m_hitFraction = resultCallback.m_closestHitFraction;
  601. tccb.m_allowedPenetration = allowedPenetration;
  602. btVector3 boxMinLocal, boxMaxLocal;
  603. castShape->getAabb(rotationXform, boxMinLocal, boxMaxLocal);
  604. btVector3 rayAabbMinLocal = convexFromLocal;
  605. rayAabbMinLocal.setMin(convexToLocal);
  606. btVector3 rayAabbMaxLocal = convexFromLocal;
  607. rayAabbMaxLocal.setMax(convexToLocal);
  608. rayAabbMinLocal += boxMinLocal;
  609. rayAabbMaxLocal += boxMaxLocal;
  610. concaveShape->processAllTriangles(&tccb,rayAabbMinLocal,rayAabbMaxLocal);
  611. }
  612. }
  613. } else {
  614. ///@todo : use AABB tree or other BVH acceleration structure!
  615. if (collisionShape->isCompound())
  616. {
  617. BT_PROFILE("convexSweepCompound");
  618. const btCompoundShape* compoundShape = static_cast<const btCompoundShape*>(collisionShape);
  619. int i=0;
  620. for (i=0;i<compoundShape->getNumChildShapes();i++)
  621. {
  622. btTransform childTrans = compoundShape->getChildTransform(i);
  623. const btCollisionShape* childCollisionShape = compoundShape->getChildShape(i);
  624. btTransform childWorldTrans = colObjWorldTransform * childTrans;
  625. // replace collision shape so that callback can determine the triangle
  626. btCollisionShape* saveCollisionShape = collisionObject->getCollisionShape();
  627. collisionObject->internalSetTemporaryCollisionShape((btCollisionShape*)childCollisionShape);
  628. struct LocalInfoAdder : public ConvexResultCallback {
  629. ConvexResultCallback* m_userCallback;
  630. int m_i;
  631. LocalInfoAdder (int i, ConvexResultCallback *user)
  632. : m_userCallback(user), m_i(i)
  633. {
  634. m_closestHitFraction = m_userCallback->m_closestHitFraction;
  635. }
  636. virtual bool needsCollision(btBroadphaseProxy* p) const
  637. {
  638. return m_userCallback->needsCollision(p);
  639. }
  640. virtual btScalar addSingleResult (btCollisionWorld::LocalConvexResult& r, bool b)
  641. {
  642. btCollisionWorld::LocalShapeInfo shapeInfo;
  643. shapeInfo.m_shapePart = -1;
  644. shapeInfo.m_triangleIndex = m_i;
  645. if (r.m_localShapeInfo == NULL)
  646. r.m_localShapeInfo = &shapeInfo;
  647. const btScalar result = m_userCallback->addSingleResult(r, b);
  648. m_closestHitFraction = m_userCallback->m_closestHitFraction;
  649. return result;
  650. }
  651. };
  652. LocalInfoAdder my_cb(i, &resultCallback);
  653. objectQuerySingle(castShape, convexFromTrans,convexToTrans,
  654. collisionObject,
  655. childCollisionShape,
  656. childWorldTrans,
  657. my_cb, allowedPenetration);
  658. // restore
  659. collisionObject->internalSetTemporaryCollisionShape(saveCollisionShape);
  660. }
  661. }
  662. }
  663. }
  664. }
  665. struct btSingleRayCallback : public btBroadphaseRayCallback
  666. {
  667. btVector3 m_rayFromWorld;
  668. btVector3 m_rayToWorld;
  669. btTransform m_rayFromTrans;
  670. btTransform m_rayToTrans;
  671. btVector3 m_hitNormal;
  672. const btCollisionWorld* m_world;
  673. btCollisionWorld::RayResultCallback& m_resultCallback;
  674. btSingleRayCallback(const btVector3& rayFromWorld,const btVector3& rayToWorld,const btCollisionWorld* world,btCollisionWorld::RayResultCallback& resultCallback)
  675. :m_rayFromWorld(rayFromWorld),
  676. m_rayToWorld(rayToWorld),
  677. m_world(world),
  678. m_resultCallback(resultCallback)
  679. {
  680. m_rayFromTrans.setIdentity();
  681. m_rayFromTrans.setOrigin(m_rayFromWorld);
  682. m_rayToTrans.setIdentity();
  683. m_rayToTrans.setOrigin(m_rayToWorld);
  684. btVector3 rayDir = (rayToWorld-rayFromWorld);
  685. rayDir.normalize ();
  686. ///what about division by zero? --> just set rayDirection[i] to INF/BT_LARGE_FLOAT
  687. m_rayDirectionInverse[0] = rayDir[0] == btScalar(0.0) ? btScalar(BT_LARGE_FLOAT) : btScalar(1.0) / rayDir[0];
  688. m_rayDirectionInverse[1] = rayDir[1] == btScalar(0.0) ? btScalar(BT_LARGE_FLOAT) : btScalar(1.0) / rayDir[1];
  689. m_rayDirectionInverse[2] = rayDir[2] == btScalar(0.0) ? btScalar(BT_LARGE_FLOAT) : btScalar(1.0) / rayDir[2];
  690. m_signs[0] = m_rayDirectionInverse[0] < 0.0;
  691. m_signs[1] = m_rayDirectionInverse[1] < 0.0;
  692. m_signs[2] = m_rayDirectionInverse[2] < 0.0;
  693. m_lambda_max = rayDir.dot(m_rayToWorld-m_rayFromWorld);
  694. }
  695. virtual bool process(const btBroadphaseProxy* proxy)
  696. {
  697. ///terminate further ray tests, once the closestHitFraction reached zero
  698. if (m_resultCallback.m_closestHitFraction == btScalar(0.f))
  699. return false;
  700. btCollisionObject* collisionObject = (btCollisionObject*)proxy->m_clientObject;
  701. //only perform raycast if filterMask matches
  702. if(m_resultCallback.needsCollision(collisionObject->getBroadphaseHandle()))
  703. {
  704. //RigidcollisionObject* collisionObject = ctrl->GetRigidcollisionObject();
  705. //btVector3 collisionObjectAabbMin,collisionObjectAabbMax;
  706. #if 0
  707. #ifdef RECALCULATE_AABB
  708. btVector3 collisionObjectAabbMin,collisionObjectAabbMax;
  709. collisionObject->getCollisionShape()->getAabb(collisionObject->getWorldTransform(),collisionObjectAabbMin,collisionObjectAabbMax);
  710. #else
  711. //getBroadphase()->getAabb(collisionObject->getBroadphaseHandle(),collisionObjectAabbMin,collisionObjectAabbMax);
  712. const btVector3& collisionObjectAabbMin = collisionObject->getBroadphaseHandle()->m_aabbMin;
  713. const btVector3& collisionObjectAabbMax = collisionObject->getBroadphaseHandle()->m_aabbMax;
  714. #endif
  715. #endif
  716. //btScalar hitLambda = m_resultCallback.m_closestHitFraction;
  717. //culling already done by broadphase
  718. //if (btRayAabb(m_rayFromWorld,m_rayToWorld,collisionObjectAabbMin,collisionObjectAabbMax,hitLambda,m_hitNormal))
  719. {
  720. m_world->rayTestSingle(m_rayFromTrans,m_rayToTrans,
  721. collisionObject,
  722. collisionObject->getCollisionShape(),
  723. collisionObject->getWorldTransform(),
  724. m_resultCallback);
  725. }
  726. }
  727. return true;
  728. }
  729. };
  730. void btCollisionWorld::rayTest(const btVector3& rayFromWorld, const btVector3& rayToWorld, RayResultCallback& resultCallback) const
  731. {
  732. //BT_PROFILE("rayTest");
  733. /// use the broadphase to accelerate the search for objects, based on their aabb
  734. /// and for each object with ray-aabb overlap, perform an exact ray test
  735. btSingleRayCallback rayCB(rayFromWorld,rayToWorld,this,resultCallback);
  736. #ifndef USE_BRUTEFORCE_RAYBROADPHASE
  737. m_broadphasePairCache->rayTest(rayFromWorld,rayToWorld,rayCB);
  738. #else
  739. for (int i=0;i<this->getNumCollisionObjects();i++)
  740. {
  741. rayCB.process(m_collisionObjects[i]->getBroadphaseHandle());
  742. }
  743. #endif //USE_BRUTEFORCE_RAYBROADPHASE
  744. }
  745. struct btSingleSweepCallback : public btBroadphaseRayCallback
  746. {
  747. btTransform m_convexFromTrans;
  748. btTransform m_convexToTrans;
  749. btVector3 m_hitNormal;
  750. const btCollisionWorld* m_world;
  751. btCollisionWorld::ConvexResultCallback& m_resultCallback;
  752. btScalar m_allowedCcdPenetration;
  753. const btConvexShape* m_castShape;
  754. btSingleSweepCallback(const btConvexShape* castShape, const btTransform& convexFromTrans,const btTransform& convexToTrans,const btCollisionWorld* world,btCollisionWorld::ConvexResultCallback& resultCallback,btScalar allowedPenetration)
  755. :m_convexFromTrans(convexFromTrans),
  756. m_convexToTrans(convexToTrans),
  757. m_world(world),
  758. m_resultCallback(resultCallback),
  759. m_allowedCcdPenetration(allowedPenetration),
  760. m_castShape(castShape)
  761. {
  762. btVector3 unnormalizedRayDir = (m_convexToTrans.getOrigin()-m_convexFromTrans.getOrigin());
  763. btVector3 rayDir = unnormalizedRayDir.normalized();
  764. ///what about division by zero? --> just set rayDirection[i] to INF/BT_LARGE_FLOAT
  765. m_rayDirectionInverse[0] = rayDir[0] == btScalar(0.0) ? btScalar(BT_LARGE_FLOAT) : btScalar(1.0) / rayDir[0];
  766. m_rayDirectionInverse[1] = rayDir[1] == btScalar(0.0) ? btScalar(BT_LARGE_FLOAT) : btScalar(1.0) / rayDir[1];
  767. m_rayDirectionInverse[2] = rayDir[2] == btScalar(0.0) ? btScalar(BT_LARGE_FLOAT) : btScalar(1.0) / rayDir[2];
  768. m_signs[0] = m_rayDirectionInverse[0] < 0.0;
  769. m_signs[1] = m_rayDirectionInverse[1] < 0.0;
  770. m_signs[2] = m_rayDirectionInverse[2] < 0.0;
  771. m_lambda_max = rayDir.dot(unnormalizedRayDir);
  772. }
  773. virtual bool process(const btBroadphaseProxy* proxy)
  774. {
  775. ///terminate further convex sweep tests, once the closestHitFraction reached zero
  776. if (m_resultCallback.m_closestHitFraction == btScalar(0.f))
  777. return false;
  778. btCollisionObject* collisionObject = (btCollisionObject*)proxy->m_clientObject;
  779. //only perform raycast if filterMask matches
  780. if(m_resultCallback.needsCollision(collisionObject->getBroadphaseHandle())) {
  781. //RigidcollisionObject* collisionObject = ctrl->GetRigidcollisionObject();
  782. m_world->objectQuerySingle(m_castShape, m_convexFromTrans,m_convexToTrans,
  783. collisionObject,
  784. collisionObject->getCollisionShape(),
  785. collisionObject->getWorldTransform(),
  786. m_resultCallback,
  787. m_allowedCcdPenetration);
  788. }
  789. return true;
  790. }
  791. };
  792. void btCollisionWorld::convexSweepTest(const btConvexShape* castShape, const btTransform& convexFromWorld, const btTransform& convexToWorld, ConvexResultCallback& resultCallback, btScalar allowedCcdPenetration) const
  793. {
  794. BT_PROFILE("convexSweepTest");
  795. /// use the broadphase to accelerate the search for objects, based on their aabb
  796. /// and for each object with ray-aabb overlap, perform an exact ray test
  797. /// unfortunately the implementation for rayTest and convexSweepTest duplicated, albeit practically identical
  798. btTransform convexFromTrans,convexToTrans;
  799. convexFromTrans = convexFromWorld;
  800. convexToTrans = convexToWorld;
  801. btVector3 castShapeAabbMin, castShapeAabbMax;
  802. /* Compute AABB that encompasses angular movement */
  803. {
  804. btVector3 linVel, angVel;
  805. btTransformUtil::calculateVelocity (convexFromTrans, convexToTrans, 1.0, linVel, angVel);
  806. btVector3 zeroLinVel;
  807. zeroLinVel.setValue(0,0,0);
  808. btTransform R;
  809. R.setIdentity ();
  810. R.setRotation (convexFromTrans.getRotation());
  811. castShape->calculateTemporalAabb (R, zeroLinVel, angVel, 1.0, castShapeAabbMin, castShapeAabbMax);
  812. }
  813. #ifndef USE_BRUTEFORCE_RAYBROADPHASE
  814. btSingleSweepCallback convexCB(castShape,convexFromWorld,convexToWorld,this,resultCallback,allowedCcdPenetration);
  815. m_broadphasePairCache->rayTest(convexFromTrans.getOrigin(),convexToTrans.getOrigin(),convexCB,castShapeAabbMin,castShapeAabbMax);
  816. #else
  817. /// go over all objects, and if the ray intersects their aabb + cast shape aabb,
  818. // do a ray-shape query using convexCaster (CCD)
  819. int i;
  820. for (i=0;i<m_collisionObjects.size();i++)
  821. {
  822. btCollisionObject* collisionObject= m_collisionObjects[i];
  823. //only perform raycast if filterMask matches
  824. if(resultCallback.needsCollision(collisionObject->getBroadphaseHandle())) {
  825. //RigidcollisionObject* collisionObject = ctrl->GetRigidcollisionObject();
  826. btVector3 collisionObjectAabbMin,collisionObjectAabbMax;
  827. collisionObject->getCollisionShape()->getAabb(collisionObject->getWorldTransform(),collisionObjectAabbMin,collisionObjectAabbMax);
  828. AabbExpand (collisionObjectAabbMin, collisionObjectAabbMax, castShapeAabbMin, castShapeAabbMax);
  829. btScalar hitLambda = btScalar(1.); //could use resultCallback.m_closestHitFraction, but needs testing
  830. btVector3 hitNormal;
  831. if (btRayAabb(convexFromWorld.getOrigin(),convexToWorld.getOrigin(),collisionObjectAabbMin,collisionObjectAabbMax,hitLambda,hitNormal))
  832. {
  833. objectQuerySingle(castShape, convexFromTrans,convexToTrans,
  834. collisionObject,
  835. collisionObject->getCollisionShape(),
  836. collisionObject->getWorldTransform(),
  837. resultCallback,
  838. allowedCcdPenetration);
  839. }
  840. }
  841. }
  842. #endif //USE_BRUTEFORCE_RAYBROADPHASE
  843. }
  844. struct btBridgedManifoldResult : public btManifoldResult
  845. {
  846. btCollisionWorld::ContactResultCallback& m_resultCallback;
  847. btBridgedManifoldResult( btCollisionObject* obj0,btCollisionObject* obj1,btCollisionWorld::ContactResultCallback& resultCallback )
  848. :btManifoldResult(obj0,obj1),
  849. m_resultCallback(resultCallback)
  850. {
  851. }
  852. virtual void addContactPoint(const btVector3& normalOnBInWorld,const btVector3& pointInWorld,btScalar depth)
  853. {
  854. bool isSwapped = m_manifoldPtr->getBody0() != m_body0;
  855. btVector3 pointA = pointInWorld + normalOnBInWorld * depth;
  856. btVector3 localA;
  857. btVector3 localB;
  858. if (isSwapped)
  859. {
  860. localA = m_rootTransB.invXform(pointA );
  861. localB = m_rootTransA.invXform(pointInWorld);
  862. } else
  863. {
  864. localA = m_rootTransA.invXform(pointA );
  865. localB = m_rootTransB.invXform(pointInWorld);
  866. }
  867. btManifoldPoint newPt(localA,localB,normalOnBInWorld,depth);
  868. newPt.m_positionWorldOnA = pointA;
  869. newPt.m_positionWorldOnB = pointInWorld;
  870. //BP mod, store contact triangles.
  871. if (isSwapped)
  872. {
  873. newPt.m_partId0 = m_partId1;
  874. newPt.m_partId1 = m_partId0;
  875. newPt.m_index0 = m_index1;
  876. newPt.m_index1 = m_index0;
  877. } else
  878. {
  879. newPt.m_partId0 = m_partId0;
  880. newPt.m_partId1 = m_partId1;
  881. newPt.m_index0 = m_index0;
  882. newPt.m_index1 = m_index1;
  883. }
  884. //experimental feature info, for per-triangle material etc.
  885. btCollisionObject* obj0 = isSwapped? m_body1 : m_body0;
  886. btCollisionObject* obj1 = isSwapped? m_body0 : m_body1;
  887. m_resultCallback.addSingleResult(newPt,obj0,newPt.m_partId0,newPt.m_index0,obj1,newPt.m_partId1,newPt.m_index1);
  888. }
  889. };
  890. struct btSingleContactCallback : public btBroadphaseAabbCallback
  891. {
  892. btCollisionObject* m_collisionObject;
  893. btCollisionWorld* m_world;
  894. btCollisionWorld::ContactResultCallback& m_resultCallback;
  895. btSingleContactCallback(btCollisionObject* collisionObject, btCollisionWorld* world,btCollisionWorld::ContactResultCallback& resultCallback)
  896. :m_collisionObject(collisionObject),
  897. m_world(world),
  898. m_resultCallback(resultCallback)
  899. {
  900. }
  901. virtual bool process(const btBroadphaseProxy* proxy)
  902. {
  903. btCollisionObject* collisionObject = (btCollisionObject*)proxy->m_clientObject;
  904. if (collisionObject == m_collisionObject)
  905. return true;
  906. //only perform raycast if filterMask matches
  907. if(m_resultCallback.needsCollision(collisionObject->getBroadphaseHandle()))
  908. {
  909. btCollisionAlgorithm* algorithm = m_world->getDispatcher()->findAlgorithm(m_collisionObject,collisionObject);
  910. if (algorithm)
  911. {
  912. btBridgedManifoldResult contactPointResult(m_collisionObject,collisionObject, m_resultCallback);
  913. //discrete collision detection query
  914. algorithm->processCollision(m_collisionObject,collisionObject, m_world->getDispatchInfo(),&contactPointResult);
  915. algorithm->~btCollisionAlgorithm();
  916. m_world->getDispatcher()->freeCollisionAlgorithm(algorithm);
  917. }
  918. }
  919. return true;
  920. }
  921. };
  922. ///contactTest performs a discrete collision test against all objects in the btCollisionWorld, and calls the resultCallback.
  923. ///it reports one or more contact points for every overlapping object (including the one with deepest penetration)
  924. void btCollisionWorld::contactTest( btCollisionObject* colObj, ContactResultCallback& resultCallback)
  925. {
  926. btVector3 aabbMin,aabbMax;
  927. colObj->getCollisionShape()->getAabb(colObj->getWorldTransform(),aabbMin,aabbMax);
  928. btSingleContactCallback contactCB(colObj,this,resultCallback);
  929. m_broadphasePairCache->aabbTest(aabbMin,aabbMax,contactCB);
  930. }
  931. ///contactTest performs a discrete collision test between two collision objects and calls the resultCallback if overlap if detected.
  932. ///it reports one or more contact points (including the one with deepest penetration)
  933. void btCollisionWorld::contactPairTest(btCollisionObject* colObjA, btCollisionObject* colObjB, ContactResultCallback& resultCallback)
  934. {
  935. btCollisionAlgorithm* algorithm = getDispatcher()->findAlgorithm(colObjA,colObjB);
  936. if (algorithm)
  937. {
  938. btBridgedManifoldResult contactPointResult(colObjA,colObjB, resultCallback);
  939. //discrete collision detection query
  940. algorithm->processCollision(colObjA,colObjB, getDispatchInfo(),&contactPointResult);
  941. algorithm->~btCollisionAlgorithm();
  942. getDispatcher()->freeCollisionAlgorithm(algorithm);
  943. }
  944. }
  945. class DebugDrawcallback : public btTriangleCallback, public btInternalTriangleIndexCallback
  946. {
  947. btIDebugDraw* m_debugDrawer;
  948. btVector3 m_color;
  949. btTransform m_worldTrans;
  950. public:
  951. DebugDrawcallback(btIDebugDraw* debugDrawer,const btTransform& worldTrans,const btVector3& color) :
  952. m_debugDrawer(debugDrawer),
  953. m_color(color),
  954. m_worldTrans(worldTrans)
  955. {
  956. }
  957. virtual void internalProcessTriangleIndex(btVector3* triangle,int partId,int triangleIndex)
  958. {
  959. processTriangle(triangle,partId,triangleIndex);
  960. }
  961. virtual void processTriangle(btVector3* triangle,int partId, int triangleIndex)
  962. {
  963. (void)partId;
  964. (void)triangleIndex;
  965. btVector3 wv0,wv1,wv2;
  966. wv0 = m_worldTrans*triangle[0];
  967. wv1 = m_worldTrans*triangle[1];
  968. wv2 = m_worldTrans*triangle[2];
  969. btVector3 center = (wv0+wv1+wv2)*btScalar(1./3.);
  970. if (m_debugDrawer->getDebugMode() & btIDebugDraw::DBG_DrawNormals )
  971. {
  972. btVector3 normal = (wv1-wv0).cross(wv2-wv0);
  973. normal.normalize();
  974. btVector3 normalColor(1,1,0);
  975. m_debugDrawer->drawLine(center,center+normal,normalColor);
  976. }
  977. m_debugDrawer->drawLine(wv0,wv1,m_color);
  978. m_debugDrawer->drawLine(wv1,wv2,m_color);
  979. m_debugDrawer->drawLine(wv2,wv0,m_color);
  980. }
  981. };
  982. void btCollisionWorld::debugDrawObject(const btTransform& worldTransform, const btCollisionShape* shape, const btVector3& color)
  983. {
  984. // Draw a small simplex at the center of the object
  985. getDebugDrawer()->drawTransform(worldTransform,1);
  986. if (shape->getShapeType() == COMPOUND_SHAPE_PROXYTYPE)
  987. {
  988. const btCompoundShape* compoundShape = static_cast<const btCompoundShape*>(shape);
  989. for (int i=compoundShape->getNumChildShapes()-1;i>=0;i--)
  990. {
  991. btTransform childTrans = compoundShape->getChildTransform(i);
  992. const btCollisionShape* colShape = compoundShape->getChildShape(i);
  993. debugDrawObject(worldTransform*childTrans,colShape,color);
  994. }
  995. } else
  996. {
  997. /// for polyhedral shapes
  998. if (shape->isPolyhedral())
  999. {
  1000. btPolyhedralConvexShape* polyshape = (btPolyhedralConvexShape*) shape;
  1001. int i;
  1002. if (polyshape->getConvexPolyhedron())
  1003. {
  1004. const btConvexPolyhedron* poly = polyshape->getConvexPolyhedron();
  1005. for (i=0;i<poly->m_faces.size();i++)
  1006. {
  1007. btVector3 centroid(0,0,0);
  1008. int numVerts = poly->m_faces[i].m_indices.size();
  1009. if (numVerts)
  1010. {
  1011. int lastV = poly->m_faces[i].m_indices[numVerts-1];
  1012. for (int v=0;v<poly->m_faces[i].m_indices.size();v++)
  1013. {
  1014. int curVert = poly->m_faces[i].m_indices[v];
  1015. centroid+=poly->m_vertices[curVert];
  1016. getDebugDrawer()->drawLine(worldTransform*poly->m_vertices[lastV],worldTransform*poly->m_vertices[curVert],color);
  1017. lastV = curVert;
  1018. }
  1019. }
  1020. centroid*= btScalar(1.f)/btScalar(numVerts);
  1021. if (getDebugDrawer()->getDebugMode() & btIDebugDraw::DBG_DrawNormals)
  1022. {
  1023. btVector3 normalColor(1,1,0);
  1024. btVector3 faceNormal(poly->m_faces[i].m_plane[0],poly->m_faces[i].m_plane[1],poly->m_faces[i].m_plane[2]);
  1025. getDebugDrawer()->drawLine(worldTransform*centroid,worldTransform*(centroid+faceNormal),normalColor);
  1026. }
  1027. }
  1028. } else
  1029. {
  1030. for (i=0;i<polyshape->getNumEdges();i++)
  1031. {
  1032. btVector3 a,b;
  1033. polyshape->getEdge(i,a,b);
  1034. btVector3 wa = worldTransform * a;
  1035. btVector3 wb = worldTransform * b;
  1036. getDebugDrawer()->drawLine(wa,wb,color);
  1037. }
  1038. }
  1039. }
  1040. else
  1041. {
  1042. switch (shape->getShapeType())
  1043. {
  1044. case BOX_SHAPE_PROXYTYPE:
  1045. {
  1046. const btBoxShape* boxShape = static_cast<const btBoxShape*>(shape);
  1047. btVector3 halfExtents = boxShape->getHalfExtentsWithMargin();
  1048. getDebugDrawer()->drawBox(-halfExtents,halfExtents,worldTransform,color);
  1049. break;
  1050. }
  1051. case SPHERE_SHAPE_PROXYTYPE:
  1052. {
  1053. const btSphereShape* sphereShape = static_cast<const btSphereShape*>(shape);
  1054. btScalar radius = sphereShape->getMargin();//radius doesn't include the margin, so draw with margin
  1055. getDebugDrawer()->drawSphere(radius, worldTransform, color);
  1056. break;
  1057. }
  1058. case MULTI_SPHERE_SHAPE_PROXYTYPE:
  1059. {
  1060. const btMultiSphereShape* multiSphereShape = static_cast<const btMultiSphereShape*>(shape);
  1061. btTransform childTransform;
  1062. childTransform.setIdentity();
  1063. for (int i = multiSphereShape->getSphereCount()-1; i>=0;i--)
  1064. {
  1065. childTransform.setOrigin(multiSphereShape->getSpherePosition(i));
  1066. getDebugDrawer()->drawSphere(multiSphereShape->getSphereRadius(i), worldTransform*childTransform, color);
  1067. }
  1068. break;
  1069. }
  1070. case CAPSULE_SHAPE_PROXYTYPE:
  1071. {
  1072. const btCapsuleShape* capsuleShape = static_cast<const btCapsuleShape*>(shape);
  1073. btScalar radius = capsuleShape->getRadius();
  1074. btScalar halfHeight = capsuleShape->getHalfHeight();
  1075. int upAxis = capsuleShape->getUpAxis();
  1076. getDebugDrawer()->drawCapsule(radius, halfHeight, upAxis, worldTransform, color);
  1077. break;
  1078. }
  1079. case CONE_SHAPE_PROXYTYPE:
  1080. {
  1081. const btConeShape* coneShape = static_cast<const btConeShape*>(shape);
  1082. btScalar radius = coneShape->getRadius();//+coneShape->getMargin();
  1083. btScalar height = coneShape->getHeight();//+coneShape->getMargin();
  1084. int upAxis= coneShape->getConeUpIndex();
  1085. getDebugDrawer()->drawCone(radius, height, upAxis, worldTransform, color);
  1086. break;
  1087. }
  1088. case CYLINDER_SHAPE_PROXYTYPE:
  1089. {
  1090. const btCylinderShape* cylinder = static_cast<const btCylinderShape*>(shape);
  1091. int upAxis = cylinder->getUpAxis();
  1092. btScalar radius = cylinder->getRadius();
  1093. btScalar halfHeight = cylinder->getHalfExtentsWithMargin()[upAxis];
  1094. getDebugDrawer()->drawCylinder(radius, halfHeight, upAxis, worldTransform, color);
  1095. break;
  1096. }
  1097. case STATIC_PLANE_PROXYTYPE:
  1098. {
  1099. const btStaticPlaneShape* staticPlaneShape = static_cast<const btStaticPlaneShape*>(shape);
  1100. btScalar planeConst = staticPlaneShape->getPlaneConstant();
  1101. const btVector3& planeNormal = staticPlaneShape->getPlaneNormal();
  1102. getDebugDrawer()->drawPlane(planeNormal, planeConst,worldTransform, color);
  1103. break;
  1104. }
  1105. default:
  1106. {
  1107. if (shape->isConcave())
  1108. {
  1109. btConcaveShape* concaveMesh = (btConcaveShape*) shape;
  1110. ///@todo pass camera, for some culling? no -> we are not a graphics lib
  1111. btVector3 aabbMax(btScalar(BT_LARGE_FLOAT),btScalar(BT_LARGE_FLOAT),btScalar(BT_LARGE_FLOAT));
  1112. btVector3 aabbMin(btScalar(-BT_LARGE_FLOAT),btScalar(-BT_LARGE_FLOAT),btScalar(-BT_LARGE_FLOAT));
  1113. DebugDrawcallback drawCallback(getDebugDrawer(),worldTransform,color);
  1114. concaveMesh->processAllTriangles(&drawCallback,aabbMin,aabbMax);
  1115. }
  1116. if (shape->getShapeType() == CONVEX_TRIANGLEMESH_SHAPE_PROXYTYPE)
  1117. {
  1118. btConvexTriangleMeshShape* convexMesh = (btConvexTriangleMeshShape*) shape;
  1119. //todo: pass camera for some culling
  1120. btVector3 aabbMax(btScalar(BT_LARGE_FLOAT),btScalar(BT_LARGE_FLOAT),btScalar(BT_LARGE_FLOAT));
  1121. btVector3 aabbMin(btScalar(-BT_LARGE_FLOAT),btScalar(-BT_LARGE_FLOAT),btScalar(-BT_LARGE_FLOAT));
  1122. //DebugDrawcallback drawCallback;
  1123. DebugDrawcallback drawCallback(getDebugDrawer(),worldTransform,color);
  1124. convexMesh->getMeshInterface()->InternalProcessAllTriangles(&drawCallback,aabbMin,aabbMax);
  1125. }
  1126. }
  1127. }
  1128. }
  1129. }
  1130. }
  1131. void btCollisionWorld::debugDrawWorld()
  1132. {
  1133. if (getDebugDrawer() && getDebugDrawer()->getDebugMode() & btIDebugDraw::DBG_DrawContactPoints)
  1134. {
  1135. int numManifolds = getDispatcher()->getNumManifolds();
  1136. btVector3 color(1,0.65,0);
  1137. for (int i=0;i<numManifolds;i++)
  1138. {
  1139. btPersistentManifold* contactManifold = getDispatcher()->getManifoldByIndexInternal(i);
  1140. //btCollisionObject* obA = static_cast<btCollisionObject*>(contactManifold->getBody0());
  1141. //btCollisionObject* obB = static_cast<btCollisionObject*>(contactManifold->getBody1());
  1142. int numContacts = contactManifold->getNumContacts();
  1143. for (int j=0;j<numContacts;j++)
  1144. {
  1145. btManifoldPoint& cp = contactManifold->getContactPoint(j);
  1146. getDebugDrawer()->drawContactPoint(cp.m_positionWorldOnB,cp.m_normalWorldOnB,cp.getDistance(),cp.getLifeTime(),color);
  1147. }
  1148. }
  1149. }
  1150. if (getDebugDrawer() && (getDebugDrawer()->getDebugMode() & (btIDebugDraw::DBG_DrawWireframe | btIDebugDraw::DBG_DrawAabb)))
  1151. {
  1152. int i;
  1153. for ( i=0;i<m_collisionObjects.size();i++)
  1154. {
  1155. btCollisionObject* colObj = m_collisionObjects[i];
  1156. if ((colObj->getCollisionFlags() & btCollisionObject::CF_DISABLE_VISUALIZE_OBJECT)==0)
  1157. {
  1158. if (getDebugDrawer() && (getDebugDrawer()->getDebugMode() & btIDebugDraw::DBG_DrawWireframe))
  1159. {
  1160. btVector3 color(btScalar(1.),btScalar(1.),btScalar(1.));
  1161. switch(colObj->getActivationState())
  1162. {
  1163. case ACTIVE_TAG:
  1164. color = btVector3(btScalar(1.),btScalar(1.),btScalar(1.)); break;
  1165. case ISLAND_SLEEPING:
  1166. color = btVector3(btScalar(0.),btScalar(1.),btScalar(0.));break;
  1167. case WANTS_DEACTIVATION:
  1168. color = btVector3(btScalar(0.),btScalar(1.),btScalar(1.));break;
  1169. case DISABLE_DEACTIVATION:
  1170. color = btVector3(btScalar(1.),btScalar(0.),btScalar(0.));break;
  1171. case DISABLE_SIMULATION:
  1172. color = btVector3(btScalar(1.),btScalar(1.),btScalar(0.));break;
  1173. default:
  1174. {
  1175. color = btVector3(btScalar(1),btScalar(0.),btScalar(0.));
  1176. }
  1177. };
  1178. debugDrawObject(colObj->getWorldTransform(),colObj->getCollisionShape(),color);
  1179. }
  1180. if (m_debugDrawer && (m_debugDrawer->getDebugMode() & btIDebugDraw::DBG_DrawAabb))
  1181. {
  1182. btVector3 minAabb,maxAabb;
  1183. btVector3 colorvec(1,0,0);
  1184. colObj->getCollisionShape()->getAabb(colObj->getWorldTransform(), minAabb,maxAabb);
  1185. btVector3 contactThreshold(gContactBreakingThreshold,gContactBreakingThreshold,gContactBreakingThreshold);
  1186. minAabb -= contactThreshold;
  1187. maxAabb += contactThreshold;
  1188. btVector3 minAabb2,maxAabb2;
  1189. if(getDispatchInfo().m_useContinuous && colObj->getInternalType()==btCollisionObject::CO_RIGID_BODY && !colObj->isStaticOrKinematicObject())
  1190. {
  1191. colObj->getCollisionShape()->getAabb(colObj->getInterpolationWorldTransform(),minAabb2,maxAabb2);
  1192. minAabb2 -= contactThreshold;
  1193. maxAabb2 += contactThreshold;
  1194. minAabb.setMin(minAabb2);
  1195. maxAabb.setMax(maxAabb2);
  1196. }
  1197. m_debugDrawer->drawAabb(minAabb,maxAabb,colorvec);
  1198. }
  1199. }
  1200. }
  1201. }
  1202. }
  1203. void btCollisionWorld::serializeCollisionObjects(btSerializer* serializer)
  1204. {
  1205. int i;
  1206. //serialize all collision objects
  1207. for (i=0;i<m_collisionObjects.size();i++)
  1208. {
  1209. btCollisionObject* colObj = m_collisionObjects[i];
  1210. if (colObj->getInternalType() == btCollisionObject::CO_COLLISION_OBJECT)
  1211. {
  1212. colObj->serializeSingleObject(serializer);
  1213. }
  1214. }
  1215. ///keep track of shapes already serialized
  1216. btHashMap<btHashPtr,btCollisionShape*> serializedShapes;
  1217. for (i=0;i<m_collisionObjects.size();i++)
  1218. {
  1219. btCollisionObject* colObj = m_collisionObjects[i];
  1220. btCollisionShape* shape = colObj->getCollisionShape();
  1221. if (!serializedShapes.find(shape))
  1222. {
  1223. serializedShapes.insert(shape,shape);
  1224. shape->serializeSingleShape(serializer);
  1225. }
  1226. }
  1227. }
  1228. void btCollisionWorld::serialize(btSerializer* serializer)
  1229. {
  1230. serializer->startSerialization();
  1231. serializeCollisionObjects(serializer);
  1232. serializer->finishSerialization();
  1233. }