Gjk Algorithm

The GJK Algorithm is a computational geometry method that iteratively determines the minimum distance between two convex sets by exploiting the Minkowski difference and a supporting point framework.

17

Publications

1.3K

Citations

30

Authors

22

Institutions

Publications per year

2017–2026

7

Variants

Gilbert-johnson-keerthi Algorithm

Authors

30

  1. MM
    Mattia Montanari

    University of Oxford, United Kingdom

    3 publications · 135 citations

    3

    h-index

  2. NP
    Nik Petrinić

    University of Oxford, United Kingdom

    3 publications · 135 citations

    3

    h-index

  3. JT
    Josep Tornero

    Universitat Politècnica de València, Spain

    2 publications · 68 citations

    2

    h-index

  4. EJ
    Enrique J. Bernabeu

    Universitat Politècnica de València, Spain

    2 publications · 68 citations

    2

    h-index

  5. QL
    Quentin Le Lidec

    Université Paris Sciences et Lettres, France

    1 publications · 20 citations

    2

    h-index

1–5 of 30

Venues

  1. ACM Transactions on Graphics

    TOG · 3 publications · 511 citations

    3

    h-index

  2. SoftwareX

    1 publications · 24 citations

    1

    h-index

  3. Ukrainian Mathematical Journal

    1 publications · 14 citations

    1

    h-index

  4. IEEE Transactions on Robotics and Automation

    1 publications · 34 citations

    1

    h-index

  5. Numerical Algorithms

    1 publications · 11 citations

    1

    h-index

1–5