Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Implement capsule capsule distance function instead of using gjk algorithm #37

Closed
wants to merge 3 commits into from

Conversation

florent-lamiraux
Copy link
Contributor

Default computation of closest points when calling function fcl::distance uses libccd gjk algorithm implementation and then tries to postprocess the simplex structure built by libccd to guess the closest points. This latter computation seems incorrect, moreover for some shapes, it is not as efficient as implementing a specific function.

This pull request does so for capsule-capsule distance and collision computations by specializing template functions ShapeShapeDistance and ShapeShapeCollision template functions.

The algorithm has been tested on 274 self-collision pairs using a model of HRP2 robot with the following performance:

  • 37 micro-seconds with this implementation,
  • 110 micro-seconds with the gjk implementation.

  - use API distance function instead of selecting gjk solver.
…rithm.

  - copied code from Wildmagic (http://www.geometrictools.com) nodified
    boost license.
  - collision detection calls distance function.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant