An enhanced sweep and prune algorithm for multi-body continuous collision detection

被引:4
作者
Qi, Binbin [1 ,2 ]
Pang, Mingyong [1 ]
机构
[1] Nanjing Normal Univ, Inst EduInfo Sci & Engn, Nanjing 210097, Jiangsu, Peoples R China
[2] Nanjing Univ, Sch Informat Management, Nanjing 210023, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Collision detection; Event-driven; Multi-body collision; Event blocking; Priority queue; Virtual reality;
D O I
10.1007/s00371-019-01718-2
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:1503 / 1515
页数:13
相关论文
共 41 条
[1]   INTERSECTION QUERIES IN CURVED OBJECTS [J].
AGARWAL, PK ;
VANKREVELD, M ;
OVERMARS, M .
JOURNAL OF ALGORITHMS, 1993, 15 (02) :229-266
[2]   INTERACTIVE SIMULATION OF SOLID RIGID BODIES [J].
BARAFF, D .
IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1995, 15 (03) :63-75
[3]   Kinetic collision detection between two simple polygons [J].
Basch, J ;
Erickson, J ;
Guibas, LJ ;
Hershberger, J ;
Zhang, L .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2004, 27 (03) :211-235
[4]  
Bridson R, 2002, ACM T GRAPHIC, V21, P594, DOI 10.1145/566570.566623
[5]   Adaptive Collision Culling for Massive Simulations by a Parallel and Context-Aware Sweep and Prune Algorithm [J].
Capannini, Gabriele ;
Larsson, Thomas .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2018, 24 (07) :2064-2077
[6]   Efficient collision detection using a dual OBB-sphere bounding volume hierarchy [J].
Chang, Jung-Woo ;
Wang, Wenping ;
Kim, Myung-Soo .
COMPUTER-AIDED DESIGN, 2010, 42 (01) :50-57
[7]  
Cohen J. D., 1995, Proceedings 1995 Symposium on Interactive 3D Graphics, P189, DOI 10.1145/199404.199437
[8]   Velocity-aligned discrete oriented polytopes for dynamic collision detection [J].
Coming, Daniel S. ;
Staadt, Oliver G. .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2008, 14 (01) :1-12
[9]   Kinetic sweep and prune for multi-body continuous motion [J].
Coming, Daniel S. ;
Staadt, Oliver G. .
COMPUTERS & GRAPHICS-UK, 2006, 30 (03) :439-449
[10]   Safe human-robot interaction based on dynamic sphere-swept line bounding volumes [J].
Corrales, J. A. ;
Candelas, F. A. ;
Torres, F. .
ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2011, 27 (01) :177-185