Given a planar polygon (or chain) with a list of edges {e1, e2, e3, ..., en-1, en}, we examine the effect of several operations that permute this edge list, resulting in the formation of a new polygon. The main operations that we consider are: reversals which involve inverting the order of a sublist, transpositions which involve interchanging subchains (sublists), and edge-swaps which are a special case and involve interchanging two consecutive edges. When each edge of the given polygon has also been assigned a direction we say that the polygon is signed. In this case any edge involved in a reversal changes direction. We show that a star-shaped polygon can be convexified using O(n2) edge-swaps, while maintaining simplicity, and that this is tight in the worst case. We show that determining whether a signed polygon P can be transformed to one that has rotational or mirror symmetry with P, using transpositions, takes Θ(n log n) time. We prove that the problem of deciding whether transpositions can modify a polygon to fit inside a rectangle is weakly NP-complete. Finally we give an O(n log n) time algorithm to compute the maximum endpoint distance for an oriented chain.

Additional Metadata
Keywords Computational geometry, geometric permutation, polygonal reconfiguration
Persistent URL dx.doi.org/10.1142/S0218195911003561
Journal International Journal of Computational Geometry and Applications
Citation
Aloupis, G, Bose, P, Demaine, E.D. (Erik D.), Langerman, S. (Stefan), Meijer, H. (Henk), Overmars, M. (Mark), & Toussaint, G.T. (Godfried T.). (2011). Computing signed permutations of polygons. International Journal of Computational Geometry and Applications, 21(1), 87–100. doi:10.1142/S0218195911003561