|
bool | intersects (const AnyConvex< T, N > &shape_a, const AnyConvex< T, N > &shape_b) |
|
const Simplex< T, N > & | simplex () const |
|
|
index_t | iterations = 0 |
| number of GJK iterations taken to produce the last intersection result.
|
|
index_t | max_iterations = 10 * (1 << (N - 2)) |
|
Vec< T, N > | separation_axis = Vec<T,N>::unit_x |
| axis separating the shapes in the previous intersection test, if they overlapped.
|
|
bool | was_degenerate = false |
| set to true iff the last intersection test resulted in a degenerate simplex
|
|
The documentation for this struct was generated from the following file: