Gilbert–Johnson–Keerthi distance algorithm: Difference between revisions

Content deleted Content added
Replaced link to original article, with an article that does not require login.
m Add reference for acceleration of GJK algorithm
Line 48:
*[https://mollyrocket.com/849 A 52 minute video lecture on implementing Gilbert-Johnson-Keerthi]
*[https://ora.ox.ac.uk/objects/uuid:69c743d9-73de-4aff-8e6f-b4dd7c010907/download_file?safe_filename=GJK.PDF&file_format=application%2Fpdf&type_of_work=Journal+article "Improving the GJK algorithm for faster and more reliable distance queries between convex objects"], Montanari, Petrinic and Barbieri.
*[https://arxiv.org/pdf/2205.09663.pdf "Collision Detection Accelerated: An Optimization Perspective"], Montaut, Le Lidec, Petrik, Sivic and Carpentier. This research article notably shows how the original GJK algorithm can be accelerated by exploiting Nesterov-type acceleration strategies, contributing to lowering the overall computational complexity of GJK.
 
{{DEFAULTSORT:Gilbert-Johnson-Keerthi distance algorithm}}