### 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(n^{2}) time algorithm.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986 |

Publisher | Association for Computing Machinery, Inc |

Pages | 187-192 |

Number of pages | 6 |

ISBN (Electronic) | 0897911946, 9780897911948 |

DOIs | |

State | Published - Aug 1 1986 |

Event | 2nd Annual Symposium on Computational Geometry, SCG 1986 - Yorktown Heights, United States Duration: Jun 2 1986 → Jun 4 1986 |

### Other

Other | 2nd Annual Symposium on Computational Geometry, SCG 1986 |
---|---|

Country | United States |

City | Yorktown Heights |

Period | 6/2/86 → 6/4/86 |

### Fingerprint

### ASJC Scopus subject areas

- Geometry and Topology
- Theoretical Computer Science
- Computational Mathematics

### Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*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

}

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

SP - 187

EP - 192

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

PB - Association for Computing Machinery, Inc

ER -