Key points are not available for this paper at this time.
Abstract This paper presents an implementation of the Gilbert-Johnson-Keerthi algorithm for comput ing the distance between convex objects, that has improved performance, robustness, and versatility over earlier implementations. The algorithm presented here is especially suitable for use in collision detection of objects modeled using various types of geometric primitives, such as boxes, cones, and spheres, and their images under affine transformation.
Gino van den Bergen (Fri,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: