Journal of Shanghai Jiaotong University ›› 2012, Vol. 46 ›› Issue (06): 962-966.

• Automation Technique, Computer Technology • Previous Articles     Next Articles

Fast Efficient Collision Detection

YIN  Gui-Sheng-1, WANG  Hai-Ling-1, 2 , ZHANG  Jing-1, NI  Jun-2, WANG  Jian-3   

  1. (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)
  • Received:2011-08-20 Online:2012-06-28 Published:2012-06-28

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.

Key words: collision detection, computer graphics, hierarchy, graphics processing unit, parallel computing

CLC Number: