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
Parents
17
1–5 of 17
30
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 30
22
University of Oxford
Oxford, United Kingdom
4 h-index
7 publications
556 citations

Université Paris Sciences et Lettres
Paris, France
2 h-index
3 publications
60 citations

Czech Technical University in Prague
Prague, Czechia
2 h-index
2 publications
40 citations
Queen Mary University of London
London, United Kingdom
2 h-index
2 publications
111 citations
Universitat Politècnica de València
Valencia, Spain
2 h-index
4 publications
136 citations
École Normale Supérieure
Bujumbura, Burundi
1 h-index
3 publications
60 citations

Swansea University
Swansea, United Kingdom
1 h-index
1 publications
50 citations
Département d'Informatique
Paris, France
1 h-index
3 publications
60 citations
1–8 of 22
TOG · 3 publications · 511 citations
3
h-index
1 publications · 24 citations
1
h-index
1 publications · 14 citations
1
h-index
1 publications · 34 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5