Collision Detection: Algorithms and Applications

Fast and accurate collision detection between general geometric models is a fundamental problem in modeling, robotics, manufacturing and computer-simulated environments. Most of the earlier algorithm are either restricted to a class of geometric models, say convex polytopes, or are not fast enough for practical applications. We present an e cient and accurate algorithm for collision detection between general polygonal models in dynamic environments. The algorithm makes use of hierarchical representations along with frame to frame coherence to rapidly detect collisions. It is robust and has been implemented as part of public domain packages. In practice, it can accurately detect all the contacts between large complex geometries composed of hundreds of thousands of polygons at interactive rates.

[1]  James K. Hahn,et al.  Realistic animation of rigid bodies , 1988, SIGGRAPH.

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

[3]  김현준,et al.  컴퓨터 애니매이션을 위한 충돌 검색과 충돌 반응 = Collision detection and response for computer animation , 1991 .

[4]  Dinesh Manocha,et al.  I-COLLIDE: an interactive and exact collision detection system for large-scale environments , 1995, I3D '95.

[5]  Peter E. Hart,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

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

[7]  Alejandro M. García-Alonso,et al.  Solving the collision detection problem , 1994, IEEE Computer Graphics and Applications.

[8]  James Arvo,et al.  A survey of ray tracing acceleration techniques , 1989 .

[9]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[10]  Jane Wilhelms,et al.  Collision Detection and Response for Computer Animation , 1988, SIGGRAPH.

[11]  Dinesh Manocha,et al.  Incremental Algorithms for Collision Detection Between General Solid Models , 1994 .

[12]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

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

[14]  Stephen Cameron,et al.  Approximation hierarchies and S-bounds , 1991, SMA '91.

[15]  Bernard Chazelle,et al.  Intersection of convex objects in two and three dimensions , 1987, JACM.

[16]  Ming C. Lin,et al.  Efficient contact determination between geometric models , 1994 .

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

[18]  David G. Kirkpatrick,et al.  A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.

[19]  John F. Canny,et al.  Collision Detection for Moving Polyhedra , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  S. A. Cameron,et al.  Determining the minimum translational distance between two convex polyhedra , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

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

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

[23]  Stephen Cameron,et al.  Collision detection by four-dimensional intersection testing , 1990, IEEE Trans. Robotics Autom..

[24]  George Vanecek,et al.  Modeling contacts in a physically based simulation , 1993, Solid Modeling and Applications.

[25]  David L. Zeltzer,et al.  A New Model for Efficient Dynamic Simulation , 1993 .

[26]  George Vanĕček,et al.  Collision Detection and Analysis in a Physically Based Simulation , 1991 .

[27]  John M. Snyder,et al.  Interval methods for multi-point collisions between time-dependent curved surfaces , 1993, SIGGRAPH.

[28]  Franco P. Preparata,et al.  Computational Geometry , 1985, Texts and Monographs in Computer Science.

[29]  M Connolly,et al.  Geometric intersection problems in computational chemistry , 1987 .

[30]  Tom Duff,et al.  Interval arithmetic recursive subdivision for implicit functions and constructive solid geometry , 1992, SIGGRAPH.