Abstract
We present a simple, accurate and efficient algorithm for collision detection among moving ellipsoids. Its efficiency is attributed to two results: (i) a simple algebraic test for the separation of two ellipsoids, and (ii) an efficient method for constructing a separating plane between two disjoint ellipsoids. Inter-frame coherence is exploited by using the separating plane to reduce collision detection to simpler subproblems of testing for collision between the plane and each of the ellipsoids. Compared with previous algorithms (such as the GJK method) which employ polygonal approximation of ellipsoids, our algorithm demonstrates comparable computing speed and much higher accuracy.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wang, W., Choi, YK., Chan, B. et al. Efficient Collision Detection for Moving Ellipsoids Using Separating Planes. Computing 72, 235–246 (2004). https://doi.org/10.1007/s00607-003-0060-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-003-0060-0