Distances between boxes: Applications to collision detection and clipping
Wolfgang E. Meyer · 1986
This paper presents an efficient algorithm for determining the minimum distance and the minimum separating segment between two boxes situated arbitrarily in 3-space. This generalizes the intersection detection problem for boxes. A brief survey is given of other methods which have been used or could be used, including intersection detection methods. This algorithm may be useful in speeding up collision detection and clipping in some cases.