A new efficient motion-planning algorithm for a rod in polygonal space

S. Sifrony, Micha Sharir

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

We present here a new and efficient algorithm for planning collision-free motion of a rod in the plane amidst polygonal obstacles. The algorithm calculates the boundary of the space of free positions of the rod, and then uses this boundary for determining the existence of required motions. The algorithm runs in time O(K log n) where n is the number of obstacle corners and where K is the total number of pairs of obstacle walls or corners lying from one another at distance less than or equal to the length of the rod. Since K=O(n2), the algorithm has the same worst-case complexity as the best previously developed algorithm of Leven and Sharir [LSI], but if the obstacles are not too cluttered together it will run much more efficiently.

Original languageEnglish
Title of host publicationProceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986
PublisherAssociation for Computing Machinery, Inc
Pages178-186
Number of pages9
ISBN (Electronic)0897911946, 9780897911948
DOIs
StatePublished - 1 Aug 1986
Event2nd Annual Symposium on Computational Geometry, SCG 1986 - Yorktown Heights, United States
Duration: 2 Jun 19864 Jun 1986

Publication series

NameProceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986

Conference

Conference2nd Annual Symposium on Computational Geometry, SCG 1986
Country/TerritoryUnited States
CityYorktown Heights
Period2/06/864/06/86

Funding

FundersFunder number
Israeli Ministry of Industry Foundation

    Fingerprint

    Dive into the research topics of 'A new efficient motion-planning algorithm for a rod in polygonal space'. Together they form a unique fingerprint.

    Cite this