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.

[1]  Carme Torras,et al.  An Orientation-Based Pruning Tool to Speed Up Contact Determination between Translating Polyhedral Models , 2001, Int. J. Robotics Res..

[2]  T. C. Woo,et al.  Computational Geometry on the Sphere With Application to Automated Machining , 1992 .

[3]  Tomas Akenine-Möller,et al.  Real-time rendering , 1997 .

[4]  D. Hilbert,et al.  Geometry and the Imagination , 1953 .

[5]  Tony C. Woo,et al.  Visibility maps and spherical algorithms , 1994, Comput. Aided Des..

[6]  Elaine Cohen,et al.  Spatialized normal come hierarchies , 2001, I3D '01.

[7]  Carme Torras,et al.  3D collision detection: a survey , 2001, Comput. Graph..

[8]  Michael Ian Shamos,et al.  Geometric intersection problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[9]  MöllerTomas.  A fast triangle-triangle intersection test , 1997 .

[10]  Yuan-Shin Lee,et al.  2-Phase approach to global tool interference avoidance in 5-axis machining , 1995, Comput. Aided Des..

[11]  Carme Torras,et al.  Reducing feasible contacts between polyhedral models to red-blue intersections on the sphere , 2003, Comput. Aided Des..

[12]  Elaine Cohen,et al.  Spatialized Normal Cone Hierarchies , 2000 .

[13]  Sang C. Park,et al.  Polygonal chain intersection , 2002, Comput. Graph..

[14]  P. Volino,et al.  Collision and Self-Collision Detection :Efficient and Robust Solutions for Highly Deformable Surfaces , 1995 .

[15]  Robert B. Jerard,et al.  Sculptured Surface Machining , 1998 .

[16]  Tomas Akenine-Möller,et al.  A Fast Triangle-Triangle Intersection Test , 1997, J. Graphics, GPU, & Game Tools.

[17]  Tomas Möller,et al.  A fast triangle-triangle intersection test , 1997 .