论文信息 - A Fast Triangle-Triangle Intersection Test - 字舞流文

A Fast Triangle-Triangle Intersection Test

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 in, for example, collision detection algorithms.

Tomas Akenine-Möller | T. Akenine-Möller

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

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

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

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

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

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

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