Deformable Free-Space Tilings for Kinetic Collision Detection†

We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bounding volume hierarchies, our method is based on deformable tilings of the free space surrounding the polygons. The basic shape of our tiles is that of a pseudo-triangle, a shape sufficiently flexible to allow extensive deformation, yet structured enough to make detection of self-collisions easy. We show different schemes for maintaining pseudo-triangulations as a kinetic data structure, and we analyze their performance. Specifically, we first describe an algorithm for maintaining a pseudo-triangulation of a point set, and show that the pseudo-triangulation changes only quadratically many times if points move along algebraic arcs of constant degree. In addition, by refining the pseudo-triangulation, we show triangulations of points that only change about O(n 7 / 3 ) times for linear motion. We then describe an algorithm for maintaining a pseudo-triangulation of a set of convex polygons. Finally, we extend our algorithm to the general case of maintaining a pseudo-triangulation of a set of moving or deforming simple polygons.

[1]  Michiel H. M. Smid,et al.  Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects , 1996, Comput. Geom..

[2]  Ileana Streinu,et al.  A combinatorial approach to planar non-colliding robot arm motion planning , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[3]  Leonidas J. Guibas,et al.  Cylindrical static and kinetic binary space partitions , 2000, Comput. Geom..

[4]  Leonidas J. Guibas,et al.  Kinetic collision detection: algorithms and experiments , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[5]  Micha Sharir,et al.  On Disjoint Concave Chains in Arrangements of (Pseudo) Lines , 1991, Inf. Process. Lett..

[6]  Bettina Speckmann,et al.  Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons , 2002, SCG '02.

[7]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[8]  Leonidas J. Guibas,et al.  Kinetic bsps for intersecting segments and disjoint triangles , 1998, SODA 1998.

[9]  Leonidas J. Guibas,et al.  Maintaining the Extent of a Moving Point Set , 2001, Discret. Comput. Geom..

[10]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[11]  Leonidas J. Guibas,et al.  Proximity problems on moving points , 1997, SCG '97.

[12]  David Eppstein,et al.  Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions , 1998, SCG '98.

[13]  Leonidas J. Guibas,et al.  Data structures for mobile data , 1997, SODA '97.

[14]  Leonidas J. Guibas,et al.  Kinetic collision detection between two simple polygons , 2004, SODA '99.

[15]  Philip M. Hubbard,et al.  Collision Detection for Interactive Graphics Applications , 1995, IEEE Trans. Vis. Comput. Graph..

[16]  Michel Pocchiola,et al.  Topologically sweeping visibility complexes via pseudotriangulations , 1996, Discret. Comput. Geom..

[17]  L. Guibas,et al.  Separation-sensitive kinetic collision detection for convex objects , 1998 .

[18]  Elmar Schömer,et al.  Efficient collision detection for moving polyhedra , 1995, SCG '95.

[19]  Leonidas J. Guibas,et al.  Parametric and kinetic minimum spanning trees , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[20]  Leonidas J. Guibas,et al.  Kinetic data structures: a state of the art report , 1998 .

[21]  Leonidas J. Guibas,et al.  Optimal Shortest Path Queries in a Simple Polygon , 1989, J. Comput. Syst. Sci..

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

[23]  Leonidas J. Guibas,et al.  Interval methods for kinetic simulations , 1999, SCG '99.

[24]  S. Suri.  Minimum link paths in polygons and related problems , 1987 .

[25]  Leonidas J. Guibas,et al.  Kinetic Data Structures , 2004, Handbook of Data Structures and Applications.

[26]  Bettina Speckmann,et al.  Kinetic collision detection for simple polygons , 2000, SCG '00.

[27]  Christian Thiely.  Eecient Collision Detection for Moving Polyhedra , 1995 .

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