论文信息 - A Fast Triangle-Triangle Overlap Test Using Signed Distances

A Fast Triangle-Triangle Overlap Test Using Signed Distances

Abstract A fast test for triangle-triangle intersection by computing signed vertex-plane distances (sufficient if one triangle is wholly to one side of the other) and signed line-line distances of selected edges (otherwise) is presented. This algorithm is faster than previously published algorithms and the code is available online.

Zesheng Tang | Hao Shen | Pheng-Ann Heng

[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] Dinesh Manocha,et al. OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

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