Logo Search packages:      
Sourcecode: blender version File versions  Download package

btVoronoiSimplexSolver Class Reference

#include <btVoronoiSimplexSolver.h>

List of all members.


Detailed Description

btVoronoiSimplexSolver is an implementation of the closest point distance algorithm from a 1-4 points simplex to the origin. Can be used with GJK, as an alternative to Johnson distance algorithm.

Definition at line 90 of file btVoronoiSimplexSolver.h.


Public Member Functions

void addVertex (const btVector3 &w, const btVector3 &p, const btVector3 &q)
void backup_closest (btVector3 &v)
bool closest (btVector3 &v)
bool closestPtPointTetrahedron (const btVector3 &p, const btVector3 &a, const btVector3 &b, const btVector3 &c, const btVector3 &d, btSubSimplexClosestResult &finalResult)
bool closestPtPointTriangle (const btVector3 &p, const btVector3 &a, const btVector3 &b, const btVector3 &c, btSubSimplexClosestResult &result)
void compute_points (btVector3 &p1, btVector3 &p2)
bool emptySimplex () const
bool fullSimplex () const
int getSimplex (btVector3 *pBuf, btVector3 *qBuf, btVector3 *yBuf) const
bool inSimplex (const btVector3 &w)
btScalar maxVertex ()
int numVertices () const
int pointOutsideOfPlane (const btVector3 &p, const btVector3 &a, const btVector3 &b, const btVector3 &c, const btVector3 &d)
 Test if point p and d lie on opposite sides of plane through abc.
void reduceVertices (const btUsageBitfield &usedVerts)
void removeVertex (int index)
void reset ()
bool updateClosestVectorAndPoints ()

Public Attributes

btSubSimplexClosestResult m_cachedBC
btVector3 m_cachedP1
btVector3 m_cachedP2
btVector3 m_cachedV
bool m_cachedValidClosest
btVector3 m_lastW
bool m_needsUpdate
int m_numVertices
btVector3 m_simplexPointsP [VORONOI_SIMPLEX_MAX_VERTS]
btVector3 m_simplexPointsQ [VORONOI_SIMPLEX_MAX_VERTS]
btVector3 m_simplexVectorW [VORONOI_SIMPLEX_MAX_VERTS]

The documentation for this class was generated from the following files:

Generated by  Doxygen 1.6.0   Back to index