Moving a polygon around the corner in a corridor
Sanjeev Rao Maddila, Chee Keng Yap · 1986
We consider the problem of moving an n vertex simple polygon around a corner in a right-angular corridor. We give an Ο(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 Ο(n2) time algorithm.