作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (2): 78-80. doi: 10.3969/j.issn.1000-3428.2008.02.026

• 软件技术与数据库 • 上一篇    下一篇

一种快速的基于并行的碰撞检测算法

赵 伟1,2,何艳爽2

  

  1. (1. 吉林大学计算机科学与技术学院,长春 130012;2. 长春工业大学计算机科学与工程学院,长春 130012)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-01-20 发布日期:2008-01-20

Rapid Algorithm for Parallel Collision Detection

ZHAO Wei1,2, HE Yan-shuang2   

  1. (1. College of Computer Science and Technology, Jilin University, Changchun 130012;2. School of Computer Science and Engineering, Changchun University of Technology, Changchun 130012)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-01-20 Published:2008-01-20

摘要: 提出一种基于并行的碰撞检测算法。该算法主要采用并行算法中的分治策略建立环境中每个物体的平衡包围盒树,通过遍历每两棵包围盒树形成对一任务树的遍历,采用并行算法中的流水线技术,利用划分进程遍历任务树从而加速碰撞检测算法。该算法在进程中也应用了多线程技术,因而能运行于单处理机和多处理机上。

关键词: 碰撞检测, 并行算法, 包围盒树, 分治, 流水线

Abstract: 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.

Key words: collision detection, parallel algorithm, BoxTree, divide and conquer, pipelining

中图分类号: