| 一种快速的基于并行的碰撞检测算法 |
| |
| 引用本文： | 赵伟,何艳爽. 一种快速的基于并行的碰撞检测算法[J]. 吉林大学学报(工学版), 2008, 38(1): 152-157 |
| |
| 作者姓名： | 赵伟 何艳爽 |
| |
| 作者单位： | 吉林大学,计算机科学与技术学院,长春,130012;长春工业大学,计算机科学与工程学院,长春,130012;长春工业大学,计算机科学与工程学院,长春,130012 |
| |
| 摘 要： | 提出了一种基于并行的碰撞检测算法,主要采用分治策略建立平衡包围盒树,通过遍历包围盒树组成任务树,采用流水线技术遍历任务树来加速碰撞检测。该算法同时应用了多线程技术,能运行于单处理机和多处理机。
|
| 关 键 词： | 计算机应用 碰撞检测 并行算法 包围盒树 分治 流水线 |
| 文章编号： | 1671-5497（2008）01-0152-06 |
| 收稿时间： | 2006-12-13 |
| 修稿时间： | 2006-12-13 |
Rapid algorithm for parallel collision detection |
| |
| Zhao Wei,He Yan-shuang. Rapid algorithm for parallel collision detection[J]. Journal of Jilin University:Eng and Technol Ed, 2008, 38(1): 152-157 |
| |
| Authors: | Zhao Wei He Yan-shuang |
| |
| Abstract: | 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. |
| |
| Keywords: | computer application collision detection parallel algorithms BoxTree divide and conquer pipelining |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《吉林大学学报(工学版)》浏览原始摘要信息 |
|
点击此处可从《吉林大学学报(工学版)》下载全文 |
