Robert Connelly, Erik Demaine, Günter Rote: Straightening polygonal arcs and convexifying polygonal cycles. In: Discrete and Computational Geometry. 30. Jahrgang, Nr.2, 2003, Preliminary version appeared at 41st Annual Symposium on Foundations of Computer Science, 2000, S.205–239, doi:10.1007/s00454-003-0006-7 (englisch, fu-berlin.de [PDF]).
Erik D. Demaine, Martin L. Demaine, Sarah Demaine, Anna Lubiw, Andrew Winslow: Algorithms for Solving Rubik's Cubes. Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken. 2011, S.689–700, doi:10.1007/978-3-642-23719-5_58 (englisch).
Robert Connelly, Erik Demaine, Günter Rote: Straightening polygonal arcs and convexifying polygonal cycles. In: Discrete and Computational Geometry. 30. Jahrgang, Nr.2, 2003, Preliminary version appeared at 41st Annual Symposium on Foundations of Computer Science, 2000, S.205–239, doi:10.1007/s00454-003-0006-7 (englisch, fu-berlin.de [PDF]).
Erik Demaine, Joseph O’Rourke: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press, 2007, ISBN 978-0-521-85757-4, S.Part II (englisch, gfalop.org).