Sciweavers

63
Voted
ISAAC
1999
Springer
91views Algorithms» more  ISAAC 1999»
15 years 1 months ago
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 monoton...
Therese C. Biedl, Erik D. Demaine, Sylvain Lazard,...