论文信息 - Fast and Robust Triangle-Triangle Overlap Test Using Orientation Predicates

Fast and Robust Triangle-Triangle Overlap Test Using Orientation Predicates

Abstract This paper presents an algorithm for determining whether two triangles in three dimensions intersect. The general scheme is identical to the one proposed by Moller [Möller 97]. The main difference is that our algorithm relies exclusively on the sign of 4 × 4 determinants and does not need any intermediate explicit constructions which are the source of numerical errors. Besides the fact that the resulting code is more reliable than existing methods, it is also more efficient. The source code is available online.

Olivier Devillers | Philippe Guigue

[1] Victor Y. Pan,et al. Sign Determination in Residue Number Systems , 1999, Theor. Comput. Sci..

[2] Giuseppe Liotta,et al. Robust proximity queries: an illustration of degree-driven algorithm design , 1997, SCG '97.

[3] Jonathan Richard Shewchuk,et al. Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates , 1997, Discret. Comput. Geom..

[4] Giuseppe Liotta,et al. Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design , 1998, SIAM J. Comput..

[5] O. Devillers,et al. Faster Triangle-Triangle Intersection Tests , 2002 .

[6] Chee-Keng Yap,et al. Towards Exact Geometric Computation , 1997, Comput. Geom..

[7] Franco P. Preparata,et al. A Probabilistic Analysis of the Power of Arithmetic Filters , 1998, Discret. Comput. Geom..

[8] Martin Held,et al. ERIT - A Collection of Efficient and Reliable Intersection Tests , 1997, J. Graphics, GPU, & Game Tools.

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

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