Moving a polygon around the corner in a corridor

Sanjeev R. Maddila, Chee 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

Other

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

Fingerprint

Polygon
Simple Polygon
Convex polygon
Motion
Vertex of a graph

ASJC Scopus subject areas

  • Geometry and Topology
  • Theoretical Computer Science
  • Computational Mathematics

Cite this

Maddila, S. R., & Yap, C. (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). Association for Computing Machinery, Inc. https://doi.org/10.1145/10515.10536

Moving a polygon around the corner in a corridor. / Maddila, Sanjeev R.; Yap, Chee.

Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986. Association for Computing Machinery, Inc, 1986. p. 187-192.

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

Maddila, SR & Yap, C 1986, Moving a polygon around the corner in a corridor. in Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986. Association for Computing Machinery, Inc, pp. 187-192, 2nd Annual Symposium on Computational Geometry, SCG 1986, Yorktown Heights, United States, 6/2/86. https://doi.org/10.1145/10515.10536
Maddila SR, Yap C. Moving a polygon around the corner in a corridor. In Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986. Association for Computing Machinery, Inc. 1986. p. 187-192 https://doi.org/10.1145/10515.10536
Maddila, Sanjeev R. ; Yap, Chee. / Moving a polygon around the corner in a corridor. Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986. Association for Computing Machinery, Inc, 1986. pp. 187-192
@inproceedings{3c8debcbad94484c941444fbc33f6495,
title = "Moving a polygon around the corner in a corridor",
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.",
author = "Maddila, {Sanjeev R.} and Chee Yap",
year = "1986",
month = "8",
day = "1",
doi = "10.1145/10515.10536",
language = "English (US)",
pages = "187--192",
booktitle = "Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986",
publisher = "Association for Computing Machinery, Inc",

}

TY - GEN

T1 - Moving a polygon around the corner in a corridor

AU - Maddila, Sanjeev R.

AU - Yap, Chee

PY - 1986/8/1

Y1 - 1986/8/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84918595870&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84918595870&partnerID=8YFLogxK

U2 - 10.1145/10515.10536

DO - 10.1145/10515.10536

M3 - Conference contribution

AN - SCOPUS:84918595870

SP - 187

EP - 192

BT - Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986

PB - Association for Computing Machinery, Inc

ER -