Reconfiguring Convex Polygons

O. Aichholzer, E. Demaine, J. Erickson, F. Hurtado, M. Overmars, M. Soss, and G. Toussaint

Abstract:

We prove that there is a motion from any convex polygon to any convex polygon with the same counterclockwise sequence of edge lengths, that preserves the lengths of the edges, and keeps the polygon convex at all times. Furthermore, the motion is “direct” (avoiding any intermediate canonical configuration like a subdivided triangle) in the sense that each angle changes monotonically throughout the motion. In contrast, we show that it is impossible to achieve such a result with each vertex-to-vertex distance changing monotonically. We also demonstrate that there is a motion between any two such polygons using three-dimensional moves known as pivots, although the complexity of the motion cannot be bounded as a function of the number of vertices in the polygon.

Reference: O. Aichholzer, E. Demaine, J. Erickson, F. Hurtado, M. Overmars, M. Soss, and G. Toussaint. Reconfiguring convex polygons. Computational Geometry: Theory and Applications, 20:85-95, 2001. [Report UU-CS-2000-30, Universiteit Utrecht, The Netherlands, 2000].