Moving a polygon around the corner in a corridor

Authors:
S Maddila;C K Yap
Affiliations:
Coordinated Science Laboratory, Department of Electrical and Computer Engineering, University of Illinois, Urbana, IL;Courant Institute of Mathematical Sciences, New York University, 251, Mercer Street, New York, NY
Venue:
SCG '86 Proceedings of the second annual symposium on Computational geometry
Year:
1986

Citing 0
Cited 2

Red-Blue intersection detection algorithms, with applications to motion planning and collision detection

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Implementing non-linear constraints with cooperative solvers

SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of moving an n vertex simple polygon around a corner in a right-angular corridor. We give an &Ogr;(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 an &Ogr;(n2) time algorithm.