HomeSort by relevance Sort by last modified time
    Searched refs:m_simplexSolver (Results 1 - 14 of 14) sorted by null

  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/NarrowPhaseCollision/
btGjkConvexCast.h 32 btSimplexSolverInterface* m_simplexSolver;
btSubSimplexConvexCast.h 30 btSimplexSolverInterface* m_simplexSolver;
btSubSimplexConvexCast.cpp 26 :m_simplexSolver(simplexSolver),
46 m_simplexSolver->reset();
109 //m_simplexSolver->reset();
118 if (!m_simplexSolver->inSimplex(w))
119 m_simplexSolver->addVertex( w, supVertexA , supVertexB);
121 if (m_simplexSolver->closest(v))
129 //printf("numverts = %i\n",m_simplexSolver->numVertices());
153 m_simplexSolver->compute_points(hitA,hitB);
btContinuousConvexCollision.h 32 btSimplexSolverInterface* m_simplexSolver;
btGjkPairDetector.cpp 43 m_simplexSolver(simplexSolver),
59 m_simplexSolver(simplexSolver),
131 m_simplexSolver->reset();
167 if (m_simplexSolver->inSimplex(w))
191 m_simplexSolver->addVertex(w, pWorld, qWorld);
195 if (!m_simplexSolver->closest(newCachedSeparatingAxis))
224 //redundant m_simplexSolver->compute_points(pointOnA, pointOnB);
229 // m_simplexSolver->backup_closest(m_cachedSeparatingAxis);
258 bool check = (!m_simplexSolver->fullSimplex());
259 //bool check = (!m_simplexSolver->fullSimplex() && squaredDistance > SIMD_EPSILON * m_simplexSolver->maxVertex())
    [all...]
btGjkConvexCast.cpp 31 :m_simplexSolver(simplexSolver),
46 m_simplexSolver->reset();
82 btGjkPairDetector gjk(m_convexA,m_convexB,m_simplexSolver,0);//m_penetrationDepthSolver);
btContinuousConvexCollision.cpp 30 :m_simplexSolver(simplexSolver),
38 :m_simplexSolver(0),
53 m_simplexSolver->reset();
54 btGjkPairDetector gjk(m_convexA,m_convexB1,m_convexA->getShapeType(),m_convexB1->getShapeType(),m_convexA->getMargin(),m_convexB1->getMargin(),m_simplexSolver,m_penetrationDepthSolver);
btGjkPairDetector.h 36 btSimplexSolverInterface* m_simplexSolver;
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/
btConvex2dConvex2dAlgorithm.h 35 btSimplexSolverInterface* m_simplexSolver;
77 btSimplexSolverInterface* m_simplexSolver;
88 return new(mem) btConvex2dConvex2dAlgorithm(ci.m_manifold,ci,body0Wrap,body1Wrap,m_simplexSolver,m_pdSolver,m_numPerturbationIterations,m_minimumPointsPerturbationThreshold);
btConvexConvexAlgorithm.h 45 btSimplexSolverInterface* m_simplexSolver;
90 btSimplexSolverInterface* m_simplexSolver;
101 return new(mem) btConvexConvexAlgorithm(ci.m_manifold,ci,body0Wrap,body1Wrap,m_simplexSolver,m_pdSolver,m_numPerturbationIterations,m_minimumPointsPerturbationThreshold);
btDefaultCollisionConfiguration.h 64 btVoronoiSimplexSolver* m_simplexSolver;
107 return m_simplexSolver;
btConvex2dConvex2dAlgorithm.cpp 52 m_simplexSolver = simplexSolver;
62 m_simplexSolver(simplexSolver),
125 btGjkPairDetector gjkPairDetector(min0,min1,m_simplexSolver,m_pdSolver);
btDefaultCollisionConfiguration.cpp 48 m_simplexSolver = new (mem)btVoronoiSimplexSolver();
62 m_convexConvexCreateFunc = new(mem) btConvexConvexAlgorithm::CreateFunc(m_simplexSolver,m_pdSolver);
195 m_simplexSolver->~btVoronoiSimplexSolver();
196 btAlignedFree(m_simplexSolver);
btConvexConvexAlgorithm.cpp 186 m_simplexSolver = simplexSolver;
196 m_simplexSolver(simplexSolver),
353 btGjkPairDetector gjkPairDetector(min0,min1,m_simplexSolver,m_pdSolver);

Completed in 153 milliseconds