OpenGJK for C, C# and Matlab: Reliable solutions to distance queries between convex bodies in three-dimensional space | Zendy

Mattia Montanari | Zendy; Nik Petrinić | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

OpenGJK for C, C# and Matlab: Reliable solutions to distance queries between convex bodies in three-dimensional space

Author(s) -

Mattia Montanari,

Nik Petrinić

Publication year - 2018

Publication title -

softwarex

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.528

H-Index - 21

ISSN - 2352-7110

DOI - 10.1016/j.softx.2018.10.002

Subject(s) - computer science , matlab , rendering (computer graphics) , regular polygon , task (project management) , motion planning , collision detection , path (computing) , robot , computer vision , algorithm , artificial intelligence , collision , mathematics , programming language , geometry , management , economics

Implementing a reliable algorithm for computing the distance between convex bodies is an involved and time-consuming task. Common applications of these algorithms include robot path planning, image rendering and collision detection. However, each application has strict requirements in terms of either accuracy or speed, making the implementation less portable and more difficult. This paper introduces openGJK, a library for solving distance queries between convex bodies that are simply described by lists of points. OpenGJK features the fastest and most accurate version of the Gilbert–Johnson–Keerthi (GJK) algorithm published to date, is written in C, cross-platform and comes with interfaces for C# and Matlab.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research