- Carpenter's ruler problem
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?" A closely related problem is to show that anypolygon can be "convexified", that is, continuously transformed, preserving edge distances and avoiding crossings, into a convex polygon.Both problems were successfully solved by
Robert Connelly ,Erik Demaine andGünter Rote in2000 .Subsequently to their work,
Ileana Streinu provided a simplified combinatorial proof. Both the original proof and Streinu's proof work by finding non-expansive motions of the input, continuous transformations such that no two points ever move towards each other. Streinu's version of the proof adds edges to the input to form apointed pseudotriangulation , removes one added convex hull edge from this graph, and shows that the remaining graph has a one-parameter family of motions in which all distances are nondecreasing. By repeatedly applying such motions, one eventually reaches a state in which no further expansive motions are possible, which can only happen when the input has been straightened or convexified.Streinu and Whitely (2005) provide an application of this result to the
mathematics of paper folding : they describe how to fold any single-vertexorigami shape using only simple non-self-intersecting motions of the paper. Essentially, this folding process is a time-reversed version of the problem of convexifying a polygon, but on the surface of a sphere rather than in the Euclidean plane.References
*cite journal
author = Connelly, Robert; Demaine, Erik D.; Rote, Günter
title = Straightening polygonal arcs and convexifying polygonal cycles
journal = Discrete and Computational Geometry
volume = 30
issue = 2
year = 2003
pages = 205–239
id = Preliminary version appeared at 41st Annual Symposium on Foundations of Computer Science, 2000
url = http://page.mi.fu-berlin.de/~rote/Papers/pdf/Straightening+polygonal+arcs+and+convexifying+polygonal+cycles-DCG.pdf
doi = 10.1007/s00454-003-0006-7*cite conference
author = Streinu, Ileana
title = A combinatorial approach to planar non-colliding robot arm motion planning
booktitle = Proceedings of the 41st Annual Symposium on Foundations of Computer Science
publisher = IEEE Computer Society
date = 2000
pages = 443–453
doi = 10.1109/SFCS.2000.892132
url = http://cs.smith.edu/~streinu/Papers/motion.ps*cite conference
author = Streinu, Ileana; Whiteley, Walter
title = Single-vertex origami and spherical expansive motions
booktitle = Discrete and Computational Geometry
pages = 161–173
publisher = Springer-Verlag, Lecture Notes in Computer Science 3742
year = 2005
id = MathSciNet | id = 2212105
Wikimedia Foundation. 2010.