Collision detection of a moving polygon in the presence ofpolygonal obstacles in the plane
Cao An Wang
Dept. of Comput. Sci., Memorial Univ. of Newfoundland, St. John's, Nfld.;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Jun 1994
Volume: 16,
Issue: 6
On page(s): 571-580
ISSN: 0162-8828
References Cited: 14
CODEN: ITPIDJ
INSPEC Accession Number: 4722514
Digital Object Identifier: 10.1109/34.295902
Current Version Published: 2002-08-06
Abstract
This paper presents a new approach for the following collision
detection problem in the plane: Let a simple polygon P rotate at a
center &ogr; with constant angular velocity ω and translate
towards a set of polygonal obstacles S with constant velocity ν.
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
