期刊文献+

一种快速的基于并行的碰撞检测算法 被引量:16

Rapid algorithm for parallel collision detection
下载PDF
导出
摘要 提出了一种基于并行的碰撞检测算法,主要采用分治策略建立平衡包围盒树,通过遍历包围盒树组成任务树,采用流水线技术遍历任务树来加速碰撞检测。该算法同时应用了多线程技术,能运行于单处理机和多处理机。 A parallel collision detection algorithm was presented. In this algorithm the balance bounding volumes were established using the divide and conquer strategy. Then the task trees were built by traversing the bounding volumes. The collision detection was accelerated by applying pipelining technique to traverse the task trees. This algorithm also applied the multi-threads and can be run on both single processor computer and multi-processor computer.
作者 赵伟 何艳爽
出处 《吉林大学学报(工学版)》 EI CAS CSCD 北大核心 2008年第1期152-157,共6页 Journal of Jilin University:Engineering and Technology Edition
基金 国家自然科学基金项目(60573182,69883004)
关键词 计算机应用 碰撞检测 并行算法 包围盒树 分治 流水线 computer application collision detection parallel algorithms BoxTree divide and conquer pipelining
  • 相关文献

参考文献11

二级参考文献34

  • 1潘志庚,马小虎,董军,石教英.基于图的任意域内点集的Delaunay三角剖分算法[J].软件学报,1996,7(11):656-661. 被引量:18
  • 2[1]Cameron S A.Collision detection by four-dimensional intersection testing[J].IEEE Trans Robotics and Automat,1990;6(3):291-302
  • 3[2]Hubbard P M.Collision Detection for Interactive Graphics Applications[J].IEEE Trans Visualization and Computer Graphics, 1995; 1 (3):218-230
  • 4[3]Bouma H' ,Vanecek G.Collision detection and analysis in a physical based simulation[C]Jn:Eurographies Workshop on Animation and Simu lation ,Vienna, 1991:191
  • 5[4]Thomas F,Torras C.Interference detection between non-convex polyhedra revisited with a practical aim[ClAn:Proceedings of the IEEE International Conference on Robotics and Automation,San Diegn,CA,1994: 587-594
  • 6[5]Chazelle B,Palios L. Decomposition algorithms in geometry[C].In :Bajaj C,ed.Algebraie Geometry and its Applications, Berlin Springer: 1994:419-447
  • 7[6]Boyse JW.lnterference detection among solids and surfaces[J].Communication of the Association of the Computing Machinery, 1979;22( 1 ):3-9
  • 8[7]Lin MC.Canny JF.A fast algorithm for incremental distance calcula-tion[C].In :Proceedings of the IEEE International Conference nn Ro-botics and Automation,Sacramento,CA, 1991: 1008-1014
  • 9[8]Chazelle B.Convex partitions of polyhedra:a lower bound and a worstcase optimal algorithm[J].SIAM Journal on Computing, 1984; 13:488-507
  • 10[9]Bajaj C,Dey T. Convex decomposition of polyhedra and robustness[J]. SIAM Journal on Computing, 1992;21(2) :339-364

共引文献175

同被引文献121

引证文献16

二级引证文献49

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部