The GJK distance algorithm: an interval version for incremental motions

DOI10.1023/B:NUMA.0000049460.50984.B8MaRDI QIDQ2387753zbMATH OpenFDO

Authors E. Dyllong, Wolfram Luther

Publication date 5 September 2005

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/B:NUMA.0000049460.50984.B8

zbMATH Keywords

convex polyhedradistance computingGJK algorithminterval arithmeticresult verification

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Algorithms with automatic result verification (65G20) Artificial intelligence for robotics (68T40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On the application of accurate distance algorithms to multibody simulations
• scientific article; zbMATH DE number 1440920
• An accurate distance-calculation algorithm for convex polyhedra
• A hierarchical method for real-time distance computation among moving convex bodies
• The distance between convex sets with Minkowski sum structure: application to collision detection

Cited in

(4)

• On the application of accurate distance algorithms to multibody simulations
• A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure
• THE JANUS TEST: A HIERARCHICAL ALGORITHM FOR COMPUTING DIRECTION AND DISTANCE VECTORS (EXTENDED VERSION)*
• Efficient maintenance and self-collision testing for kinematic chains

Describes a project that uses

Uses Software

• PROFIL/BIAS

This page was built for publication: The GJK distance algorithm: an interval version for incremental motions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2387753)