Joseph Mirabel authored Jan 31, 2019 and Joseph Mirabel committed Feb 07, 2019

* Commands executed:
* find include src test -iname "*.h" -type f -exec sed -i "s/^namespace fcl/namespace hpp\n{\nnamespace fcl/; \$i} // namespace hpp\n" {} \;
* find src -iname "*.cpp" -type f -exec sed -i "s/^namespace fcl/namespace hpp\n{\nnamespace fcl/; \$a\\\n} // namespace hpp" {} \;
* find test/ -iname "*.cpp" -type f -exec sed -i "s/using namespace fcl/using namespace hpp::fcl/; s/fcl::/hpp::fcl::/g" {} \;

  If GJK returns fail, assume no collision.
  Fix computation of closest points.

  to check that if no collision lowed bound of distance is positive.

  - if collision is very small epa algorithm may return slightly negative
    penetration.

  If GJK::evaluate fails to converge but that the distance of the origin to the
  simplex converges to 0, set distance and return fail. In shapeDistance,
  return collision if GJK::evaluate failed.

  - do not run EPA algorithm to compute penetration depth and normal.

  - Collision detection calls distance computation and returns collision
    if the distance between objects is below the security margin.
  - This modification requires a modification in the structure of the software
    to make collision detection and distance computation closer.
  - GJKSolver_indep::shapeTriangleDistance and
    GJKSolver_indep::shapeTriangleIntersect have been replaced by
    GJKSolver_indep::shapeTriangleInteraction.

  instead of -1.

  Simplex::c -> Simplex::vertex.
  Simplex::p -> Simplex::coefficient.