pith. sign in

arxiv: 0809.1404 · v1 · pith:HEMHSF3Rnew · submitted 2008-09-08 · 🧮 math.DG

On the unfolding of simple closed curves

classification 🧮 math.DG
keywords curveresultclosedmotionplanepolygonsprogramsimple
0
0 comments X
read the original abstract

I show that every rectifiable simple closed curve in the plane can be continuously deformed into a convex curve in a motion which preserves arc length and does not decrease the Euclidean distance between any pair of points on the curve. This result is obtained by approximating the curve with polygons and invoking the result of Connelly, Demaine, and Rote that such a motion exists for polygons. I also formulate a generalization of their program, thereby making steps toward a fully continuous proof of the result. To facilitate this, I generalize two of the primary tools used in their program: the Farkas Lemma of linear programming to Banach spaces and the Maxwell-Cremona Theorem of rigidity theory to apply to stresses represented by measures on the plane.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.