A robust segment/triangle intersection algorithm for interference tests. Efficiency study

In this paper, a new algorithm for the intersection between a segment and a triangle in 3D is presented. This algorithm is suitable for interference tests between moving polyhedral solids, as is shown in the times study. In this situation it is necessary to determine whether the interference between triangles takes place (boolean test), and in some applications to determine the intersection point. When solids move certain changing information, such as the triangle normal, cannot be stored so the algorithms cannot take advantage of pre-calculations. A set of tests and a study of the computational cost of the new algorithm compared with classical algorithms are provided. These algorithms and studies can be used and extended by programmers in real applications.