Triangle distance functions.
More...
#include <hpp/fcl/intersect.h>
|
static void | segPoints (const Vec3f &P, const Vec3f &A, const Vec3f &Q, const Vec3f &B, Vec3f &VEC, Vec3f &X, Vec3f &Y) |
| Returns closest points between an segment pair. More...
|
|
static FCL_REAL | sqrTriDistance (const Vec3f S[3], const Vec3f T[3], Vec3f &P, Vec3f &Q) |
| Compute squared distance between triangles. More...
|
|
static FCL_REAL | sqrTriDistance (const Vec3f &S1, const Vec3f &S2, const Vec3f &S3, const Vec3f &T1, const Vec3f &T2, const Vec3f &T3, Vec3f &P, Vec3f &Q) |
|
static FCL_REAL | sqrTriDistance (const Vec3f S[3], const Vec3f T[3], const Matrix3f &R, const Vec3f &Tl, Vec3f &P, Vec3f &Q) |
| Compute squared distance between triangles. More...
|
|
static FCL_REAL | sqrTriDistance (const Vec3f S[3], const Vec3f T[3], const Transform3f &tf, Vec3f &P, Vec3f &Q) |
| Compute squared distance between triangles. More...
|
|
static FCL_REAL | sqrTriDistance (const Vec3f &S1, const Vec3f &S2, const Vec3f &S3, const Vec3f &T1, const Vec3f &T2, const Vec3f &T3, const Matrix3f &R, const Vec3f &Tl, Vec3f &P, Vec3f &Q) |
| Compute squared distance between triangles. More...
|
|
static FCL_REAL | sqrTriDistance (const Vec3f &S1, const Vec3f &S2, const Vec3f &S3, const Vec3f &T1, const Vec3f &T2, const Vec3f &T3, const Transform3f &tf, Vec3f &P, Vec3f &Q) |
| Compute squared distance between triangles. More...
|
|
Triangle distance functions.
Returns closest points between an segment pair.
The first segment is P + t * A The second segment is Q + t * B X, Y are the closest points on the two segments VEC is the vector between X and Y
Compute squared distance between triangles.
- Parameters
-
S | and T are two triangles |
R,Tl,rotation | and translation applied to T, |
- Return values
-
P,Q | closest points if triangles do not intersect. |
- Returns
- squared distance if triangles do not intersect, 0 otherwise. If the triangles are disjoint, P and Q give the closet points of S and T respectively. However, if the triangles overlap, P and Q are basically a random pair of points from the triangles, not coincident points on the intersection of the triangles, as might be expected.
Compute squared distance between triangles.
- Parameters
-
S | and T are two triangles |
tf,rotation | and translation applied to T, |
- Return values
-
P,Q | closest points if triangles do not intersect. |
- Returns
- squared distance if triangles do not intersect, 0 otherwise. If the triangles are disjoint, P and Q give the closet points of S and T respectively. However, if the triangles overlap, P and Q are basically a random pair of points from the triangles, not coincident points on the intersection of the triangles, as might be expected.
Compute squared distance between triangles.
- Parameters
-
S1,S2,S3 | and T1, T2, T3 are triangle vertices |
R,Tl,rotation | and translation applied to T1, T2, T3, |
- Return values
-
P,Q | closest points if triangles do not intersect. |
- Returns
- squared distance if triangles do not intersect, 0 otherwise. If the triangles are disjoint, P and Q give the closet points of S and T respectively. However, if the triangles overlap, P and Q are basically a random pair of points from the triangles, not coincident points on the intersection of the triangles, as might be expected.
Compute squared distance between triangles.
- Parameters
-
S1,S2,S3 | and T1, T2, T3 are triangle vertices |
tf,rotation | and translation applied to T1, T2, T3, |
- Return values
-
P,Q | closest points if triangles do not intersect. |
- Returns
- squared distance if triangles do not intersect, 0 otherwise. If the triangles are disjoint, P and Q give the closet points of S and T respectively. However, if the triangles overlap, P and Q are basically a random pair of points from the triangles, not coincident points on the intersection of the triangles, as might be expected.