Abstract
This article provides a review of the state-of-the-art techniques for collision detection in multibody dynamics, highlighting the unique requirements and constraints of engineering simulations. Specifically, the article compares the most popular narrow-phase algorithms which are widely used for distance computation and intersection testing between convex shapes. Additionally, broad-phase algorithms are examined in detail, emphasizing their role in reducing computational complexity during pairwise collision checks. Part of the article is dedicated to the collision detection of concave shapes, frequently encountered in multibody dynamics where geometries are often imported from CAD tools as highly detailed and complex models. Furthermore, the article identifies several open problems in the field, such as the need for scalable algorithms capable of handling large-scale systems with high degrees of freedom, handling of deformable bodies, better integration with modern CAD workflows and GPU computing.
Get full access to this article
View all access options for this article.
