Collision Detection of a Moving Polygon in the Presence of Polygonal Obstacles in the Plane

This paper presents a new approach for the following collision detection problem in the plane: Let a simple polygon P rotate at a center /spl ogr/ with constant angular velocity /spl omega/ and translate towards a set of polygonal obstacles S with constant velocity /spl nu/. Given P and S as well as their initial positions, and given also the velocities of P, determine whether or not P will collide with any element of S and report the collided elements of S if collisions occurred. An O(mn) worst-case optimal algorithm is proposed to solve this problem, where n is the number of vertices of P and m is the number of vertices of the obstacles in S. >

[1]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[2]  Joseph O'Rourke,et al.  Lower bounds on moving a ladder in two and three dimensions , 1988, Discret. Comput. Geom..

[3]  Micha Sharir,et al.  Motion planning in the presence of moving obstacles , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[4]  L. Paul Chew,et al.  Planning the shortest path for a disc in O(n2log n) time , 1985, SCG '85.

[5]  Micha Sharir,et al.  An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract) , 1985, SCG '85.

[6]  Micha Sharir,et al.  An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal Barriers , 1987, J. Algorithms.

[7]  Micha Sharir,et al.  Improved Combinatorial Bounds and Efficient Techniques for Certain Motion Planning Problems with Three Degrees of Freedom , 1991, Comput. Geom..

[8]  Micha Sharir,et al.  An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles , 1985, SCG '85.

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

[10]  Micha Sharir,et al.  Efficient Motion Planning for an L-Shaped Object , 1992, SIAM J. Comput..

[11]  Leonidas J. Guibas,et al.  An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body , 1988, J. Algorithms.