论文信息 - Faster Triangle-Triangle Intersection Tests

Faster Triangle-Triangle Intersection Tests

This paper presents a new method for computing whether or not two triangles in three dimensions intersect. The code is very efficient and requires minimum arithmetic precision. Indeed, all branching decisions are carried out by evaluating the signs of degree three polynomials. In addition, an efficient test is proposed for the two-dimensional case.

O. Devillers | P. Guigue

[1] Mariette Yvinec,et al. Evaluation of a new method to compute signs of determinants , 1995, SCG '95.

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

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

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

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

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

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

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

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

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