Incremental 3D collision detection with hierarchical data structures

3D collision detection is the most time-consuming component of many geometric reasoning applications. Any improvements on the efficiency of the collision detection module may have a great impact on the overall performance of these applications. Most efficient collision detection algorithms in the literature use some sort of hierarchical bounding volumes, such as spheres or oriented bounding boxes, to reduce the number of calls to expensive collision checks between polygons. In this paper, we propose an incremental scheme that takes advantage of spatial coherence to improve the performance of this class of algorithms. Experiments have been conducted on a sphere-tree structure for several moving objects. Consistent improvements ranging from 70 to 90 percents were observed. These numbers are actually very close to the theoretical upper bound for such improvements. 1.1 Keywords

[1]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..

[2]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[3]  Ming C. Lin,et al.  Efficient collision detection for animation and robotics , 1993 .

[4]  Philip M. Hubbard,et al.  Interactive collision detection , 1993, Proceedings of 1993 IEEE Research Properties in Virtual Reality Symposium.

[5]  Sean Quinlan,et al.  Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[6]  Jean-Claude Latombe,et al.  Planning motions with intentions , 1994, SIGGRAPH.

[7]  William Bricken,et al.  Efficient virtual collision detection for multiple users in large virtual spaces , 1994 .

[8]  Richard L. Grimsdale,et al.  Collision Detection for Animation using Sphere‐Trees , 1995, Comput. Graph. Forum.

[9]  Tsai-Yen Li,et al.  Assembly maintainability study with motion planning , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[10]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[11]  Leonidas J. Guibas,et al.  BOXTREE: A Hierarchical Representation for Surfaces in 3D , 1996, Comput. Graph. Forum.

[12]  Lydia E. Kavraki,et al.  A Random Sampling Scheme for Path Planning , 1997, Int. J. Robotics Res..

[13]  Stephen Cameron,et al.  Enhancing GJK: computing minimum and penetration distances between convex polyhedra , 1997, Proceedings of International Conference on Robotics and Automation.

[14]  Gabriel Zachmann,et al.  Rapid collision detection by dynamically aligned DOP-trees , 1998, Proceedings. IEEE 1998 Virtual Reality Annual International Symposium (Cat. No.98CB36180).

[15]  Dinesh Manocha,et al.  Spherical shell: a higher order bounding volume for fast proximity queries , 1998 .

[16]  Joseph S. B. Mitchell,et al.  Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..