空间三角形快速相交检测算法  

Fast intersection algorithm between spatial triangles

作　　者：邹益胜[1] 丁国富[1] 何邕[1] 许明恒[1] 

机构地区：[1]西南交通大学机械工程学院,成都610031

出　　处：《计算机应用研究》2008年第10期2906-2910,共5页Application Research of Computers

基　　金：国家自然科学杰出青年基金资助项目(50525518);国家"973"计划资助项目(2007CB714701)

摘　　要：综述了典型的快速稳定的三角形相交检测算法的原理及实现方法,并根据算法原理将其分为标量判别型和矢量判别型算法。从计算量角度对各种算法的适用场合和性能进行了分析比较及验证,结果显示矢量判别型算法中的Olivier Devillers & Philippe Guigue算法整体性能最优,而标量判别型算法中的Oren Tropp算法最适合于三角形相交率较高的场合。This paper surveyed the principle and implementation of typically fast and robust triangle-triangle intersection algorithms, which was classified into scalar discrimination algorithm and vector discrimination algorithm according to their principle. Discussed the applicable occasions and performance of every algorithm by analyzing their calculation amount. The results of analysis and test show that the overall performance of the algorithm proposed by Olivier Devillers ＆ Philippe Guigue, one of the vector discrimination algorithms, is optimal, and the algorithm proposed by Oren Tropp, one of the scalar discrimination algorithms, is most suitable for the occasions with high triangle-triangle intersection ration.

关 键 词：空间三角形 相交检测 标量判别 矢量判别 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]