### 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 |

### Publication series

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

### Other

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

Country | United States |

City | Yorktown Heights |

Period | 6/2/86 → 6/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