Journal article icon

Journal article

Improving the GJK algorithm for faster and more reliable distance queries between convex objects

Abstract:

This article presents a new version of the Gilbert-Johnson-Keerthi (GJK) algorithm that circumvents the shortcomings introduced by degenerate geometries. The original Johnson algorithm and Backup procedure are replaced by a distance subalgorithm that is faster and accurate to machine precision, thus guiding the GJK algorithm toward a shorter search path in less computing time. Numerical tests demonstrate that this effectively is a more robust procedure. In particular, when the objects are fou...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
  • (Accepted manuscript, pdf, 4.9MB)
Publisher copy:
10.1145/3083724

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Engineering Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Engineering Science
Role:
Author
More from this funder
Grant:
Strategic Investment in LOw-carbon Engine Technology (SILOET) project
More from this funder
Grant:
Strategic Investment in LOw-carbon Engine Technology (SILOET) project
Publisher:
Association for Computing Machinery Publisher's website
Journal:
ACM Transactions on Graphics Journal website
Volume:
36
Issue:
3
Article number:
30
Publication date:
2017-06-15
Acceptance date:
2017-03-15
DOI:
ISSN:
1557-7368
Keywords:
Pubs id:
pubs:701838
UUID:
uuid:69c743d9-73de-4aff-8e6f-b4dd7c010907
Local pid:
pubs:701838
Deposit date:
2017-06-25

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP