dali-physics/third-party/bullet3/src/BulletCollision/CollisionDispatch/btConvexConvexAlgorithm.h

   1 /*
   2 Bullet Continuous Collision Detection and Physics Library
   3 Copyright (c) 2003-2006 Erwin Coumans  https://bulletphysics.org
   4
   5 This software is provided 'as-is', without any express or implied warranty.
   6 In no event will the authors be held liable for any damages arising from the use of this software.
   7 Permission is granted to anyone to use this software for any purpose,
   8 including commercial applications, and to alter it and redistribute it freely,
   9 subject to the following restrictions:
  10
  11 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.
  12 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
  13 3. This notice may not be removed or altered from any source distribution.
  14 */
  15
  16 #ifndef BT_CONVEX_CONVEX_ALGORITHM_H
  17 #define BT_CONVEX_CONVEX_ALGORITHM_H
  18
  19 #include "btActivatingCollisionAlgorithm.h"
  20 #include "BulletCollision/NarrowPhaseCollision/btGjkPairDetector.h"
  21 #include "BulletCollision/NarrowPhaseCollision/btPersistentManifold.h"
  22 #include "BulletCollision/BroadphaseCollision/btBroadphaseProxy.h"
  23 #include "BulletCollision/NarrowPhaseCollision/btVoronoiSimplexSolver.h"
  24 #include "btCollisionCreateFunc.h"
  25 #include "btCollisionDispatcher.h"
  26 #include "LinearMath/btTransformUtil.h"  //for btConvexSeparatingDistanceUtil
  27 #include "BulletCollision/NarrowPhaseCollision/btPolyhedralContactClipping.h"
  28
  29 class btConvexPenetrationDepthSolver;
  30
  31 ///Enabling USE_SEPDISTANCE_UTIL2 requires 100% reliable distance computation. However, when using large size ratios GJK can be imprecise
  32 ///so the distance is not conservative. In that case, enabling this USE_SEPDISTANCE_UTIL2 would result in failing/missing collisions.
  33 ///Either improve GJK for large size ratios (testing a 100 units versus a 0.1 unit object) or only enable the util
  34 ///for certain pairs that have a small size ratio
  35
  36 //#define USE_SEPDISTANCE_UTIL2 1
  37
  38 ///The convexConvexAlgorithm collision algorithm implements time of impact, convex closest points and penetration depth calculations between two convex objects.
  39 ///Multiple contact points are calculated by perturbing the orientation of the smallest object orthogonal to the separating normal.
  40 ///This idea was described by Gino van den Bergen in this forum topic http://www.bulletphysics.com/Bullet/phpBB3/viewtopic.php?f=4&t=288&p=888#p888
  41 class btConvexConvexAlgorithm : public btActivatingCollisionAlgorithm
  42 {
  43 #ifdef USE_SEPDISTANCE_UTIL2
  44         btConvexSeparatingDistanceUtil m_sepDistance;
  45 #endif
  46         btConvexPenetrationDepthSolver* m_pdSolver;
  47
  48         btVertexArray worldVertsB1;
  49         btVertexArray worldVertsB2;
  50
  51         bool m_ownManifold;
  52         btPersistentManifold* m_manifoldPtr;
  53         bool m_lowLevelOfDetail;
  54
  55         int m_numPerturbationIterations;
  56         int m_minimumPointsPerturbationThreshold;
  57
  58         ///cache separating vector to speedup collision detection
  59
  60 public:
  61         btConvexConvexAlgorithm(btPersistentManifold* mf, const btCollisionAlgorithmConstructionInfo& ci, const btCollisionObjectWrapper* body0Wrap, const btCollisionObjectWrapper* body1Wrap, btConvexPenetrationDepthSolver* pdSolver, int numPerturbationIterations, int minimumPointsPerturbationThreshold);
  62
  63         virtual ~btConvexConvexAlgorithm();
  64
  65         virtual void processCollision(const btCollisionObjectWrapper* body0Wrap, const btCollisionObjectWrapper* body1Wrap, const btDispatcherInfo& dispatchInfo, btManifoldResult* resultOut);
  66
  67         virtual btScalar calculateTimeOfImpact(btCollisionObject* body0, btCollisionObject* body1, const btDispatcherInfo& dispatchInfo, btManifoldResult* resultOut);
  68
  69         virtual void getAllContactManifolds(btManifoldArray& manifoldArray)
  70         {
  71                 ///should we use m_ownManifold to avoid adding duplicates?
  72                 if (m_manifoldPtr && m_ownManifold)
  73                         manifoldArray.push_back(m_manifoldPtr);
  74         }
  75
  76         void setLowLevelOfDetail(bool useLowLevel);
  77
  78         const btPersistentManifold* getManifold()
  79         {
  80                 return m_manifoldPtr;
  81         }
  82
  83         struct CreateFunc : public btCollisionAlgorithmCreateFunc
  84         {
  85                 btConvexPenetrationDepthSolver* m_pdSolver;
  86                 int m_numPerturbationIterations;
  87                 int m_minimumPointsPerturbationThreshold;
  88
  89                 CreateFunc(btConvexPenetrationDepthSolver* pdSolver);
  90
  91                 virtual ~CreateFunc();
  92
  93                 virtual btCollisionAlgorithm* CreateCollisionAlgorithm(btCollisionAlgorithmConstructionInfo& ci, const btCollisionObjectWrapper* body0Wrap, const btCollisionObjectWrapper* body1Wrap)
  94                 {
  95                         void* mem = ci.m_dispatcher1->allocateCollisionAlgorithm(sizeof(btConvexConvexAlgorithm));
  96                         return new (mem) btConvexConvexAlgorithm(ci.m_manifold, ci, body0Wrap, body1Wrap, m_pdSolver, m_numPerturbationIterations, m_minimumPointsPerturbationThreshold);
  97                 }
  98         };
  99 };
 100
 101 #endif  //BT_CONVEX_CONVEX_ALGORITHM_H