Convexifying Monotone Polygons - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1999

Convexifying Monotone Polygons


This paper considers reconfigurations of polygons, where each polygon edge is a rigid link, no two of which can cross during the motion. We prove that one can reconfigure 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.


Other [cs.OH]
Fichier principal
Vignette du fichier
Convexifying_Monotone_Polygons_ISAAC99.pdf (182.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00098832 , version 1 (15-12-2009)



Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss. Convexifying Monotone Polygons. 10th Annual International Symposium on Algorithms & Computation - ISAAC'99, Kamakoti V (IMSC, India) Rangarajan K (MCC, India) Rama R (IIT, Madras, India) Boopal E (IIT, Madras, India), Dec 1999, Chennai, India. 10 p, ⟨10.1007/3-540-46632-0_42⟩. ⟨inria-00098832⟩
78 View
17231 Download



Gmail Facebook Twitter LinkedIn More