期刊文献+

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

Rapid Algorithm for Parallel Collision Detection
在线阅读 下载PDF
导出
摘要 提出一种基于并行的碰撞检测算法。该算法主要采用并行算法中的分治策略建立环境中每个物体的平衡包围盒树,通过遍历每两棵包围盒树形成对一任务树的遍历,采用并行算法中的流水线技术,利用划分进程遍历任务树从而加速碰撞检测算法。该算法在进程中也应用了多线程技术,因而能运行于单处理机和多处理机上。 A parallel collision detection algorithm is presented. The algorithm mostly builds balance-BoxTrees of every objects in environment using divide and conquer technologies in parallel algorithm, form traversing of a WorkTrees by traversing two BoxTrees and speeds up collision detection algorithm applying pipelining in parallel algorithm and traversing the WorkTrees by parting tenors. It also applies multi-threads in tenors thus it can run on both single processor computer and multi-processor computer.
作者 赵伟 何艳爽
出处 《计算机工程》 CAS CSCD 北大核心 2008年第2期78-80,85,共4页 Computer Engineering
基金 吉林省科技厅平台建设基金资助项目(20030016)
关键词 碰撞检测 并行算法 包围盒树 分治 流水线 collision detection parallel algorithm BoxTree divide and conquer pipelining
  • 相关文献

参考文献10

二级参考文献48

  • 1[1]Cameron S A.Collision detection by four-dimensional intersection testing[J].IEEE Trans Robotics and Automat,1990;6(3):291-302
  • 2[2]Hubbard P M.Collision Detection for Interactive Graphics Applications[J].IEEE Trans Visualization and Computer Graphics, 1995; 1 (3):218-230
  • 3[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
  • 4[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
  • 5[5]Chazelle B,Palios L. Decomposition algorithms in geometry[C].In :Bajaj C,ed.Algebraie Geometry and its Applications, Berlin Springer: 1994:419-447
  • 6[6]Boyse JW.lnterference detection among solids and surfaces[J].Communication of the Association of the Computing Machinery, 1979;22( 1 ):3-9
  • 7[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
  • 8[8]Chazelle B.Convex partitions of polyhedra:a lower bound and a worstcase optimal algorithm[J].SIAM Journal on Computing, 1984; 13:488-507
  • 9[9]Bajaj C,Dey T. Convex decomposition of polyhedra and robustness[J]. SIAM Journal on Computing, 1992;21(2) :339-364
  • 10[10]Gottschalk S,Lin M,Manocha D.OBB-Tree:A Hierarchical Structure for Rapid Interference Detection[C].In:Proceedings of ACM S1GGRA-PH 96, New Orlean: LA, 1996:171 - 180

共引文献144

同被引文献44

引证文献4

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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