Triangular mesh intersection

摘要

This paper proposes an efficient algorithm for finding self-intersections of a triangular mesh. It is very important to restrict, as much as possible, when and where the basic triangle-to-triangle intersection (TTI) algorithm is applied by taking advantage of the geometry and topology of a triangular mesh. To reduce the number of triangle pairs to be checked for intersection, the suggested algorithm employs the visibility information of triangles together with a conventional space-partitioning method. The visibility method works by topology, while the space-partitioning method works by geometry. The complementary nature of the two techniques enables additional improvement of the triangular mesh intersection process. The proposed algorithm has been implemented and tested with various examples. Some examples have been provided to illustrate the efficiency of the algorithm.