This Article 
 Bibliographic References 
 Add to: 
Collision Detection of a Moving Polygon in the Presence of Polygonal Obstacles in the Plane
June 1994 (vol. 16 no. 6)
pp. 571-580

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] J. Canny, "Collision detection for moving polyhedra,"IEEE trans. Pattern Anal. Machine Intell., vol. PAMI-8, no. 2, pp. 200-209, 1986.
[2] P. Chew, "Planning the shortest path for a disc in O(n2logn) time," inProc. 1st ACM Symp. Computat. Geometry, 1985, pp. 214-220.
[3] D. Halperin, "Efficient motion planning for an L-shaped object,"SIAM J. Computing, vol. 21, no. 1, 1992.
[4] D. Halperin and M. Sharir, "Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom," inProc. 2nd Canadian Conf. Computat. Geometry, 1990, pp. 98-101.
[5] J. Hershberger and L. Guibas, "An O(n2) shortest path alaorithm for a non-rotating convex body," Tech. Rep. 14, DEC Syst. Res. Center, 1986.
[6] Y. Ke and J. O'Rourke, "Lower bounds on moving a ladder in two and three dimensions,"Discrete Computational Geometry, vol. 3, pp. 197-218, 1987.
[7] K. Kedem and M. Sharir, "An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2- dimensional space amidst polygonal obstacles," inProc. 1st Annu. ACM Symp. Computational Geometry, June 1985, pp. 75-80.
[8] D. Lee and F. Preparata, "Euclidean shortest paths in the presence of rectilinear barriers,"Networks, vol. 14, no. 3, pp. 393-410, 1984.
[9] D. Leven and M. Sharir, "An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers,"J. Algorithms, vol. 8, pp. 192-215, 1987.
[10] C. O'Dunlaing, M. Sharir, and C. Yap, "Generalized Voronoi diagrams for a ladder: I. Topological analysis,"Commun. Pure Appl. Math., vol. 39, pp. 423-483, 1985.
[11] C. O'Dunlaing, M. Sharir, and C. Yap, "Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram,"Algorithmica, vol. 2, pp. 27-59, 1985.
[12] J. Reif and M. Sharir, "Motion planning in the presence of moving obstacles," inProc. 25th IEEE Annu. Symp. Foundations of Comput. Sci., 1985, pp. 144-154.
[13] G. Toussaint, "Complexity, convexity, and uni-modality,"Int. J. Comput. Inform. Sci., vol. 13, pp. 197-217, 1984.
[14] G. Wilfong, "Motion planning in the presence of movable obstacles," inProc. 4th ACM Symp. Computat. Geometry, 1988, pp. 279-288.

Index Terms:
path planning; robots; computational geometry; collision detection; moving polygon; polygonal obstacles; angular velocity; worst case optimal algorithm; computational geometry; motion planning; robotics
C.A. Wang, "Collision Detection of a Moving Polygon in the Presence of Polygonal Obstacles in the Plane," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 6, pp. 571-580, June 1994, doi:10.1109/34.295902
Usage of this product signifies your acceptance of the Terms of Use.