Fast efficient collision detection

被引:0
作者
Yin, Gui-Sheng [1 ]
Wang, Hai-Ling [1 ,2 ]
Zhang, Jing [1 ]
Ni, Jun [2 ]
Wang, Jian [3 ]
机构
[1] College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China
[2] Carver College of Medicine, University of Iowa, Iowa 52242, United States
[3] Centre of Network Information, Harbin Engineering University, Harbin 150001, China
来源
Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University | 2012年 / 46卷 / 06期
关键词
Program processors - Computer graphics - Computer graphics equipment;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:962 / 966
相关论文
empty
未找到相关数据