Convexifying Monotone Polygons

This paper considers recon gurations of polygons, where each polygon edge is a rigid link, no two of which can cross during the motion. We prove that one can recon gure any monotone polygon into a convex polygon; a polygon is monotone if any vertical line intersects the interior at a (possibly empty) interval. Our algorithm computes in O(n2) time a sequence of O(n2) moves, each of which rotates just four joints at once.

• Type: Conference
• Year: 1999
• Where: ISAAC
• Authors: Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss
• Keywords: Algorithms, ISAAC 1999, Monotone Polygon, Paper Considers Recon, Polygon