首页 | 本学科首页   官方微博 | 高级检索  
     

基于凸多面体剖分的并行碰撞检测算法
引用本文:薛广涛,李超,尤晋元. 基于凸多面体剖分的并行碰撞检测算法[J]. 上海交通大学学报, 2004, 38(8): 1385-1388
作者姓名:薛广涛  李超  尤晋元
作者单位:1. 上海交通大学,计算机科学与工程系,上海,200030
2. 上海大学,计算机工程与科学学院,上海,200072
基金项目:国家自然科学基金资助项目(69973032)
摘    要:针对传统的碰撞检测算法对于复杂多面体之间的碰撞检测时间过长的缺陷,提出并证明了一种凸多面体的剖分算法,该算法能将复杂的凸多面体剖分为简单四面体,利用基于MPI(Message Passing Interface)并行处理的方法来提高碰撞检测的实时性.给出了基于凸多面体剖分的并行碰撞检测算法与常规算法的比较结果,证明了所提出算法的优越性.

关 键 词:凸多面体 四面体 剖分 并行 碰撞检测
文章编号:1006-2467(2004)08-1385-04
修稿时间:2003-09-08

Algorithm of Parallel Collision Detection Based on Dividing a Convex Polyhedron to Tetrahedrons
XUE Guang-tao,LI Chao,YOU Jin-yuan. Algorithm of Parallel Collision Detection Based on Dividing a Convex Polyhedron to Tetrahedrons[J]. Journal of Shanghai Jiaotong University, 2004, 38(8): 1385-1388
Authors:XUE Guang-tao  LI Chao  YOU Jin-yuan
Affiliation:XUE Guang-tao~1,LI Chao~2,YOU Jin-yuan~1
Abstract:In view of that conventional algorithms of collision detection spend a lot of detection time on complex polyhedrons, an algorithm to divide a convex polyhedron was presented and proved. This algorithm can divide complex polyhedrons into simply tetrahedrons. Then a parallel method based on MPI is used to improve the real-time performance of collision detection. An example was presented to compare the proposed method with traditional methods so as to prove the superiority of the method.
Keywords:convex polyhedron  tetrahedron  divide  parallel  collision detection
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号