By Topic

Collision detection of a moving polygon in the presence of polygonal obstacles in the plane

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Cao An Wang ; Dept. of Comput. Sci., Memorial Univ. of Newfoundland, St. John''s, Nfld., Canada

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

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:16 ,  Issue: 6 )