Moving a polygon around the corner in a corridor

Sanjeev R. Maddila, Chee K. Yap

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider the problem of moving an n vertex simple polygon around a corner in a right-angular corridor. We give an O (n log n ) algorithm for a convex polygon which constructs a motion of the polygon when one exists; otherwise It reports that none exists. In the case of non-convex polygons, we have anO(n2) time algorithm.

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

Publication series

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

Other

Other2nd Annual Symposium on Computational Geometry, SCG 1986
CountryUnited States
CityYorktown Heights
Period6/2/866/4/86

ASJC Scopus subject areas

  • Geometry and Topology
  • Theoretical Computer Science
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Moving a polygon around the corner in a corridor'. Together they form a unique fingerprint.

  • Cite this

    Maddila, S. R., & Yap, C. K. (1986). Moving a polygon around the corner in a corridor. In Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986 (pp. 187-192). (Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986). Association for Computing Machinery, Inc. https://doi.org/10.1145/10515.10536