-
Notifications
You must be signed in to change notification settings - Fork 38
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
enhancement #30
Comments
First of all, thanks a lot for this piece of software. I was looking quite a while to find something like this. |
@MattiaMontanari At v3.0.1, the return value of lambdas seems garbage.How to add the lambdas to the current branch? |
In #12 ,the mentioned simplex.p ,simplex.q and simplex.lambdas also removed in latest branch. |
@ywyw2015 yes, I removed lambdas. My first implementation returned witness points, but it updated the barycentric coordinates (lambdas) at each GJK iteration. They brought some overheads and made the code more complex. So I removed them and focused on the most basic distance query. Given the demand, I do intend to add the computation of witness points, but I still need to found the time... If you want to give it a go here's my idea: preserve performance by computing the witness points only after gjk has converged. |
Thank you for your reply, I will go to learn more about it according to your suggestion |
this code just outputs the minimum distance between convex objects and does not provide the closest points (witness points) on objects.
How to add this feature to the current code?
The text was updated successfully, but these errors were encountered: