Revision as of 00:30, 27 May 2023 edit Rightfold (talk \| contribs) 51 edits m →Pseudocode: Union with singleton set of A instead of with A ← Previous edit		Latest revision as of 14:57, 18 June 2024 edit undo Penguinpoweredjimbo (talk \| contribs) 26 edits Add link to excellent summary of GJK algorithm
Line 50: [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. *[https://computerwebsite.net/writing/gjk "the Gilbert–Johnson–Keerthi algorithm explained as simply as possible"] {{DEFAULTSORT:Gilbert-Johnson-Keerthi distance algorithm}}

Gilbert–Johnson–Keerthi distance algorithm: Difference between revisions