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

快速高效的碰撞检测算法 
引用本文:印桂生,王海玲,张菁,倪军,王建.快速高效的碰撞检测算法 [J].上海交通大学学报,2012,46(6):962-966.
作者姓名:印桂生  王海玲  张菁  倪军  王建
作者单位:(1.哈尔滨工程大学 计算机科学与技术学院,哈尔滨 150001;2.爱荷华大学 医学院,爱荷华 52242; 3.哈尔滨工程大学 网络信息中心,哈尔滨 150001)
摘    要:为了提高碰撞检测算法的效率,提出了一种快速高效的碰撞检测方法.利用Morton码存储物体信息,给出一种改进的图层级结构,可快速分割物体空间,减少物体对相交检测;利用图形处理器(GPU)的并行处理特性进行物体包围盒层级树构建、树遍历,不仅可以快速处理碰撞检测中的事务,还可节省存储空间.实验表明,该方法能够快速构建物体层级结构,并能进行高效的碰撞检测计算.

关 键 词:碰撞检测    计算机图形    层次结构    图形处理器    并行计算  
收稿时间:2011-08-20

Fast Efficient Collision Detection
YIN Gui-sheng,WANG Hai-ling,ZHANG Jing,NI Jun,WANG Jian.Fast Efficient Collision Detection[J].Journal of Shanghai Jiaotong University,2012,46(6):962-966.
Authors:YIN Gui-sheng  WANG Hai-ling  ZHANG Jing  NI Jun  WANG Jian
Institution:(1. College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China; 2. Carver College of Medicine, University of Iowa, Iowa 52242, USA; 3. Centre of Network Information, Harbin Engineering University, Harbin 150001, China)
Abstract:To speed up collision detection, a novel parallel algorithm for collision detection was proposed. Firstly, spatial Morton codes are used in linear ordering for geometric primitives, this is fast to build bounding volume hierarchies. Secondly, a top-down approach that uses the graph of model to build hierarchies optimized from skeletons connection. Thirdly, both algorithms are combined into a hybrid algorithm that need few memories for GPU construction performance and scalability leading to significantly decreased build time. The experimental results show the algorithm has efficient speedup to construct hierarchies of models with up to several million triangles and is fast for collision detection.
Keywords:collision detection  computer graphics  hierarchy  graphics processing unit  parallel computing  
本文献已被 CNKI 等数据库收录!
点击此处可从《上海交通大学学报》浏览原始摘要信息
点击此处可从《上海交通大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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