Classes |
| struct | SimplexF |
| struct | SimplexHorizon |
| struct | SimplexList |
Public Types |
| enum | Status {
Valid,
Touching,
Degenerated,
NonConvex,
InvalidHull,
OutOfFaces,
OutOfVertices,
AccuracyReached,
FallBack,
Failed
} |
Public Member Functions |
| | EPA (unsigned int max_face_num_, unsigned int max_vertex_num_, unsigned int max_iterations_, FCL_REAL tolerance_) |
| Status | evaluate (GJK &gjk, const Vec3f &guess) |
| bool | expand (size_t pass, SimplexV *w, SimplexF *f, size_t e, SimplexHorizon &horizon) |
| | the goal is to add a face connecting vertex w and face edge f[e]
|
| SimplexF * | findBest () |
| | Find the best polytope face to split.
|
| bool | getEdgeDist (SimplexF *face, SimplexV *a, SimplexV *b, FCL_REAL &dist) |
| void | initialize () |
| SimplexF * | newFace (SimplexV *a, SimplexV *b, SimplexV *c, bool forced) |
| | ~EPA () |
Public Attributes |
| FCL_REAL | depth |
| SimplexF * | fc_store |
| SimplexList | hull |
| size_t | nextsv |
| Vec3f | normal |
| GJK::Simplex | result |
| Status | status |
| SimplexList | stock |
| SimplexV * | sv_store |
Private Types |
| typedef GJK::SimplexV | SimplexV |
Static Private Member Functions |
| static void | bind (SimplexF *fa, size_t ea, SimplexF *fb, size_t eb) |
Private Attributes |
| unsigned int | max_face_num |
| unsigned int | max_iterations |
| unsigned int | max_vertex_num |
| FCL_REAL | tolerance |
class for EPA algorithm
Definition at line 187 of file gjk.h.