Kinetic collision detection between two simple polygons

We design a kinetic data structure for detecting collisions between two simple polygons in motion. In order to do so, we create a planar subdivision of the free space between the two polygons, called the external relative geodesic triangulation, which certifies their disjointness. We show how this subdivision can be maintained as a kinetic data structure when the polygons are moving, and analyze its performance in the kinetic setting.

[1]  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.

[2]  David M. Mount.  Intersection detection and separators for simple polygons , 1992, SCG '92.

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

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

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

[6]  Philip M. Hubbard,et al.  Approximating polyhedra with spheres for time-critical collision detection , 1996, TOGS.

[7]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

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

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

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

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

[12]  Michel Pocchiola,et al.  Pseudo-triangulations: theory and applications , 1996, SCG '96.

[13]  Leonidas J. Guibas,et al.  Separation-sensitive collision detection for convex objects , 1998, SODA '99.

[14]  S B MitchellJoseph,et al.  Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998 .

[15]  Godfried T. Toussaint.  Shortest Path Solves Translation Separability of Polygons , 1986, IAS.

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

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

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

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

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

[21]  Uzi Vishkin,et al.  On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.

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

[23]  Michel Pocchiola,et al.  Computing the visibility graph via pseudo-triangulations , 1995, SCG '95.

[24]  M HubbardPhilip.  Collision Detection for Interactive Graphics Applications , 1995 .

[25]  Dinesh Manocha,et al.  Incremental algorithms for collision detection between solid models , 1995, Symposium on Solid Modeling and Applications.