Search
Now showing items 1-1 of 1
A new algorithm for computing minimum distance
(IEEE Conference Publications, 2000)
This paper presents a new algorithm for computing the minimum distance between convex polyhedras. The algorithm of Gilbert-Johnson-Keerthi (GJK) and the algorithm of Lin-Canny (LC) are well-known fast solutions to the ...