Implement capsule capsule distance function instead of using gjk algorithm #37
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
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: