40 #ifndef HPP_FCL_NARROWPHASE_H 41 #define HPP_FCL_NARROWPHASE_H 55 typedef Eigen::Array<FCL_REAL, 1, 2>
Array2d;
58 template <
typename S1,
typename S2>
60 const S1& s1,
const S2& s2,
Vec3f& guess,
62 switch (gjk_initial_guess) {
64 guess =
Vec3f(1, 0, 0);
65 support_hint.setZero();
69 support_hint = support_func_cached_guess;
72 if (s1.aabb_local.volume() < 0 || s2.aabb_local.volume() < 0) {
74 "computeLocalAABB must have been called on the shapes before " 76 "GJKInitialGuess::BoundingVolumeGuess.",
79 guess.noalias() = s1.aabb_local.center() -
80 (shape.
oR1 * s2.aabb_local.center() + shape.
ot1);
81 support_hint.setZero();
89 if (enable_cached_guess) {
91 support_hint = support_func_cached_guess;
103 template <
typename S1,
typename S2>
106 bool enable_penetration,
Vec3f* contact_points,
107 Vec3f* normal)
const {
109 shape.
set(&s1, &s2, tf1, tf2);
113 details::GJK gjk((
unsigned int)gjk_max_iterations, gjk_tolerance);
114 initialize_gjk(gjk, shape, s1, s2, guess, support_hint);
120 enable_cached_guess) {
127 switch (gjk_status) {
129 if (!enable_penetration && contact_points == NULL && normal == NULL)
133 distance_lower_bound = gjk.
distance;
135 (*normal).noalias() = tf1.
getRotation() * (w0 - w1).normalized();
136 if (contact_points) *contact_points = tf1.
transform((w0 + w1) / 2);
140 epa_max_iterations, epa_tolerance);
147 distance_lower_bound = -epa.
depth;
155 distance_lower_bound = -epa.
depth;
157 if (contact_points) *contact_points = tf1.
transform(w0);
160 distance_lower_bound = -(std::numeric_limits<FCL_REAL>::max)();
166 distance_lower_bound = gjk.
distance;
177 template <
typename S>
182 Vec3f& normal)
const {
186 TriangleP tri(tf_1M2.transform(P1), tf_1M2.transform(P2),
187 tf_1M2.transform(P3));
194 details::GJK gjk((
unsigned int)gjk_max_iterations, gjk_tolerance);
195 initialize_gjk(gjk, shape, s, tri, guess, support_hint);
202 enable_cached_guess) {
209 switch (gjk_status) {
215 normal.noalias() = tf1.
getRotation() * (w0 - w1).normalized();
219 epa_max_iterations, epa_tolerance);
231 distance = -(std::numeric_limits<FCL_REAL>::max)();
252 assert(
false &&
"should not reach type part.");
259 template <
typename S1,
typename S2>
264 FCL_REAL eps(sqrt(std::numeric_limits<FCL_REAL>::epsilon()));
267 shape.
set(&s1, &s2, tf1, tf2);
271 details::GJK gjk((
unsigned int)gjk_max_iterations, gjk_tolerance);
272 initialize_gjk(gjk, shape, s1, s2, guess, support_hint);
276 enable_cached_guess) {
306 Vec3f::Constant(std::numeric_limits<FCL_REAL>::quiet_NaN());
322 epa_max_iterations, epa_tolerance);
330 assert(epa.
depth >= -eps);
337 distance = -(std::numeric_limits<FCL_REAL>::max)();
350 gjk_max_iterations = 128;
351 gjk_tolerance = 1e-6;
352 epa_max_face_num = 128;
353 epa_max_vertex_num = 64;
354 epa_max_iterations = 255;
355 epa_tolerance = 1e-6;
356 enable_cached_guess =
false;
357 cached_guess =
Vec3f(1, 0, 0);
358 support_func_cached_guess = support_func_guess_t::Zero();
359 distance_upper_bound = (std::numeric_limits<FCL_REAL>::max)();
371 cached_guess =
Vec3f(1, 0, 0);
372 support_func_cached_guess = support_func_guess_t::Zero();
373 distance_upper_bound = (std::numeric_limits<FCL_REAL>::max)();
376 epa_max_face_num = 128;
377 epa_max_vertex_num = 64;
378 epa_max_iterations = 255;
379 epa_tolerance = 1e-6;
389 gjk_initial_guess = request.gjk_initial_guess;
391 enable_cached_guess = request.enable_cached_gjk_guess;
392 gjk_variant = request.gjk_variant;
393 gjk_convergence_criterion = request.gjk_convergence_criterion;
394 gjk_convergence_criterion_type = request.gjk_convergence_criterion_type;
395 gjk_tolerance = request.gjk_tolerance;
396 gjk_max_iterations = request.gjk_max_iterations;
398 enable_cached_guess) {
399 cached_guess = request.cached_gjk_guess;
400 support_func_cached_guess = request.cached_support_func_guess;
409 cached_guess =
Vec3f(1, 0, 0);
410 support_func_cached_guess = support_func_guess_t::Zero();
411 distance_upper_bound = (std::numeric_limits<FCL_REAL>::max)();
414 epa_max_face_num = 128;
415 epa_max_vertex_num = 64;
416 epa_max_iterations = 255;
417 epa_tolerance = 1e-6;
427 gjk_initial_guess = request.gjk_initial_guess;
429 enable_cached_guess = request.enable_cached_gjk_guess;
430 gjk_variant = request.gjk_variant;
431 gjk_convergence_criterion = request.gjk_convergence_criterion;
432 gjk_convergence_criterion_type = request.gjk_convergence_criterion_type;
433 gjk_tolerance = request.gjk_tolerance;
434 gjk_max_iterations = request.gjk_max_iterations;
436 enable_cached_guess) {
437 cached_guess = request.cached_gjk_guess;
438 support_func_cached_guess = request.cached_support_func_guess;
443 distance_upper_bound = (std::max)(
444 0., (std::max)(request.distance_upper_bound, request.security_margin));
458 enable_cached_guess ==
467 gjk_convergence_criterion_type ==
495 mutable
bool enable_cached_guess;
522 EIGEN_MAKE_ALIGNED_OPERATOR_NEW
543 #define SHAPE_INTERSECT_SPECIALIZATION_BASE(S1, S2) \ 545 HPP_FCL_DLLAPI bool GJKSolver::shapeIntersect<S1, S2>( \ 546 const S1& s1, const Transform3f& tf1, const S2& s2, \ 547 const Transform3f& tf2, FCL_REAL& distance_lower_bound, bool, \ 548 Vec3f* contact_points, Vec3f* normal) const 550 #define SHAPE_INTERSECT_SPECIALIZATION(S1, S2) \ 551 SHAPE_INTERSECT_SPECIALIZATION_BASE(S1, S2); \ 552 SHAPE_INTERSECT_SPECIALIZATION_BASE(S2, S1) 571 #undef SHAPE_INTERSECT_SPECIALIZATION 572 #undef SHAPE_INTERSECT_SPECIALIZATION_BASE 574 #define SHAPE_DISTANCE_SPECIALIZATION_BASE(S1, S2) \ 576 HPP_FCL_DLLAPI bool GJKSolver::shapeDistance<S1, S2>( \ 577 const S1& s1, const Transform3f& tf1, const S2& s2, \ 578 const Transform3f& tf2, FCL_REAL& dist, Vec3f& p1, Vec3f& p2, \ 581 #define SHAPE_DISTANCE_SPECIALIZATION(S1, S2) \ 582 SHAPE_DISTANCE_SPECIALIZATION_BASE(S1, S2); \ 583 SHAPE_DISTANCE_SPECIALIZATION_BASE(S2, S1) 592 #undef SHAPE_DISTANCE_SPECIALIZATION 593 #undef SHAPE_DISTANCE_SPECIALIZATION_BASE 595 #if !(__cplusplus >= 201103L || (defined(_MSC_VER) && _MSC_VER >= 1600)) 596 #pragma GCC diagnostic push 597 #pragma GCC diagnostic ignored "-Wc99-extensions" 604 #define HPP_FCL_DECLARE_SHAPE_INTERSECT(Shape1, Shape2, doc) \ 607 HPP_FCL_DLLAPI bool GJKSolver::shapeIntersect<Shape1, Shape2>( \ 608 const Shape1& s1, const Transform3f& tf1, const Shape2& s2, \ 609 const Transform3f& tf2, FCL_REAL& distance_lower_bound, \ 610 bool enable_penetration, Vec3f* contact_points, Vec3f* normal) const 611 #define HPP_FCL_DECLARE_SHAPE_INTERSECT_SELF(Shape, doc) \ 612 HPP_FCL_DECLARE_SHAPE_INTERSECT(Shape, Shape, doc) 613 #define HPP_FCL_DECLARE_SHAPE_INTERSECT_PAIR(Shape1, Shape2, doc) \ 614 HPP_FCL_DECLARE_SHAPE_INTERSECT(Shape1, Shape2, doc); \ 615 HPP_FCL_DECLARE_SHAPE_INTERSECT(Shape2, Shape1, doc) 624 const Box& s1,
const Transform3f& tf1,
const Sphere& s2,
625 const Transform3f& tf2,
FCL_REAL& distance_lower_bound,
626 bool enable_penetration,
Vec3f* contact_points,
Vec3f* normal)
const;
628 #ifdef IS_DOXYGEN // for doxygen only 634 const Box& s1,
const Transform3f& tf1,
const Box& s2,
635 const Transform3f& tf2,
FCL_REAL& distance_lower_bound,
636 bool enable_penetration,
Vec3f* contact_points,
Vec3f* normal)
const;
656 #undef HPP_FCL_DECLARE_SHAPE_INTERSECT 657 #undef HPP_FCL_DECLARE_SHAPE_INTERSECT_SELF 658 #undef HPP_FCL_DECLARE_SHAPE_INTERSECT_PAIR 667 #define HPP_FCL_DECLARE_SHAPE_TRIANGLE(Shape, doc) \ 670 HPP_FCL_DLLAPI bool GJKSolver::shapeTriangleInteraction<Shape>( \ 671 const Shape& s, const Transform3f& tf1, const Vec3f& P1, \ 672 const Vec3f& P2, const Vec3f& P3, const Transform3f& tf2, \ 673 FCL_REAL& distance, Vec3f& p1, Vec3f& p2, Vec3f& normal) const 679 #undef HPP_FCL_DECLARE_SHAPE_TRIANGLE 688 #define HPP_FCL_DECLARE_SHAPE_DISTANCE(Shape1, Shape2, doc) \ 691 bool HPP_FCL_DLLAPI GJKSolver::shapeDistance<Shape1, Shape2>( \ 692 const Shape1& s1, const Transform3f& tf1, const Shape2& s2, \ 693 const Transform3f& tf2, FCL_REAL& dist, Vec3f& p1, Vec3f& p2, \ 695 #define HPP_FCL_DECLARE_SHAPE_DISTANCE_SELF(Shape, doc) \ 696 HPP_FCL_DECLARE_SHAPE_DISTANCE(Shape, Shape, doc) 697 #define HPP_FCL_DECLARE_SHAPE_DISTANCE_PAIR(Shape1, Shape2, doc) \ 698 HPP_FCL_DECLARE_SHAPE_DISTANCE(Shape1, Shape2, doc); \ 699 HPP_FCL_DECLARE_SHAPE_DISTANCE(Shape2, Shape1, doc) 717 #undef HPP_FCL_DECLARE_SHAPE_DISTANCE 718 #undef HPP_FCL_DECLARE_SHAPE_DISTANCE_SELF 719 #undef HPP_FCL_DECLARE_SHAPE_DISTANCE_PAIR 722 #if !(__cplusplus >= 201103L || (defined(_MSC_VER) && _MSC_VER >= 1600)) 723 #pragma GCC diagnostic pop GJKConvergenceCriterionType gjk_convergence_criterion_type
Relative or absolute.
Definition: narrowphase.h:510
GJKVariant gjk_variant
Variant to use for the GJK algorithm.
Definition: narrowphase.h:504
void initialize_gjk(details::GJK &gjk, const details::MinkowskiDiff &shape, const S1 &s1, const S2 &s2, Vec3f &guess, support_func_guess_t &support_hint) const
initialize GJK
Definition: narrowphase.h:59
GJKConvergenceCriterionType
Wether the convergence criterion is scaled on the norm of the solution or not.
Definition: data_types.h:93
request to the distance computation
Definition: collision_data.h:392
Definition: data_types.h:83
Definition: data_types.h:89
unsigned int epa_max_iterations
maximum number of iterations used for EPA iterations
Definition: narrowphase.h:481
support_func_guess_t support_hint
Definition: gjk.h:172
#define HPP_FCL_COMPILER_DIAGNOSTIC_IGNORED_DEPRECECATED_DECLARATIONS
Definition: fwd.hh:84
Status
Definition: gjk.h:367
#define HPP_FCL_COMPILER_DIAGNOSTIC_PUSH
Definition: fwd.hh:82
Definition: data_types.h:80
GJKVariant
Variant to use for the GJK algorithm.
Definition: data_types.h:83
GJKSolver(const DistanceRequest &request)
Constructor from a DistanceRequest.
Definition: narrowphase.h:370
Main namespace.
Definition: broadphase_bruteforce.h:44
unsigned int epa_max_face_num
maximum number of simplex face used in EPA algorithm
Definition: narrowphase.h:475
GJKConvergenceCriterion gjk_convergence_criterion
Criterion used to stop GJK.
Definition: narrowphase.h:507
bool enable_cached_guess
Whether smart guess can be provided Use gjk_initial_guess instead.
Definition: narrowphase.h:495
#define HPP_FCL_DECLARE_SHAPE_DISTANCE_SELF(Shape, doc)
Definition: narrowphase.h:695
Half Space: this is equivalent to the Plane in ODE. The separation plane is defined as n * x = d; Poi...
Definition: geometric_shapes.h:729
#define SHAPE_DISTANCE_SPECIALIZATION(S1, S2)
Definition: narrowphase.h:581
bool getClosestPoints(const MinkowskiDiff &shape, Vec3f &w0, Vec3f &w1)
GJKSolver()
Default constructor for GJK algorithm.
Definition: narrowphase.h:349
void set(const ShapeBase *shape0, const ShapeBase *shape1)
Infinite plane.
Definition: geometric_shapes.h:810
class for GJK algorithm
Definition: gjk.h:141
Vec3f ray
Definition: gjk.h:168
Minkowski difference class of two shapes.
Definition: gjk.h:59
class for EPA algorithm
Definition: gjk.h:312
Status evaluate(const MinkowskiDiff &shape, const Vec3f &guess, const support_func_guess_t &supportHint=support_func_guess_t::Zero())
GJK algorithm, given the initial value guess.
bool getClosestPoints(const MinkowskiDiff &shape, Vec3f &w0, Vec3f &w1)
Vec3f getGuessFromSimplex() const
get the guess from current simplex
request to the collision algorithm
Definition: collision_data.h:235
bool operator==(const GJKSolver &other) const
Definition: narrowphase.h:452
#define SHAPE_DISTANCE_SPECIALIZATION_BASE(S1, S2)
Definition: narrowphase.h:574
FCL_REAL distance(const Matrix3f &R0, const Vec3f &T0, const kIOS &b1, const kIOS &b2, Vec3f *P=NULL, Vec3f *Q=NULL)
Approximate distance between two kIOS bounding volumes.
#define HPP_FCL_DEPRECATED_MESSAGE(message)
Definition: deprecated.hh:38
double FCL_REAL
Definition: data_types.h:65
Vec3f ot1
translation from shape1 to shape0 such that .
Definition: gjk.h:79
GJKInitialGuess
Initial guess to use for the GJK algorithm DefaultGuess: Vec3f(1, 0, 0) CachedGuess: previous vector ...
Definition: data_types.h:80
unsigned int epa_max_vertex_num
maximum number of simplex vertex used in EPA algorithm
Definition: narrowphase.h:478
Status
Status of the GJK algorithm: Valid: GJK converged and the shapes are not in collision. Inside: GJK converged and the shapes are in collision. Failed: GJK did not converge.
Definition: gjk.h:165
GJKVariant gjk_variant
Definition: gjk.h:169
Triangle stores the points instead of only indices of points.
Definition: geometric_shapes.h:71
Eigen::Vector2i support_func_guess_t
Definition: data_types.h:72
FCL_REAL depth
Definition: gjk.h:382
FCL_REAL distance
Definition: gjk.h:186
#define SHAPE_INTERSECT_SPECIALIZATION_BASE(S1, S2)
Definition: narrowphase.h:543
bool shapeDistance(const S1 &s1, const Transform3f &tf1, const S2 &s2, const Transform3f &tf2, FCL_REAL &distance, Vec3f &p1, Vec3f &p2, Vec3f &normal) const
distance computation between two shapes
Definition: narrowphase.h:260
Center at zero point sphere.
Definition: geometric_shapes.h:196
Vec3f cached_guess
smart guess
Definition: narrowphase.h:498
Definition: data_types.h:93
bool shapeTriangleInteraction(const S &s, const Transform3f &tf1, const Vec3f &P1, const Vec3f &P2, const Vec3f &P3, const Transform3f &tf2, FCL_REAL &distance, Vec3f &p1, Vec3f &p2, Vec3f &normal) const
intersection checking between one shape and a triangle with transformation
Definition: narrowphase.h:178
Status evaluate(GJK &gjk, const Vec3f &guess)
#define HPP_FCL_COMPILER_DIAGNOSTIC_POP
Definition: fwd.hh:83
#define HPP_FCL_THROW_PRETTY(message, exception)
Definition: fwd.hh:57
bool shapeIntersect(const S1 &s1, const Transform3f &tf1, const S2 &s2, const Transform3f &tf2, FCL_REAL &distance_lower_bound, bool enable_penetration, Vec3f *contact_points, Vec3f *normal) const
intersection checking between two shapes
Definition: narrowphase.h:104
GJKConvergenceCriterion convergence_criterion
Definition: gjk.h:170
#define HPP_FCL_DECLARE_SHAPE_INTERSECT_SELF(Shape, doc)
Definition: narrowphase.h:611
bool operator!=(const GJKSolver &other) const
Definition: narrowphase.h:472
void setDistanceEarlyBreak(const FCL_REAL &dup)
Distance threshold for early break. GJK stops when it proved the distance is more than this threshold...
Definition: gjk.h:245
#define HPP_FCL_DECLARE_SHAPE_INTERSECT_PAIR(Shape1, Shape2, doc)
Definition: narrowphase.h:613
#define SHAPE_INTERSECT_SPECIALIZATION(S1, S2)
Definition: narrowphase.h:550
#define HPP_FCL_DECLARE_SHAPE_DISTANCE_PAIR(Shape1, Shape2, doc)
Definition: narrowphase.h:697
collision and distance solver based on GJK algorithm implemented in fcl (rewritten the code from the ...
Definition: narrowphase.h:54
Eigen::Matrix< FCL_REAL, 3, 1 > Vec3f
Definition: data_types.h:66
GJKConvergenceCriterion
Which convergence criterion is used to stop the algorithm (when the shapes are not in collision)...
Definition: data_types.h:89
FCL_REAL gjk_tolerance
the threshold used in GJK to stop iteration
Definition: narrowphase.h:487
Vec3f normal
Definition: gjk.h:381
Eigen::Array< FCL_REAL, 1, 2 > Array2d
Definition: narrowphase.h:55
GJKSolver(const CollisionRequest &request)
Constructor from a CollisionRequest.
Definition: narrowphase.h:408
support_func_guess_t support_func_cached_guess
smart guess for the support function
Definition: narrowphase.h:513
size_t gjk_max_iterations
maximum number of iterations used for GJK iterations
Definition: narrowphase.h:490
Matrix3f oR1
rotation from shape1 to shape0 such that .
Definition: gjk.h:75
Definition: data_types.h:80
bool hasPenetrationInformation(const MinkowskiDiff &shape)
Definition: gjk.h:230
GJKInitialGuess gjk_initial_guess
which warm start to use for GJK
Definition: narrowphase.h:501
GJKConvergenceCriterionType convergence_criterion_type
Definition: gjk.h:171
FCL_REAL epa_tolerance
the threshold used in EPA to stop iteration
Definition: narrowphase.h:484
#define HPP_FCL_DECLARE_SHAPE_TRIANGLE(Shape, doc)
Definition: narrowphase.h:667
#define HPP_FCL_DLLAPI
Definition: config.hh:64
Definition: data_types.h:80
FCL_REAL distance_upper_bound
Distance above which the GJK solver stoppes its computations and processes to an early stopping...
Definition: narrowphase.h:519