论文信息 - A fast triangle-triangle intersection test - 字舞流文

A fast triangle-triangle intersection test

Abstract This paper presents a method, along with some optimizations, for computing whether or not two triangles intersect. The code, which is shown to be fast, can be used, for example, in collision detection algorithms.

Tomas Möller | Tomas Möller

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

[2] Philip M. Hubbard,et al. Approximating polyhedra with spheres for time-critical collision detection , 1996, TOGS.

[3] Joseph S. B. Mitchell,et al. Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..

[4] David H. Laidlaw,et al. Constructive solid geometry for polyhedral objects , 1986, SIGGRAPH.

[5] Brian Mirtich,et al. Fast and Accurate Computation of Polyhedral Mass Properties , 1996, J. Graphics, GPU, & Game Tools.

[6] Eric Haines,et al. Point in Polygon Strategies , 1994, Graphics Gems.

[7] Dinesh Manocha,et al. OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.