| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Convexifying Monotone Polygons
Abstract : 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.
Mots-clés :
linkages
mécanismes articulés
Cited literature [9 references]
https://hal.inria.fr/inria-00098832
Contributor : Sylvain Lazard Connect in order to contact the contributor
Submitted on : Tuesday, December 15, 2009 - 3:13:48 PM
Last modification on : Friday, February 4, 2022 - 3:19:37 AM
Long-term archiving on: : Monday, April 5, 2010 - 11:51:51 PM
Contributor : Sylvain Lazard Connect in order to contact the contributor
Submitted on : Tuesday, December 15, 2009 - 3:13:48 PM
Last modification on : Friday, February 4, 2022 - 3:19:37 AM
Long-term archiving on: : Monday, April 5, 2010 - 11:51:51 PM
File
Convexifying_Monotone_Polygons...
Files produced by the author(s)