Carpenter's ruler problem
From Wikipedia, the free encyclopedia
The Carpenter's Ruler Problem is a discrete geometry problem, which can be stated in the following manner: Can a simple planar polygon be moved continuously to a position where all its vertices are in convex position, so that the edge lengths and simplicity are preserved along the way?
It was successfully solved by Robert Connelly, Erik Demaine and Günter Rote in 2003.
[edit] References
- R. Connelly, E.D. Demaine, G. Rote, Straightening polygonal arcs and convexifying polygonal cycles, Discrete Comput. Geom. 30 (2003), no. 2, 205-239
 |
This geometry-related article is a stub. You can help Wikipedia by expanding it. |
