An enhanced sweep and prune algorithm for multi-body continuous collision detection
Multi-body collision detection is a key and important technology in societies of computer graphics, system simulation, virtual reality, etc. and has been widely used in various graphics applications. To deal with the collision detection problem in large-scale multi-body scenes, we in this paper proposed a robust and efficient algorithm based on the kinetic “sweep and prune” technique and the event-driven mechanism. Our algorithm first culls redundant detection calculations in finding object pairs that do not collide in the scene with very large number of moving objects and then automatically generates events to predict the object collisions, which probably take place in near future. All the events are pushed into an optimized priority queue to drive the proposed algorithm. By introducing a hybrid bounding box hierarchy in the event processing process, the algorithm can detect the positions where the object pairs collide. Based on our finding that event blocking is an important factor affecting the robustness of the algorithm, we further propose several techniques to alarm blockings to be occurred or relieve the system from blocking state. Experimental results show that our algorithm has good stability and robustness, and it can improve the operating efficiency of multi-body continuous collision detections in an efficient way.
KeywordsCollision detection Event-driven Multi-body collision Event blocking Priority queue Virtual reality
The work in this paper was supported by the National Natural Science Foundation of China [Grand No. 41631175], the Key Project of the Ministry of Education for the 13th Five-year Plan of National Education Science of China [Grand No. DCA170302], the Social Science Foundation of Jiangsu Province of China [Grand No. 15TQB005] and the Priority Academic Program Development of Jiangsu Higher Education Institutions of China.
Compliance with ethical standards
Conflict of interest
We declare that we have no conflict of interest.
- 14.Cohen, J.D., Lin, M.C., Manocha, D., et al.: I-COLLIDE: An interactive and exact collision detection system for large-scale environments. In: Proceedings of the 1995 Symposium on Interactive 3D Graphics. (pp. 189–196). ACM (1995)Google Scholar
- 15.Daniel, J.T., Samuel, R.B., Bryan, M.W.: Efficient large-scale sweep and prune methods with AABB insertion and removal. In: 2009 IEEE Virtual Reality Conference. (pp. 191–198). IEEE (2009)Google Scholar
- 16.Liu, F., Harada, T., Lee, Y., et al.: Real-time collision culling of a million bodies on graphics processing units. ACM Trans. Graph. 29(6), 154 (2011)Google Scholar
- 21.Weller, R.: Kinetic data structures for collision detection. In: Ferre, M., Ernst, M.O., Wing, A. (eds) New Geometric Data Structures for Collision Detection and Haptics. Springer (2013)Google Scholar
- 26.Oh, S., Hwang, S.: A GJK based real-time collision detection algorithm for moving objects. In: Advances in Cognitive Neurodynamics ICCN 2007. (pp. 817–820). Springer (2008)Google Scholar
- 30.Gottschalk, S., Lin, M.C., Manocha, D.: OBBTree: A hierarchical structure for rapid interference detection. In: Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques. pp. 171–180. ACM (1996)Google Scholar
- 31.Wei, Y.M., Wu, Y.Q., Shi, J.Y.: Research on fixed direction hull bounding volume in collision detection. J. Softw. 12(7), 1056–1063 (2001)Google Scholar
- 33.Tu, C., Yu, L.: Research on collision detection algorithm based on AABB-OBB bounding volume. In: International Workshop on Education Technology and Computer Science. pp. 331–333. IEEE Computer Society (2009)Google Scholar
- 40.Pettie, S.: Towards a final analysis of pairing heaps. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. pp. 174–183. IEEE (2005)Google Scholar
- 41.Paul, D.V., Pawar, J.D.: A binomial heap extractor for automatic keyword extraction. In: International Conference on Data Mining and Advanced Computing. pp. 113–121. IEEE (2016)Google Scholar