Skip to search formSkip to main contentSkip to account menu

Gilbert–Johnson–Keerthi distance algorithm

Known as: GJK, Gilbert-Johnson-Keerthi distance algorithm 
The Gilbert–Johnson–Keerthi distance algorithm is a method of determining the minimum distance between two convex sets. Unlike many other distance… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
AlgorithmCollision detectionConvex setList of algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
1 ON-ORBIT SATELLITE SERVICING USING MULTIPLE TETHERED ROBOTS
Rapid advancement and miniaturization of earth-orbiting spacecraft has led to the rise of constellations that perform global… 
2018
2018
PERBANDINGAN RAWAT INAP ULANG PASIEN GAGAL JANTUNG KRONIK BERDASARKAN FRAKSI EJEKSI VENTRIKEL KIRI
Latar belakang : Gagal Jantung Kronik (GJK) terkait dengan dampak kerugian besar pada kualitas hidup dan harapan hidup. Pada… 
2015
2015
Interlocked Executives and Insider Board Members: An Empirical Analysis
This paper asked the question of whether the behavior and compensation of interlocked executives and non-independent board of… 
2015
2015
A New Packing Code for Creating Mirostructures of Propellants and Explosives
In this paper we present a particle packing algorithm for the generation of packings of polydisperse convex particles, such as… 
2011
2011
Recognition of Digital Hyperplanes and Level Layers with Forbidden Points
We consider a new problem of recognition of digital primitives - digital hyperplanes or level layers - arising in a new practical… 
2009
2009
On the origin of transport non-universality and piezoresistivity in segregated conductor-insulator composites and application to thick-film resistors
In this thesis we address the description of electrical transport properties of disordered conductor-insulator composites, mostly… 
2008
2008
Mixed reality software for dental simulation system
This paper presents a dental simulation system. This is prepared for students in the faculty of dentistry so as to examine skills… 
2008
2008
Adaptive surface decomposition for the distance computation of arbitrarily shaped objects
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the… 
2006
2006
GJK for Deformable Object Collision Detection
GJK is one of the main methods for distance calculations between convex objects. In this article, the adaptation of GJK for… 
Review
2000
Review
2000
New Metrics for Evaluation of Collision Detection Techniques
In this paper we describe new metrics for the evaluation of collision detection techniques. Through careful study of common… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)