A fast and robust GJK implementation for collision detection of convex objects

G.J.A. Bergen, van den

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
2 Downloads (Pure)

Abstract

This paper presents an implementation of the Gilbert-Johnson-Keerthi algorithm for computing the distance between convex objects, that has improved performance, robustness, and versatility over earlier implementations. The algorithm presented here is especially fit for use in collision detection of objects modeled using various types of geometric primitives, such as boxes, cones, and spheres, and their images under affine transformation, for instance, as described in VRML.
Original languageEnglish
Pages (from-to)7-25
Number of pages19
JournalJournal of Graphics Tools
Volume4
Issue number2
DOIs
Publication statusPublished - 1999

Fingerprint Dive into the research topics of 'A fast and robust GJK implementation for collision detection of convex objects'. Together they form a unique fingerprint.

  • Cite this