collision detector based on SSV(Sphere Swept Volume)
[詳細]
#include <SSVTreeCollider.h>
Public メソッド |
| SSVTreeCollider () |
| constructor
|
| ~SSVTreeCollider () |
| destructor
|
bool | Distance (BVTCache &cache, float &minD, Point &point0, Point &point1, const Matrix4x4 *world0=null, const Matrix4x4 *world1=null) |
| compute the minimum distance and the closest points
|
bool | Collide (BVTCache &cache, double tolerance, const Matrix4x4 *world0=null, const Matrix4x4 *world1=null) |
| detect collision between links.
|
説明
collision detector based on SSV(Sphere Swept Volume)
コンストラクタとデストラクタ
SSVTreeCollider::SSVTreeCollider |
( |
| ) |
|
SSVTreeCollider::~SSVTreeCollider |
( |
| ) |
|
|
inline |
関数
bool SSVTreeCollider::Collide |
( |
BVTCache & |
cache, |
|
|
double |
tolerance, |
|
|
const Matrix4x4 * |
world0 = null , |
|
|
const Matrix4x4 * |
world1 = null |
|
) |
| |
detect collision between links.
- 引数
-
cache | |
tolerance | If distance between links is smaller than this value, it is regarded as collision |
world0 | transformation of the first link |
world1 | transformation of the second link |
- 戻り値
- true if collision is detected, false otherwise
bool SSVTreeCollider::Distance |
( |
BVTCache & |
cache, |
|
|
float & |
minD, |
|
|
Point & |
point0, |
|
|
Point & |
point1, |
|
|
const Matrix4x4 * |
world0 = null , |
|
|
const Matrix4x4 * |
world1 = null |
|
) |
| |
compute the minimum distance and the closest points
- 引数
-
cache | |
minD | the minimum distance |
point0 | the closest point on the first link |
point1 | the closest point on the second link |
world0 | transformation of the first link |
world1 | transformation of the second link |
- 戻り値
- true if computed successfully, false otherwise
このクラスの説明は次のファイルから生成されました: