Geometric folding algorithms: Linkages, origami, polyhedra

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Volumn 9780521857574, Issue , 2007, Pages 1-472

  Demaine, Erik D ^a   O’rourke, Joseph ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b SMITH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; STUDENTS;

2D OBJECTS; ALGEBRAIC CURVES; COMPUTATIONAL ASPECTS; CONVEX POLYHEDRONS; GRADUATE STUDENTS; PLANAR LINKAGE; SCHOOL STUDENTS; STRAIGHT-LINE DRAWINGS;

EDUCATION;

EID: 84924606008     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511735172     Document Type: Book

References (421)

1. Tim Abbott and Reid Barton. Generalizations of Kempe’s universality theorem, Manuscript, December 2004. Cited on 37, 39.
2. Hisashi Abe. Possibility of trisection of arbitrary angle by paper folding. In SUGAKU Seminar, July 1980. Cited on 285.
3. Aaron Abrams and Robert Ghrist. Finding topology in a factory: Configuration spaces. Am. Math. Mon, 109(2):140-150, 2002. Cited on 18.
4. Colin C. Adams. The Knot Book.W. H. Freeman, New York, 1994. Cited on 89, 92, 128.
5. Colin Adams, Bevin Brennan, Deborah Greilsheimer, and Alexander Woo. Stick numbers and composition of knots and links. J. Knot Theory Ramifications,6(2):149-161,1997. Cited on 90.
6. Pankaj K. Agarwal, Boris Aronov, Joseph O’Rourke, and Catherine A. Schevon. Star unfolding of a polytope with applications. SIAM J. Comput.,26:1689-1713,1997. Cited on 360, 367, 370.
7. Richa Agarwala, Serafim Batzoglou, Vlado Dancik, Scott E. Decatur, Martin Farach, Sridhar Hannenhalli, S. Muthukrishnan, and Steven Skiena. Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model. J. Comput. Biol.,4(2):275-296,1997. Cited on 160.
8. Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, and Pat Morin. Flipping your lid. Geombinatorics,10(2):57-63, 2000. Cited on 80.
9. OswinAichholzer, David Alberts, Franz Aurenhammer, and Bernd Gartner. A novel type of skeleton for polygons. J. Universal Comput. Sci.,1(12):752-761,1995. Cited on 256.
10. Oswin Aichholzer and Franz Aurenhammer. Straight skeletons for general polygonal figures in the plane. In Proc. 2nd Annu. Int. Conf. Comput. Combin., volume 1090 of Lecture Notes in Computer Science, pages 117-126. Springer-Verlag, Berlin, 1996. Cited on 256, 257.
11. OswinAichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristan, and Michael Soss. Long proteins with unique optimal foldings in the H-P model. Comput. Geom. Theory Appl.,25(1-2):139-159, May 2003. Cited on 161, 162, 164.
12. OswinAichholzer, Carmen Cortes, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark Overmars, Belen Palop, Suneeta Ramaswami, and Godfried T. Toussaint. Flipturning polygons. Discrete Comput. Geom.,28:231-253, 2002. Cited on 76, 80.
13. OswinAichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark Overmars, Michael Soss, and Godfried T. Toussaint. Reconfiguring convexpolygons. Comput. Geom. TheoryAppl.,20:85-95,2001. Cited on 72, 73.
14. Martin Aigner and Gunter M. Ziegler. Proofs from THE BOOK. Springer-Verlag, Berlin, 1999. 2nd corrected printing. Cited on 144, 341.
15. Jin Akiyama and Gisaku Nakamura. Foldings of regular polygons to convex polyhedra I: Equilateral triangles. In Proc. 2003 Indonesia-Japan Conf. Combinatorial Geom. Graph Theory, volume 3330 of Lecture Notes in Computer Science, pages 34-43, Springer-Verlag, Berlin, 2005. Cited on 419.
16. Jin Akiyama, Takemasa Ooya, and Yuko Segawa. Wrapping a cube.Teach. Math. Appl., 16(3):95-100, 1997. Cited on 238.
17. Rebecca Alexander, Heather Dyson, and Joseph O’Rourke. The convex polyhedra foldable from a square. In Proc. 2002 Japan Conf. Discrete Comput. Geom., volume 2866 of Lecture Notes in Computer Science, pages 38-50, Springer-Verlag, Berlin, 2003. Cited on 414, 415, 417.
18. Alexandr D. Alexandrov. Vupyklue Mnogogranniki. Gosydarstvennoe Izdatelstvo Tehno-Teoreticheskoi Literaturu, 1950 [in Russian]. See Alexandrov (1958) for German translation and Alexandrov (2005) for English translation. Cited on 367.
19. Alexandr D. Alexandrov. DieInnereGeometriederKonvexenFlachen.Math. LehrbucherundMonographien. kademie-Verlag, Berlin, 1955. Cited on 366.
20. Alexandr D. Alexandrov.Konvexe Polyeder.Math. Lehrbucher und Monographien. AkademieVerlag, Berlin, 1958. Translation of the 1950 Russian edition. Cited on 299, 354.
21. Alexandr D. Alexandrov. Existence of a convex polyhedron and a convex surface with a given metric. In Yu. G. Reshetnyak and S. S. Kutateladze, editors, A. D. Alexandrov: Selected Works: PartI, pages 169-173. Gordon and Breach, Australia, 1996. Translation of DokladyAkad. Nauk SSSR, Matematika, volume 30, No. 2,103-106,1941. Cited on 348, 350, 354.
22. Alexandr D. Alexandrov.Convex Polyhedra. Springer-Verlag, Berlin, 2005. Monographs in Mathematics. Translation of the 1950 Russian edition by N. S. Dairbekov, S. S. Kutateladze, and A. B. Sossinsky. Cited on 299, 345, 349, 350, 352, 358, 359, 361.
23. Alexandr D. Alexandrov. Intrinsic geometry of convex surfaces. In s. S. Kutateladze, editor, A. D. Alexandrov: Selected Works: Part II, pages 1-426. Chapman & Hall, Boca Raton, FL, 2006. Cited on 342, 354, 366.
24. Alexandr D. Alexandrov and Victor A. Zalgaller.Intrinsic Geometry of Surfaces. American Mathematical Society, Providence, RI, 1967. Cited on 373, 374.
25. Greg Aloupis. Reconfigurations of Polygonal Structures. PhD thesis, McGill University, School of Computer Science, 2005. Cited on 380.
26. Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Ileana Streinu, Joseph O’Rourke, Mark Overmars, Michael Soss, and Godfried T. Toussaint. Flat-state connectivity of linkages under dihedral motions. In Proc. 13th Annu. Int. Symp. Algorithm Comput., volume 2518 of Lecture Notes in Computer Science, pages 369-380. Springer-Verlag, Berlin, 2002a. Cited on 137, 138,142,152.
27. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O’Rourke, Ileana Streinu, and Godfried Toussaint. Unfolding polyhedral bands. In Proc. 16th Can. Conf. Comput. Geom., pages 60-63, 2004. Cited on 380.
28. Greg Aloupis, Erik D. Demaine, Henk Meijer, Joseph O’Rourke, Ileana Streinu, and Godfried T. Toussaint. Flat-state connectedness of fixed-angle chains: Special acute chains. In Proc. 14th Can. Conf. Comput. Geom., pages 27-30, 2002b. Cited on 138.
29. Greg Aloupis and Henk Meijer. Reconfiguring planar dihedral chains. In Proc. 22nd Eur. Workshop Comput. Geom., 2006. Cited on 138.
30. Roger C. Alperin. A mathematical theory of origami constructions and numbers. New York J. Math, 6:119-133, 2000. Cited on 287, 289.
31. Roger C. Alperin. A grand tour of pedals of conics. Forum Geometricorum,4:143-151,2004. Cited on 285, 287.
32. Helmut Alt, Christian Knauer, Gunter Rote, and Sue Whitesides. On the complexity of the linkage reconfiguration problem. In J. Pach, editor, Towards a Theory of Geometric Graphs, volume 342 of Contemporary Mathematics, pages 1-14. American Mathematical Society, New York, 2004. Cited on 18, 20, 22, 23, 24, 114.
33. Nancy M. Amato and Guang Song. Using motion planning to map protein folding landscapes and analyze protein folding kinetics of known native structures. Technical Report TR01-001, Depertment of Computer Science, Texas A&M University, 2001. Cited on 157.
34. Kenneth Appel and Wolfgang Haken. Every planar map is four colourable, Part I: discharging. Illinois J. Math.,21:429-490,1977. Cited on 31.
35. Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, and Steven S. Skiena. When can you fold a map? Comput. Geom. Theory Appl.,29(1):166-195, 2004. Cited on204, 224, 226, 230, 231.
36. Esther M. Arkin, Sandor P. Fekete, and Joseph S. B. Mitchell. An algorithmic study of manufacturing paperclips and other folded structures. Comput. Geom. Theory Appl.,25:117-138, 2003. Cited on 14.
37. Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, and Steven S. Skiena. Hamiltonian triangulations for fast rendering. Visual Comput., 12(9):429-444,1996. Cited on 235.
38. Boris Aronov, Jacob E. Goodman, and Richard Pollack. Convexification of planar polygons in R3. Manuscript, June 2002, http://math.nyu.edu/faculty/pollack/convexifyingapolygon10-27-99.ps. Cited on 83.
39. Boris Aronov and Joseph O’Rourke. Nonoverlap of the star unfolding. Discrete Comput. Geom.,8:219-250, 1992. Cited on 326, 366, 367, 369, 371.
40. Andrej V Astrelin and Idzhad Sabitov. A canonical polynomial for the volume of a polyhedron. Russian Math. Surv.,54(2):430-431,1999. Cited on 348.
41. Franz Aurenhammer, Friedrich Hoffmann, and Boris Aronov. Minkowski-type theorems and least-squares clustering. Algorithmica,20:61-76,1998. Cited on 341.
42. Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, and Piotr Indyk. Low-dimensional embedding with extra information. Discrete Comput. Geom.,36(4):609-632,2006. Cited on 48, 49.
43. Devin J. Balkcom. Robotic Origami Folding. PhD thesis, Carnegie Mellon University, August 2004. Cited on 292.
44. Devin J. Balkcom, ErikD. Demaine, and Martin L. Demaine. Folding paper shopping bags. In Proc. 14th Annu. Fall Workshop Comput. Geom., pages 14-15. MIT, Cambridge, MA, November 2004. Cited on 292, 293.
45. Devin J. Balkcom and Matthew T. Mason. Introducing robotic origami folding. In IEEE Int. Conf Robot. Autom., pages 3245-3250, 2004. Cited on 292.
46. Werner Ballmann, Gudlaugur Thorbergsson, and Wolfgang Ziller. On the existence of short closed geodesics and their stability properties. In Seminar on Minimal Submanifolds, pages 53-63. Princeton University Press, Princeton, NJ. 1983. Cited on 374.
47. Jerome Barraquand, Lydia Kavraki, Jean-Claude Latombe, Tsai-Yen Li, Rajeev Motwani, and Prab-hakar Raghavan. A random sampling scheme for path planning in large-dimensional configuration spaces. Int. J. Robot. Res., 16(6):759-774,1997. Cited on 157.
48. Jerome Barraquand and Jean-Claude Latombe. A Monte-Carlo algorithm for path planning with many degrees of freedom. In Proc. IEEE Int. Conf. Robot. Autom., pages 1712-1717, May 1990. Cited on 12.
49. John J. Bartholdi, and Paul Goldsman. The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle. Oper. Res. Lett.,32:304-308, 2004. Cited on 337.
50. Saugata Basu, Richard Pollack, and Marie-Francoise Roy. Computing roadmaps of semi-algebraic sets on a variety. J. Am. Math. Soc.,13:55-82, 2000. Cited on 18, 19.
51. Alex Bateman. Computer tools and algorithms for origami tessellation design. In Origami: Proc. 3rd Int. Meeting Origami Sci., Math, Educ. (2001), pages 39-51. A K Peters, Wellesley MA., 2002. Cited on 293.
52. sarah-marie belcastro and Thomas C. Hull. A mathematical model for non-flat origami. In Origami3: Proc. 3rd Int. Meeting Origami Sci., Math, Educ. (2001), pages 39-51, A K Peters, Wellesley, MA, 2002a. Cited on 210, 211, 212.
53. sarah-marie belcastro and Thomas C. Hull. Modelling the folding of paper into three dimensions using affine transformations. Linear Algebra Appl.,348:273-282, June 2002b. Cited on210,211, 212.
54. Nadia Benbernou, Patricia Cahn, and Joseph O’Rourke. Unfolding smooth prismatoids. In Proc. 14th Annu. Fall Workshop Comput. Geom., pages 12-13, November 2004, arXiv:cs.CG/0407063. Cited on 323.
55. Nadia Benbernou and Joseph O’Rourke. On the maximum span of fixed-angle chains. In Proc. 18th Can. Conf. Comput. Geom., 2006. Cited on 135.
56. Bonnie Berger, Jon Kleinberg, and Tom Leighton. Reconstructing a three-dimensional model with arbitrary errors. J. Assoc. Comput. Mach.,46(2):212-235,1999. Cited on48.
57. Bonnie Berger and Tom Leighton. Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete. J. Comput. Biol., 5(1):27-40,1998. Cited on 160.
58. Marcel Berger. A Panoramic View ofRiemannian Geometry. Springer-Verlag, Berlin, 2003. Cited on 303, 373.
59. Marshall Bern, Erik D. Demaine, David Eppstein, and Barry Hayes. A disk-packing algorithm for an origami magic trick. In Proc. Int. Conf. Fun Algorithms, pages 32-42, June 1998. See also Bern et al. (2002). Cited on 255, 263, 266.
60. Marshall Bern, Erik D. Demaine, David Eppstein, and Barry Hayes. A disk-packing algorithm for an origami magic trick. In Origami3: Proc. 3rd Int. Meeting Origami Sci., Math, Educ. (2001), pages 17-28, A K Peters, Wellesley, MA, 2002. Cited on 255, 263, 266.
61. Marshall Bern, Erik D. Demaine, David Eppstein, and Eric Kuo. Ununfoldable polyhedra. In Proc. 11th Can. Conf. Comput. Geom., pages 13-16,1999. See Bern et al. (2003). Cited on 318.
62. Marshall Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, and Jack Snoeyink. Ununfoldable polyhedra with convex faces. Comput. Geom. Theory Appl., 24(2):51-62, 2003. Citedon311, 318,321.
63. Marshall W. Bern and David Eppstein. Quadrilateral meshing by circle packing. Int. J. Comput. Geom. Appl,10(4):347-360, 2000. Cited on 266.
64. Marshall Bern and Barry Hayes. The complexity of flat origami. In Proc. 7th ACM-SIAM Symp. Discrete Algorithms, ACM/SIAM, New York/Philadelphia, pages 175-183, 1996. Cited on 169, 199, 207, 214, 216, 217, 222, 232.
65. Marshall W. Bern, Scott Mitchell, and Jim Ruppert. Linear-size nonobtuse triangulation of polygons. Discrete Comput. Geom.,14:411-428,1995. Cited on 266.
66. Dimitris Bertsimas and Santosh Vempala. Solving convex programs by random walks. J. Assoc. Comput. Mach., 54(4):540-556, 2004. Cited on 105.
67. Therese Biedl. Polygons needing many flipturns. Discrete Comput. Geom.,35(1):131-141, 2006. Cited on 81.
68. Therese Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, PaulNijjar, RyuheiUehara, and Ming-wei Wang. Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. In Proc. 14th Can. Conf. Comput. Geom., pages 105-108, August 2002a. Cited on 434, 435.
69. Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O’Rourke, Mark Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, and Sue Whitesides. Locked and unlocked polygonal chains in 3D. In Proc. 10th ACM-SIAM Symp. Discrete Algorithms, ACM/SIAM, New York/Philadelphia, pages 866-867, January 1999. See Biedl et al. (2001a). Cited on82, 84, 88,89,90, 113.
70. Therese Biedl, ErikD. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O’Rourke, Mark Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, and Sue Whitesides. Locked and unlocked polygonal chains in three dimensions. Discrete Comput. Geom.,26(3):269-282,2001a. Cited on 74, 82, 84.
71. Therese Biedl, ErikD. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O’Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, and Sue Whitesides. On reconfiguring tree linkages: Trees can lock. Discrete Appl. Math.,117(1-3):293-297, 2002b. Cited on 94,114.
72. Therese Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O’Rourke, Mark Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, and Sue Whitesides. On reconfiguring tree linkages: Trees can lock. In Proc. 10th Can. Conf. Comput. Geom., pages 4-5, 1998a. See Biedl et al. (2002b). Cited on 88, 94, 95, 96.
73. Therese Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O’Rourke, Mark Overmars, Steve Robbins, and Sue Whitesides. Unfolding some classes of orthogonal polyhe-dra. In Proc. 10th Can. Conf. Comput. Geom., pages 70-71, 1998b. Full version available at:http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-biedl-unfolding.ps.gz. Cited on 309,310, 329, 330.
74. Therese Biedl, ErikD. Demaine, ChristianA. Duncan, Rudolf Fleischer, and Stephen G. Kobourov. Tight bounds on maximal and maximum matchings. In Proc. 12th Annu. Int. Symp. Algorithms Comput., volume 2223 of Lecture Notes in Computer Science, pages 308-319. Springer-Verlag, Berlin, December 2001b. Cited on 308.
75. Therese Biedl, Michael Kaufmann, and Petra Mutzel. Drawing planar partitions II: HH-drawings. In Proc. 24thInt. Workshop Graph-Theoret. Concepts Comput. Sci., volume 1517 of Lecture Notes in Computer Science, pages 124-136. Springer-Verlag, Berlin, 1998c. Cited on 336.
76. Therese Biedl, Anna Lubiw, and Julie Sun. When can a net fold to a polyhedron? Comput. Geom. TheoryAppl.,31(3):207-218, June 2005. Cited on 431, 432, 433, 434, 435, 436, 437.
77. George D. Birkhoff. Dynamical Systems, volume IX of AMS Colloquium Publications. American Mathematical Society, New York, 1927. Cited on 374.
78. Harry Blum. A transformation for extracting new descriptors of shape. In W. Wathen-Dunn, editor, Models for the Perception of Speech and Visual Form, pages 362-380. MIT Press, Cambridge, 1967. Cited on 370.
79. Lenore Blum, Felipe Cucker, Michael Shub, and Steve Smale. Complexity and Real Computation.Springer-Verlag, New York, 1998. Cited on 44.
80. Robert Bohlin and Lydia Kavraki. Path planning using lazy PRM. In Proc. Int. Conf. Robot. Autom., volume 1, pages 521-528, 2000. Cited on 157.
81. Valerie Boor, Mark Overmars, and A. Frank van der Stappen. The Gaussian sampling strategy for probabilistic roadmap planners. In Proc. IEEE Int. Conf. Robot. Autom., pages 1018-1023,1999. Cited on 156.
82. Prosenjit Bose, Francisco Gomez, Pedro Ramos, and Godfried T. Toussaint. Drawing nice projections of objects in space. In Proc. 3rd Int. Symp. Graph Drawing (1995), volume 1027 of Lecture Notes in Computer Science, pages 52-63. Springer-Verlag, Berlin, 1996. Cited on 122.
83. Robert Bowen and Stephen Fisk. Generations of triangulations of the sphere. Math. Comput.,21:250-252,1967. Cited on 407.
84. David Brill. Justin’s origami trisection. Br Origami, 107:14, 1984. Cited on 285.
85. Aren Bronsted. An Introduction to Convex Polytopes. Springer-Verlag, New York, 1983. Cited on 390.
86. Nicolaas G. de Bruijn. Problems 17 and 18. Nieuw Arch. Wiskunde, 2:67, 1954. Answers in Wis-kundige Opgaven met de oplossingen,20:19-20, 1955. Cited on 125.
87. Sergio Cabello, Erik D. Demaine, and Gunter Rote. Planar embeddings of graphs with specified edge lengths. In Proc. 11th Int. Symp. Graph Drawing (2003), volume 2912 of Lecture Notes in Computer Science, pages 283-294, Springer-Verlag, Berlin, 2004. Cited on 48.
88. Gruia Calinescu and Adrian Dumitrescu. The carpenter’s ruler folding problem. In J. E. Goodman, J. Pach, and E. Welzl, editors, Combinatorial and Computational Geometry, volume 52 of Mathematics Sciences Research Institute Publications, pages 155-166. Cambridge University Press, Cambridge, UK, 2005. Cited on 26.
89. Jorge Alberto Calvo, Danny Krizanc, Pat Morin, Michael A. Soss, and Godfried T. Toussaint. Con-vexifying polygons with simple projections. Inform. Process. Lett.,80(2):81-86, 2001. Cited on 119,122.
90. John Canny. The Complexity of Robot Motion Planning. ACM-MIT Press Doctoral Dissertation Award Series. MIT Press, Cambridge, MA, 1987. Cited on 18, 19.
91. John Canny. Some algebraic and geometric computations in PSPACE. In Proc. 20th Annu. ACM Symp. Theory Comput., ACM, New York, pages 460-467, 1988. Cited on 18,19, 20.
92. Jason H. Cantarella, Erik D. Demaine, Hayley N. Iben, and James F. O’Brien. An energy-driven approach to linkage unfolding. In Proc. 20th Annu. ACM Symp. Comput. Geom., ACM, New York, pages 134-143, June 2004. Cited on 88, 111,112.
93. Jason Cantarella and Heather Johnston. Nontrivial embeddings of polygonal intervals and unknots in 3-space. J. Knot Theory Ramifications,7:1027-1039, 1998. Cited on 88, 89, 90, 91, 154.
94. Steven Casey. Chessboard. In R. J. Lang, editor, Proc. West Coast Origami Guild, number 19, pages 3-12, August 1989. Cited on 238.
95. Michael L. Catalano-Johnson and Daniel Loeb. Problem 10716: A cubical gift. Amer. Math. Mon., 108(1):81-82, January 2001. Posed in volume 106,1999, page 167. Cited on 237, 238.
96. Augustin L. Cauchy. Sur les polygones et les polyedres, seconde memoire. J. Ecole Polytechnique, XVIe Cahier, Tome IX:113-148,1813. OEuvres Completes, IIe Serie, volume 1, pages 26-38. Paris, 1905. Cited on 341.
97. Hue Sun Chan and Ken A. Dill. The protein folding problem. Physics Today, pages 24-32, February 1993. Cited on 158, 159, 160.
98. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, MichaSharir, and Jack Snoeyink. Ray shooting inpolygons using geodesic triangulations. Algorithmica,12:54-68, 1994. Cited on 108.
99. Jindong Chen and Yijie Han. Shortest paths on a polyhedron. Int. J. Comput. Geom. Appl.,6:127-144, 1996. Cited on 360, 364, 366.
100. Shiing-Shen Chern. Curves and surfaces in Euclidean space. In S. S. Chern, editor, Studies in Global Geometry and Analysis, volume 4 of Studies in Mathematics, pages 16-56. Mathematical Association of America, Washington, DC, 1967. Cited on 147.
101. Barry Cipra. Collaboration closes in on closed geodesics. What’s Happening in the Mathematical Sciences, 1:27-30,1993. Cited on 374.
102. Barry Cipra. In the fold: Origami meets mathematics. SIAM News, 34(8):200-201, October 2001. Cited on 169.
103. Roxana Cocan and Joseph O’Rourke. Polygonal chains cannot lock in 4D. In Proc. 11th Can. Conf. Comput. Geom., pages 5-8,1999. See Cocan and O’Rourke (2001). Cited on 88, 92.
104. Roxana Cocan and Joseph O’Rourke. Polygonal chains cannot lock in 4D. Comput. Geom. Theory Appl.,20:105-129, 2001. Cited on 88, 92, 93, 94.
105. Robert Connelly. A flexible sphere. Math. Intelligencer,1:130-131, 1978. Cited on347.
106. Robert Connelly. Flexing surfaces. In D. A. Klarner, editor, The Mathematical Gardner, pages 79-89. Wadsworth, 1981. Cited on 347.
107. Robert Connelly. Rigidity and energy. Invent. Math., 66:11-33,1982. Cited on 116.
108. Robert Connelly. On generic global rigidity. In P. Gritzman and B. Sturmfels, editors, Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, volume 4 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 147-155, AMS Press, 1991. Cited on 49.
109. Robert Connelly. Rigidity. In Handbook of Convex Geometry, volume A, pages 223-271. North-Holland, Amsterdam, 1993. Cited on 43, 292, 342.
110. Robert Connelly. Generic global rigidity. Discrete Comput. Geom., 33:549-563,2005. Cited on 48, 49.
111. Robert Connelly and Erik D. Demaine. Geometry and topology of polygonal linkages. In J. E. Goodman and J. O’Rourke, editors, Handbook of Discrete and Computational Geometry, 2nd edition, chapter 9, pages 197-218. CRC Press LLC, Boca Raton, FL, 2004. Cited on 18, 28, 31, 113.
112. Robert Connelly, ErikD. Demaine, Martin L. Demaine, Sandor Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribo, and Gunter Rote. Locked and unlocked chains of planar shapes. In Proc. 22nd Annu. ACM Symp. Comput. Geom., ACM, New York, pages 61-70,2006. Cited on 119.
113. Robert Connelly, Erik D. Demaine, and Gunter Rote. Every polygon can be untangled. In Proc. 16th Eur. Workshop Comput. Geom., pages 62-65. Ben-Gurion University, the Negev, Israel, January 2000a. Cited on 88.
114. Robert Connelly, ErikD. Demaine, and Gunter Rote. Straightening polygonal arcs and convexifying polygonal cycles. In Proc. 41st Annu. IEEE Symp. Found. Comput. Sci., IEEE, Los Alamitos, pages 432-442, November 2000b. Cited on 88, 96.
115. Robert Connelly, Erik D. Demaine, and Gunter Rote. Infinitesimally locked self-touching linkages with applications to locked trees. In J. Calvo, K. Millett, and E. Rawdon, editors, Physical Knots: Knotting, Linking, and Folding of Geometric Objects in R3, pages 287-311. American Mathematical Society, Providence, RI, 2002a. Cited on 95,113, 114,115, 116,117,118.
116. Robert Connelly, ErikD. Demaine, and Gunter Rote. Straighteningpolygonal arcs and convexifying polygonal cycles. Technical Report B02-02, Freie Universitat Berlin, 2002b. Cited on 58, 104, 109.
117. Robert Connelly, ErikD. Demaine, and Gunter Rote. Straighteningpolygonal arcs and convexifying polygonal cycles. Discrete Comput. Geom., 30(2):205-239, September 2003. Cited on 50,87,96, 97, 98, 99, 100, 104, 105, 106, 112.
118. Robert Connelly, Idzhad Sabitov, and Anke Walz. The bellows conjecture. BeitrageAlgebra Geom.,38:1-10, 1997. Citedon348.
119. Robert Connelly and Herman Servatius. Higher-order rigidity - What is the proper definition? Discrete Comput. Geom.,11(2):193-200,1994. Cited on 52.
120. Robert Connelly and Walter Whiteley. Second-order rigidity and pre-stress stability for tensegrity frameworks. SIAM J. Discrete Math.,9(3):453-491, August 1996. Cited on 52, 53, 56.
121. H. S. M. Coxeter. Regular Polytopes,2nd edition. Dover, New York, 1973. Cited on 329.
122. H. S. M. Coxeter and Samuel L. Greitzer. Geometry Revisited. MathematicalAssociation of America, Washington, DC, 1967. Cited on 30.
123. Thomas E. Creighton, editor. Protein Folding. W. H. Freeman & Co., June 1992. Cited on 148.
124. Luigi Cremona. Graphical Statics (English translation). Oxford University Press, Oxford, UK, 1890. Cited on 58.
125. Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, and Mihalis Yannakakis. On the complexity of protein folding. J. Comput. Biol.,5(3):423-466,1998. Cited on 159, 160.
126. Christopher Croke. Poincare’s problem and the length of the shortest closed geodesic on a convex hypersurface. J.Diff. Geom.,17(4):595-634,1982. Cited on 375.
127. Peter Cromwell. Polyhedra. Cambridge University Press, Cambridge, UK, 1997. Cited on 143,341, 346, 348.
128. Artur Czumaj and Willy-B. Strothmann. Bounded degree spanning trees. In Proc. 5thAnnu. Eur. Symp. Algorithms, volume 1284 of Lecture Notes in Computer Science, pages 104-117, SpringerVerlag, Berlin, 1997. Cited on 308.
129. Mirela Damian, Robin Flatland, Henk Meijer, and Joseph O’Rourke. Unfolding well-separated orthotrees. In 15th Annu. Fall Workshop Comput. Geom., pages 23-25, November 2005a. Cited on 330.
130. Mirela Damian, Robin Flatland, and Joseph O’Rourke. Unfolding Manhattan towers. In Proc. 17th Can. Conf. Comput. Geom., pages 204-207, 2005b. Cited on 331, 332.
131. Mirela Damian, Robin Flatland, and Joseph O’Rourke. Grid vertex-unfolding orthogonal polyhedra. In Proc. 23rdSymp. Theoret. Aspects Comput. Sci., volume 3884 of Lecture Notes in Computer Science, pages 264-276. Springer-Verlag, Berlin, 2006. Cited on 330, 338.
132. Mirela Damian, Robin Flatland, and Joseph O’Rourke. Epsilon-unfolding orthogonal polyhedra. Graphs Combinatorics, to appear, 2007. Cited on 331, 332.
133. Mirela Damian and Henk Meijer. Grid edge-unfolding orthostacks with orthogonally convex slabs. In 14th Annu. Fall Workshop Comput. Geom., pages 20-21, November 2004. Cited on 331.
134. Robert J. Dawson. On removing a ball without disturbing the others. Math. Mag.,57:27-30,1984. Cited on 125.
135. ErikD. Demaine. Foldingand Unfolding. PhD thesis, Department of Computer Science, University of Waterloo, 2001. Cited on 154.
136. Erik D. Demaine and Martin L. Demaine. Computing extreme origami bases. Technical Report CS-97-22, Department of Computer Science, University of Waterloo, May 1997. Cited on 94.
137. Erik D. Demaine and Martin L. Demaine. The power of paper folding. Unpublished manuscript, 2000. Cited on 289.
138. Erik D. Demaine and Martin L. Demaine. Recent results in computational origami. In Origami3: Proc. 3rd Int. Meeting Origami Science, Math, Educ. (2001), pages 3-16, A K Peters, Wellesley, MA, 2002. Cited on 169.
139. Erik D. Demaine, Martin L. Demaine, and Anna Lubiw. Folding and one straight cut suffice. In Proc. 10th Annu. ACM-SIAM Symp. Discrete Algorithm, ACM/SIAM, New York/Philadelphia, pages 891-892, January 1999a. Cited on 255.
140. Erik D. Demaine, Martin L. Demaine, and Anna Lubiw. Polyhedral sculptures with hyperbolic paraboloids. In Proc. 2nd Annu. Conf. BRIDGES: Math. Connections Art, Music, Sci., Winfield, KS, pages 91-100, 1999b. Cited on 294.
141. Erik D. Demaine, Martin L. Demaine, and Anna Lubiw. Folding and cutting paper. In Proc. 1998 Japan Conf. Discrete Comput. Geom., volume 1763 of Lecture Notes in Computer Science, pages 104-117. Springer-Verlag, Berlin, 2000a. Cited on 255, 257, 259.
142. Erik D. Demaine, Martin L. Demaine, and Anna Lubiw. Flattening polyhedra. Unpublished manuscript, 2001a. Cited on 279, 282, 283, 438.
143. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, and Joseph O’Rourke. Examples, counterexamples, and enumeration results for foldings and unfoldings between polygons and polytopes. Technical Report 069, Smith College, Northampton, MA, July 2000b. arXiv:cs.CG/0007019. Cited on 329, 383, 384, 385, 412, 426, 427.
144. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, and Joseph O’Rourke. Enumerating foldings and unfoldings between polygons and polytopes. Graphs Comb.,18(1):93-104, 2002a. See also Demaine et al. (2000b). Cited on 402.
145. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O’Rourke, and Irena Pashchenko. Metamorphosis of the cube. In Proc. 15th Annu. ACM Symp. Comput. Geom., ACM, New York, pages 409-410,1999c. Video and abstract. Cited on 391, 392.
146. Erik D. Demaine, Martin L. Demaine, and Joseph S. B. Mitchell. Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami. Comput. Geom. Theory Appl., 16(1):3-21, 2000c. Cited on 169, 232, 236, 237.
147. Erik D. Demaine, Satyan L. Devadoss, Joseph S. B. Mitchell, and Joseph O’Rourke. Continuous foldability of polygonal paper. In Proc. 16th Can. Conf. Comput. Geom., pages 64-67, August 2004. Cited on 172.
148. Erik D. Demaine, Satyan L. Devadoss, Joseph S. B. Mitchell, and Joseph O’Rourke. Continuous foldability of polygonal paper. Unpublished manuscript, 2006a. Cited on 172,187, 437.
149. Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, and Joseph O’Rourke. Vertex-unfoldings of simplicial manifolds. Technical Report 072, Department of Computer Science, Smith College, Northampton, MA, October 2001b. arXiv:cs.CG/0110054. Cited on 335.
150. Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, and Joseph O’Rourke. Vertex-unfoldings of simplicial manifolds. In A. Bezdek, editor, Discrete Geometry, pages 215-228. Marcel Dekker, 2003a. Cited on 334, 337, 338.
151. Erik D. Demaine, Blaise Gassend, Joseph O’Rourke, and Godfried. T. Toussaint. Polygons flip finitely: Flaws and a fix. In Proc. 18th Can. Conf. Comput. Geom., 2006b. Cited on 76.
152. Erik D. Demaine, John Iacono, and Stefan Langerman. Grid vertex-unfolding of orthostacks. In Proc. 2004 Japan Conf. Discrete Comput. Geom., volume 3742 of Lecture Notes in Computer Science, pages 76-82. Springer-Verlag, Berlin, November 2005. Cited on 330, 338.
153. Erik D. Demaine, Stefan Langerman, and Joseph O’Rourke. Short interlocked linkages. In Proc. 13th Can. Conf. Comput. Geom., pages 69-72, August 2001c. Cited on 123.
154. Erik D. Demaine, Stefan Langerman, and Joseph O’Rourke. Geometric restrictions on polygonal protein chain production. Algorithmica, 44(2):167-181, February 2006c. Cited on 148,150.
155. Erik D. Demaine, Stefan Langerman, Joseph O’Rourke, and Jack Snoeyink. Interlocked open linkages with few joints. In Proc. 18th Annu. ACM Symp. Comput. Geom., ACM, New York, pages 189-198, June 2002b. Cited on 123,125,126,129, 130.
156. Erik D. Demaine, Stefan Langerman, Joseph O’Rourke, and Jack Snoeyink. Interlocked closed and open linkages with few joints. Comp. Geom. Theory Appl.,26(1):37-45, 2003b. Cited on 123, 124, 126, 127, 129.
157. Erik D. Demaine and Joseph O’Rourke. Open problems from CCCG’99. In Proc. 12th Can. Conf. Comput. Geom., pages 269-272, August 2000. Cited on 123.
158. Erik D. Demaine and Joseph O’Rourke. Open problems from CCCG 2002. In Proc. 15th Can. Conf. Comput. Geom., pages 178-181, 2003. arXiv:cs/0212050. Cited on 330, 434, 440.
159. Erik D. Demaine and Joseph O’Rourke. Open problems from CCCG 2003. In Proc. 16th Can. Conf. Comput. Geom., pages209-211, 2004. Citedon308.
160. Erik D. Demaine and Joseph O’Rourke. Open problems from CCCG 2004. In Proc. 17th Can. Conf. Comput. Geom., pages 303-306, 2005. Cited on 332.
161. Erik D. Demaine and Joseph O’Rourke. Open problems from CCCG 2005. In Proc. 18th Can. Conf. Comput. Geom., pages 75-80, 2006. Cited on 418.
162. Julie DiBiase. Polytope Unfolding. Undergraduate thesis, Smith College, 1990. Cited on312, 321.
163. Edgar W. Dijkstra. A note on two problems in connexion with graphs. Numer. Math., 1:269-271, 1959. Cited on 362.
164. Ken A. Dill. Dominant forces in protein folding. Biochemistry,29(31):7133-7155, August 1990. Cited on 158.
165. Nikolai P. Dolbilin. Rigidity of convex polyhedrons. Quantum, 9(1):8-13,1998. Cited on299.
166. Melody Donoso and Joseph O’Rourke. Nonorthogonal polyhedra built from rectangles. Technical Report 073, Department of Computer Science, Smith College, Northampton, MA, October 2001. arXiv:cs/0110059. Cited on 433.
167. Melody Donoso and Joseph O’Rourke. Nonorthogonal polyhedra built from rectangles. In Proc. 14th Can. Conf. Comput. Geom., pages 101-104, August 2002. Cited on 433, 434, 435.
168. David Dureisseix. Chessboard. Br Origami,201:20-24, April 2000. Cited on 238, 239.
169. Albrecht Durer. The Painter’s Manual: A Manual of Measurement of Lines, Areas, and Solids by Means of Compass and Ruler Assembled by Albrecht Durer for the Use of all Lovers of Art with Appropriate Illustrations Arranged to be Printed in the Year MDXXV. Abaris Books, New York, 1977 (1525). English translation by Walter L. Strauss of “Unterweysung der Messung mit dem Zirkel un Richtscheyt in Linien Ebnen uhnd Gantzen Corporen.” Cited on 300.
170. John W. Emert, Kay I. Meeks, and Roger B. Nelsen. Reflections on a Mira. Amer Math. Mon.,101(6):544-549, June-July 1994. Cited on 287, 289, 290.
171. David Eppstein. Faster circle packing with application to non-obtuse triangulation. Int. J. Comput. Geom. Appl., 7:485-492,1997. Cited on 266.
172. Paul Erdos. Problem 3763. Am. Math. Mon., 42:627,1935. Cited on 74.
173. Euclid.E Elements. Dover, 1956. Translated by Sir Thomas L. Heath. Cited on 341.
174. Hazel Everett, Sylvain Lazard, Steve Robbins, Heiko Schroder, and Sue Whitesides. Convexifying star-shaped polygons. In Proc. 10th Can. Conf. Comput. Geom., pages 2-3,1998. Cited on 88. Michael Farber. Instabilities of robot motion, arXiv:cs/0205015, 2002. Cited on 63.
175. Maksym Fedorchuk and Igor Pak. Rigidity and polynomial invariants of convex polytopes. Duke Math. J., 129:371-404, 2005. Cited on 354, 356, 357.
176. Eugene S. Fergusson. Kinematics of mechanisms from the time of Watt. In U.S. National Museum Bulletin, volume 228, pages 185-230. Smithsonian Institute, 1962. Cited on 30.
177. Thomas Fevens, Antonio Hernandez, Antonio Mesa, Patrick Morin, Michael Soss, and Godfried T. Toussaint. Simple polygons with an infinite sequence of deflations. Beiträge Algebra Geom., 42(2):307-311, 2001. Cited on 78.
178. Maxim D. Frank-Kamenetskii. Unravelling DNA. Addison-Wesley, Reading, MA, 1997. Cited on 131.
179. Greg N. Frederickson. Dissections: Plane and Fancy. Cambridge University Press, Cambridge, UK, 1997. Cited on 372, 423.
180. Greg N. Frederickson. Hinged Dissections: Swinging and Twisting. Cambridge University Press, Cambridge, UK, 2002. Cited on 423.
181. Greg N. Frederickson. Piano-Hinged Dissections: Time to Fold. A K Peters, Wellesley, MA, 2006. Cited on 423.
182. Erich Friedman. Circles in squares. http://www.stetson.edu/~efriedma/cirinsqu/2002. Cited on 246.
183. Hal Gabow and Robert Tarjan. A linear time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci.,30:209-221,1985. Cited on 216.
184. HaroldN. Gabow and Herbert H. Westermann. Forests, frames, and games: Algorithms for matroid sums and applications. Algorithmica,7(5-6):465-497,1992. Cited on 46.
185. Xiao-Shan Gao, Chang-Cai Zhu, Shang-Ching Chou, and Jian-Xin Ge. Automated generation of Kempe linkages for algebraic curves and surfaces. Mech. Mach. Theory,36(9):1019-1033,2002. Cited on 39.
186. Martin Gardner. The cocktail cherry and other problems. In Mathematical Magic Show, chapter 5, pages 66-81.
187. Mathematical Association of America, Washington, DC, 1990. Cited on 232, 237.
188. Martin Gardner. Paper cutting. In New Mathematical Diversions (Revised Edition), chapter 5, pages 58-69.
189. Mathematical Association of America, Washington, DC, 1995a. Appeared in Sci. Am., 1960. Cited on 232, 254.
190. Richard J. Gardner. Geometric Tomography. Cambridge University Press, Cambridge, UK, 1995b. Cited on 339.
191. Robert Geretschlager. Euclidean constructions and the geometry of origami. Math. Mag.,68(5):357-371, 1995. Cited on 285, 287, 289.
192. Julie Glass, Stefan Langerman, Joseph O’Rourke, Jack Snoeyink, and Jianyuan K. Zhong. A2-chain can interlock with a k-chain. In Proc. 14th Annu. Fall Workshop Comput. Geom., pages 18-19, Cambridge, MA, 2004. Cited on 126.
193. Julie Glass, Bin Lu, Joseph O’Rourke, and Jianyuan K. Zhong. A 2-chain can interlock with an open 11-chain. Geombinatorics,15(4):166-176, 2006. Cited on 126.
194. Andrew M. Gleason. Angle trisection, the heptagon, and the triskaidecagon. Am. Math. Mon.,95(3):185-194, March 1988. Cited on 289, 290.
195. Herman Gluck. Almost all simply-connected closed surfaces are rigid. In Geometric Topology, volume 438 of Lecture Notes in Mathematics, pages 225-239. Springer-Verlag, Berlin, 1976. Cited on 347.
196. Jack E. Graver. Counting on Frameworks: Mathematics to Aid the Design of Rigid Structures. Mathematical Association of America, Washington, DC, 2001. Cited on 29, 43, 45, 48, 51, 52.
197. Jack Graver, Brigitte Servatius, and Herman Servatius. Combinatorial Rigidity. American Mathematical Society, Providence, RI, 1993. Cited on 43.
198. Peter Gritzmann and Alexander Hufnagel. A polynomial time algorithm for Minkowski reconstruction. In Proc. 11th Annu. ACM Symp. Comput. Geom., ACM, New York, pages 1-9, 1995. Cited on 340.
199. Martin Grotschel, Lalzo Lovasz, andAlexander Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics,2nd edition. Springer-Verlag, Berlin, 1993. Cited on 105.
200. Branko Grunbaum. Convex Polytopes. John Wiley & Sons, New York, 1967. See Grunbaum (2003b). Cited on 340.
201. Branko Grunbaum. Nets of polyhedra II. Geombinatorics, 1:5-10, 1991. Cited on 312.
202. Branko Grunbaum. How to convexify a polygon. Geombinatorics,5:24-30, July 1995. Cited on 75, 76.
203. Branko Grunbaum. A starshaped polyhedron with no net. Geombinatorics,11:43-48,2001. Cited on 318.
204. Branko Grunbaum. No-net polyhedra. Geombinatorics, 12:111-114,2002. Cited on318.
205. Branko Grunbaum. Are your polyhedra the same as my polyhedra? In B. Aronov, S. Basu, J. Pach, andM. Sharir, editors, Discrete and Computational Geometry: The Goodman-Pollack Festschrift, pages 461-488. Springer, New York, 2003a. Cited on 310.
206. Branko Grunbaum. Convex Polytopes, 2nd edition. Springer, New York, 2003b. Cited on310.
207. Branko Grunbaum and Geoffrey C. Shephard. Tilings and Patterns. W. H. Freeman, New York, 1987. Cited on 293.
208. Branko Grunbaum and Joseph Zaks. Convexification of polygons by flips and by flipturns. Technical Report 6/4/98, Department of Mathematics, University of Washington, Seattle, 1998. Cited on 80.
209. Satyandra K. Gupta. Sheet metal bending operation planning: Using virtual node generation to improve search efficiency. J. Manuf. Syst.,18(2):127-139,1999. Cited on 14.
210. Mick Guy and Dave Venables. The Chess Sets of Martin Wall, Max Hulme and Neal Elias, Booklet 7. British Origami Society, 1979.1st revision. Cited on 238, 239.
211. Ruth Haas, David Orden, Gunter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane Souvaine, Ileana Streinu, and Walter Whiteley. Planar minimally rigid graphs and pseudotriangulations. Comput. Geom. TheoryAppl., 31(1-2):31-61, May 2005. Cited on 46.
212. Dan Halperin, Jean-Claude Latombe, and Randall H. Wilson. A general framework for assembly planning: The motion space approach. In Proc. 14th Annu. ACM Symp. Comput. Geom., ACM, New York, pages 9-18,1998. Cited on 20.
213. Frank Harary. Graph Theory. Addison-Wesley, Reading, MA, 1972. Cited on 325.
214. Harry Hart. On certain conversions of motion. Cambridge Messenger of Mathematics, 4:82-88, 116-120,1875. Citedon40.
215. William E. Hart and Sorin Istrail. Fast protein folding in the hydrophobic-hydrophilic model within three-eighths of optimal. J. Comput. Biol., 3(1):53-96, Spring 1996. Cited on 160,161.
216. Koshiro Hatori. Origami construction. http://www.jade.dti.ne.jp/~hatori/library/conste.html, 2004. Cited on 288.
217. Brian Hayes. Prototeins. Am. Scientist,86:216-221,1998. Cited on 158,162.
218. Siqian He and Harold A. Scheraga. Macromolecular conformational dynamics in torsional angle space. J. Chem.Phys., 108(1):271-286,1998. Cited on 155.
219. Bruce Hendrickson. Conditions for unique graph realizations. SIAMJ. Comput., 21(1):65-84,1992. Cited on 46, 49.
220. Lebrecht Henneberg.Die graphische Statik derstarren Systeme. B. G. Teubner, 1911. Cited on 47.
221. David Hilbert and Stefan Cohn-Vossen. Geometry and the Imagination. Chelsea Publishing Company, New York, 1952. Cited on 359, 372, 374.
222. A. E. Hochstein. Trisection of an angle by optical means. Math. Teacher, pages 522-524, January 1963. Cited on 289.
223. John E. Hopcroft, Deborah A. Joseph, and Sue Whitesides. Movement problems for 2-dimensional linkages. SIAM J. Comput.,13:610-629, 1984. Cited on 22, 23, 35, 36.
224. John E. Hopcroft, Deborah A. Joseph, and Sue Whitesides. On the movement of robot arms in 2-dimensional bounded regions. SIAM J. Comput.,14:315-333, 1985. Cited on 22, 23, 25, 26, 61, 67, 68.
225. John E. Hopcroft, Jack T. Schwartz, and Micha Sharir. Planning, Geometry, and Complexity of Robot Motion. Ablex Publishing, Norwood, NJ, 1987. Cited on 17.
226. Harry Houdini. Paper Magic, pages 176-177. E. P. Dutton & Company, 1922. Reprinted by Magico Magazine. Cited on 254.
227. David Hsu, Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, and Stephen Sorkin. Onfind-ing narrow passages with probabilistic roadmap planners. In Proc. 3rd Workshop Algorithmic Found. Robot., pages 141-153. A K Peters, Wellesley, MA, 1998. Cited on 157.
228. David A. Huffman. Curvature and creases: A primer on paper. IEEE Trans. Comput., C-25:10101019, 1976. Cited on 296.
229. Thomas Hull. On the mathematics of flat origamis. Congr. Numer.,100:215-224, 1994. Cited on 169,199.
230. Thomas Hull. Anote on “impossible” paper folding. Am. Math. Mon., 103(3):240-241, March 1996. Cited on 285, 289.
231. Thomas Hull. The combinatorics of flat folds: A survey. In Origami3 Proc. 3rdInt. Meeting Origami Sci., Math, Educ. (2001), pages 29-38, A K Peters, Wellesley, MA, 2002. Cited on 169,199.
232. Thomas Hull. Counting mountain-valley assignments for flat folds. Ars Comb., 67:175-187, April 2003a. Cited on 169, 199, 208.
233. Thomas Hull. Origami and geometric constructions. http://www.merrimack.edu/~thull/omfiles/geoconst.html, 2003b. Cited on 288.
234. Thomas Hull. Project Origami: Activities for Exploring Mathematics. A K Peters, Wellesley, MA, 2006. Cited on 169, 292,293, 294.
235. Kenneth H. Hunt. Kinematic Geometry ofMechanisms.Oxford University Press, Oxford, UK, 1978. Cited on 12, 30.
236. Koji M. Husimi. Science of origami. Supplement to Saiensu (the Japanese edition of Sci. Am.), page 8, October 1980. Cited on 285.
237. Humiaki Huzita. Right angle billiard games and their solutions by folding paper. In K. Miura, editor, Proc. 2ndInt. Meeting Origami Sci. Scientific Origami, Seian University of Art and Design, Otsu, Japan, November-December 1994. Cited on 289.
238. Humiaki Huzita and Benedetto Scimemi. The algebra of paper folding (origami). In H. Huzita, editor, Proc. 1st Int. Meeting Origami Sci. Tech, pages 215-222, Ferrara, Italy, December 1989. Cited on 285, 289.
239. Yong K. Hwang and Narendra Ahuja. Gross motion planning - A survey. ACM Comput. Surv,24(3):219-291, 1992. Cited on 18.
240. Hayley N. Iben, James F. O’Brien, and Erik D. Demaine. Refolding planar polygons. In Proc. 22nd Annu. ACMSymp. Comput. Geom., ACM, New York, pages 71-79, 2006. Cited on113.
241. H. Imai. On combinatorial structures of line drawings of polyhedra. Discrete Appl. Math.,10:79-92, 1985. Cited on 46.
242. Takayui Ishii. One Thousand Paper Cranes: The Story ofSadako and the Children’s Peace Statu.Dell, 1997. Cited on 168.
243. Sorin Istrail, Russell Schwartz, and Jonathan King. Lattice simulations of aggregation funnels for protein folding. J. Comput. Biol., 6(2):143-162, 1999. Cited on 159.
244. Bill Jackson and Tibor Jordán. Connected rigidity matroids and unique realizations of graphs. J. Combin. Theory Series B, 94(l):l-94, 2005. Cited on 48, 49.
245. Donald J. Jacobs and Bruce Hendrickson. An algorithm for two-dimensional rigidity percolation: The pebble game. J. Comput. Phys.,137(2):346-365,1997. Cited on 46.
246. Denis Jordan and Marcel Steiner. Configuration spaces of mechanical linkages. Discrete Comput. Geom., 22:297-315,1999. Cited on 27.
247. Deborah A. Joseph and William H. Plantinga. On the complexity of reachability and motion planning questions. In Proc. 1st Annu. ACM Symp. Comput. Geom., ACM, New York, pages 62-66, 1985. Cited on 22, 23, 25.
248. Jacques Justin. Aspects mathematiques du pliage de papier (Mathematical aspects of paper folding). In H. Huzita, editor, Proc. 1stInt. Meeting Origami Sci. Tech., pages 263-277. Ferrara, Italy, December 1989a. Cited on 199.
249. Jacques Justin. Resolution par le plaige de l’equation du troisieme degre et applications ge-ometriques. In H. Huzita, editor, Proc. 1stInt. Meeting Origami Sci. Tech., pages 251-261. Ferrara, Italy, December 1989b. Cited on 285, 287, 289.
250. Jacques Justin. Towards a mathematical theory of origami. In K. Miura, editor, Proc. 2nd Int. Meeting Origami Sci. Scientific Origami, pages 15-29, Seian University of Art and Design, Otsu, Japan, November-December 1994. Cited on 173, 199, 204.
251. Biliana Kaneva and Joseph O’Rourke. An implementation of Chen & Han’s shortest paths algorithm. In Proc. 12th Can. Conf Comput. Geom., pages 139-146, August 2000. Cited on 351,363, 364, 365,371.
252. Vitit Kantabutra. Reaching a point with an unanchored robot arm in a square. Int. J. Comput. Geom. Appl.,7:539-550,1997. Cited on 69.
253. Vitit Kantabutra and S. Rao Kosaraju. New algorithms for multilink robot arms. J. Comput. Syst. Sci.,32:136-153, February 1986. Cited on 68.
254. Michael Kapovich and John J. Millson. On the moduli spaces of polygons in the Euclidean plane. J. Diff. Geom.,42(1):133-164, 1995. Cited on 64.
255. Michael Kapovich and John J. Millson. Universality theorems for configuration spaces of planar linkages. Topology, 41(6):1051-1107, 2002. Cited on 27, 31.
256. Hermann Karcher. Remarks on polyhedra with given dihedral angles. Comm. Pure Appl. Math.,21:169-174,1968. Cited on 340.
257. Kunihiko Kasahara and Toshie Takahama. Origami for the Connoisseur. Japan Publications, Inc., 1987. Cited on 199, 203.
258. Lydia Kavraki, Petr Svestka, Jean-Claude Latombe, and Mark Overmars. Probabilistic roadmaps for path planning in high dimensional configuration spaces. IEEE Trans. Robot. Autom., 12:566-580, 1996. Cited on 155, 156.
259. Toshikazu Kawasaki. On high dimensional flat origamis. In H. Huzita, editor, Proc. 1st Int. Meeting Origami Sci. Tech, pages 131-142. Ferrara, Italy, December 1989a. Cited on 437.
260. Toshikazu Kawasaki. On the relation between mountain-creases and valley-creases of a flat origami. In H. Huzita, editor, Proc. 1st Int. Meeting Origami Sci. Tech., pages 229-237. Ferrara, Italy, December 1989b. Unabridged Japanese version in Sasebo College Tech. Rep., 27:153-157, 1990. Cited on 199, 204.
261. Toshikazu Kawasaki. Roses, Origami & Math. Japan Publications Trading Co., 2005. Cited on 199.
262. Yan Ke and Joseph O’Rourke. Lower bounds on moving a ladder in two and three dimensions. Discrete Comput. Geom.,3:197-217, 1988. Cited on 20.
263. Alfred Bray Kempe. On a general method of describing plane curves of the nth degree by linkwork. Proc. London Math. Soc.,7:213-216, 1876. Cited on 24, 31.
264. Alfred Bray Kempe. How to Draw a Straight Line: A Lecture on Linkages. Macmillan & Co., 1877. Cited on 29,30, 33.
265. Lutz Kettner, David Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, and Fumi-hiko Takeuchi. Tight degree bounds for pseudo-triangulations ofpoints. Comput. Geom. Theory Appl.,25(1-2):3-12, May 2003. Cited on 108.
266. Kyoung K. Kim, David Bourne, Satyandra Gupta, and s. S. Krishna. Automated process planning for sheet metal bending operations. J. Manuf Syst., 17(5):338-360, 1998. Cited on 14, 306.
267. Henry C. King. Planar linkages and algebraic sets. Turkish J. Math.,23(1):33-56, 1999. Cited on 31,37, 39.
268. Rob Kirby. Problems in low-dimensional topology. In Geometric Topology: Proc. 1993 Georgia Int. Topol. Conf., volume 2.2 of AMS/IP Studies in Advanced Mathematics, pages 35-473, American Mathematical Society and International Press, 1997. Cited on 87.
269. Marc Kirschenbaum. Chess board. Paper, 61:24-30, 1998. Cited on 238.
270. Shoschichi Kobayashi. On conjugate and cut loci. In S. S. Chern, editor, Studies in Global Geometry and Analysis, pages 96-122. Mathematical Association of America, Washington, DC, 1967. Cited on 359.
271. Jan J. Koenderink. Solid Shape. MIT Press, Cambridge, MA, 1989. Cited on 303.
272. Teun Koetsier. Sylvester’s role in the development of the theory of mechanisms. In Symposium “James Joseph Sylvester (1814-1897)." Dutch Mathematical Congress, 1999. Cited on 30.
273. Pascal Koiran. The complexity of local dimensions for constructible sets. J. Complexity,16(1):311-323,2000. Cited on 44.
274. Yoshiyuki Kusakari. On reconfiguring radial trees. In Proc. 2002 Japan Conf. Discrete Comput. Geom., volume 2866 of Lecture Notes in Computer Science, pages 182-191. Springer-Verlag, Berlin, 2003. Cited on 96.
275. Yoshiyuki Kusakari, Masaki Sato, and Takao Nishizeki. Planar reconfiguration of monotone trees. IEEE Trans. Fund., E85-A(5):938-943, 2002. Cited on 96.
276. John Kutcher. Coordinated Motion Planning of Planar Linkages. PhD thesis, Johns Hopkins University, 1992. Cited on 62.
277. Gerard Laman. On graphs and rigidity of plane skeletal structures. J. Engrg. Math.,4:331-340, 1970. Cited on 45.
278. John D. Lambert. Numerical Methods for Ordinary Differential Systems: Thelnitial Value Problem.John Wiley & Sons, Hoboken, NJ, 1992. Cited on 106.
279. Robert J. Lang. Mathematical algorithms for origami design. Symmetry Cult. Sci.,5(2):115-152, 1994a. Cited on 240.
280. Robert J. Lang. The tree method of origami design. In K. Miura, editor, Proc. 2nd Int. Meeting Origami Sci. Scientific Origami, Seian University of Art of Design, pages 73-82, Otsu, Japan, November-December 1994b. Cited on 240.
281. Robert J. Lang. A computational algorithm for origami design. In Proc. 12th Annu. ACM Symp. Comput. Geom., ACM, New York, pages 98-105,1996. Cited on 240, 242, 243, 244.
282. Robert J. Lang. TreeMaker 4.0: A Program for Origami Design, 1998. http://origami.kvi.nl/programs/treemaker/trmkr40.pdf. Cited on 240, 242, 243, 244, 246, 247, 248, 249, 250, 252.
283. Robert J. Lang.Origami Design Secrets: Mathematical Methods for an Ancient Art. A K Peters, Wellesley, MA, 2003. Cited on 168, 169, 239, 240, 243, 248.
284. Robert J. Lang. Origami approximate geometric constructions. In B. Cipra, E. D. Demaine, M. L. Demaine, and T. Rogers, editors, A Tribute to a Mathemagician, pages 223-239. A K Peters, Wellesley, MA, 2004. Cited on 288.
285. Mark Lanthier, Anil Maheshwari, and Jorg-Rudiger Sack. Approximating weighted shortest paths on polyhedral surfaces. In Proc. 13th Annu. ACM Symp. Comput. Geom., ACM, New York, pages 274-283, 1997. Cited on 364.
286. Rev. Dionysius Lardner. A Treatise on Geometry and Its Applications to the Arts. The Cabinet Cyclopedia. Longman, Orme, Brown, Green, & Longmans, and John Taylor, London, 1840. Cited on 168.
287. Jean-Claude Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1991. Cited on 19.
288. Jean-Paul Laumond and Thierry Simeon. Notes on visibility roadmaps and path planning. In B. R. Donald, K. M. Lynch, and D. Rus, editors, Algorithmic and Computational Robotics: New Directions, pages 317-328. A K Peters, Wellesley, MA, 2001. Cited on 157.
289. Steven M. LaValle. Planning Algorithms. Cambridge University Press, Cambridge, UK, 2006. http://planning.cs.uiuc.edu/. Cited on 19,155.
290. Audrey Lee, Ileana Streinu, and Louis Theran. Finding and maintaining rigid components. In Proc. 17th Can. Conf. Comput. Geom., pages 216-219, 2005. Cited on 46.
291. D. T. Lee. Medial axis transformation of a planar shape. IEEE Trans. Pattern Anal. Mach. Intell, PAMI-4(4):363-369, 1982. Cited on 370.
292. JohnM. Lee.Riemannian Manifolds: An Introduction to Curvature, volume 176 of Graduate Texts in Mathematics. Springer-Verlag, 1997. Cited on 302, 304.
293. William J. Lenhart and Sue Whitesides. Turning a polygon inside-out. In Proc. 3rd Can. Conf. Comput. Geom., pages 66-69, August 1991. Cited on 62, 64.
294. William J. Lenhart and Sue Whitesides. Reconfiguring closed polygonal chains in Euclidean d-space. Discrete Comput. Geom., 13:123-140,1995. Cited on 64, 66, 87, 94.
295. Harry R. Lewis and Christos H. Papadimitriou. Elements of the Theory of Computation. Prentice Hall, Saddle River, NJ, 1997. Cited on 23.
296. David Lister. Two miscellaneous collections of jottings on the history of origami. Unpublished manuscript, 1998. http://www.paperfolding.com/history/. Cited on 167.
297. James J. Little. An iterative method for reconstructing convex polyhedra from extended Gaussian image. In Proc. Am. Assoc. Artif. Intell., pages 247-250,1983. Cited on 340.
298. James J. Little. Extended Gaussian images, mixed volumes, and shape reconstruction. In Proc. 1st Annu. ACMSymp. Comput. Geom., ACM, New York, pages 15-23, 1985. Cited on 340.
299. Charles Livingston. Knot Theory. Mathematical Association of America, Washington, DC, 1993. Cited on 89.
300. Gerald M. Loe. Paper Capers. Magic, Inc., Chicago, 1955. Cited on 254.
301. Tomas Lozano-Perez. A simple motion planning algorithm for general robot manipulators. IEEE Trans. Robot. Autom., RA-3(3):224-238,1987. Cited on 12.
302. Tomas Lozano-Perez and Michael A. Wesley. An algorithm for planning collision-free paths among polyhedral obstacles. Commun. ACM, 22(10):560-570,1979. Cited on 12.
303. Liang Lu and Srinivas Akella. Folding cartons with fixtures: A motion planning approach. IEEE Trans. Robot. Autom.,16(4):346-356, 2000. Cited on 14.
304. Anna Lubiw and Joseph O’Rourke. When can a polygon fold to a polytope? Technical Report 048, Department of Computer Science, Smith College, Northampton, MA, June 1996. Presented at Am. Math. Soc. Conf., 5 October 1996. Cited on 381, 386, 388, 402.
305. Brendan Lucier. Partial results on convex polyhedron unfoldings, University of Waterloo course Algorithms for Polyhedra, 2004. http://www.cs.uwaterloo.ca/~blucier/misc/polyhedra.pdf. Cited on 318.
306. VladimirJ. Lumelsky. Effect of kinematics on dynamic path planning for planar robot arms moving amidst unknown obstacles. Int. J. Robot. Autom., RA-3(3):207-223,1987. Cited on 12.
307. Anna Lysyanskaya. Constructing a Simple Closed Geodesic on a Polytope. Undergraduate thesis, Smith College, 1997. Cited on 374.
308. Lazar Lyusternik and Lev Schnirelmann. Sur le problem de trois geodesiques fermees sur les surfaces de genre 0. C. R Acad. Sci. Paris, 189:269-271,1929. Cited on 374.
309. Dana Mackenzie. Polyhedra can bend but not breathe. Science,279:1637,1998. Cited on 348.
310. Andrea Mantler and Jack Snoeyink. Banana spiders: A study of connectivity in 3D combinatorial rigidity. In Proc. 14th Can. Conf. Comput. Geom., pages 44-47, 2004. Cited on 47.
311. Costas D. Maranas, Ioannis P. Androulakis, and Christodoulos A. Floudas. A deterministic global optimization approach for the protein folding problem. In P. M. Pardalos, D. Shalloway, and G. Xue, editors, Global Minimization ofNonconvex Energy Functions: Molecular Conformation and Protein Folding, volume 23 of DIMACS Series Discrete Math. Theoret. Comput. Sci., pages 133-150. American Mathematical Society, New York, 1996. Cited on 15.
312. Giancarlo Mauri, Giulio Pavesi, and Antonio Piccolboni. Approximation algorithms for protein folding prediction. In Proc. 10thAnnu.ACM-SIAMSymp. Discrete Algorithms, ACM/SIAM, New York/Philadelphia, pages 945-946, January 1999. Cited on 161.
313. James C. Maxwell. On reciprocal diagrams and diagrams of forces. Phil. Mag. Ser. 4,27:250-261, 1864. Cited on 58.
314. Brendan D. McKay. Spanning trees in regular graphs. Eur. J. Combin.,4:149-160, 1983. Cited on 431.
315. Peter Messer. Problem 1054. Crux Mathematicorum, 12(10), December 1986. Posed in 1985, page 188. Cited on 289.
316. Ezra Miller and Igor Pak. Metric combinatorics of convex polyhedral Cut loci and nonoverlapping unfoldings. Discrete Comput. Geom., to appear. Cited on 360, 362, 366.
317. Kenneth C.Millett. Knotting of regular polygons in3-space. J. Knot Theory Ramifications, 3(3):263-278, 1994. Cited on 80, 81.
318. Bhubaneswar Mishra. Computational real algebraic geometry. In J. E. Goodman and J. O’Rourke, editors, Handbook of Discrete and Computational Geometry, 2nd edition, chapter 33, pages 743-764. CRC Press LLC, Boca Raton, FL, 2004. Cited on 111.
319. Jun Mitani and Hiromasa Suzuki. Making papercraft toys from meshes using strip-based approximate unfolding. ACM Trans. Graph.,23(4):259-263, 2004. Proc. ACM Conf. SIGGRAPH 2004. Cited on 308.
320. Joseph S. B. Mitchell, David M. Mount, and Christos H. Papadimitriou. The discrete geodesic problem. SIAM J. Comput.,16:647-668,1987. Cited on 358, 362, 363, 364.
321. John Montroll. African Animals in Origami. Dover Publications, 1991. Cited on 233.
322. Frank Morgan. Riemannian geometry: A beginner’s guide. Manuscript, Williams College, 1991. Cited on 304.
323. Cristian Moukarzel. An efficient algorithm for testing the generic rigidity of graphs in the plane. J. Phys. A: Math. Gen, 29:8079-8098,1996. Cited on 46.
324. David M. Mount. On finding shortest paths on convex polyhedra. Technical Report 1495, Department of Computer Science, University of Maryland, 1985. Cited on 359, 360.
325. Yukio Murakami. Origami geometry (paper folding): A new system making trisection of arbitrary angle possible. In Proc. Int. IEEE Conf. Syst. Man Cybern., pages 1107-1109,1987. Cited on 285, 289.
326. Kenneth P. Murphy. Protein Structure, Stability, and Folding, volume 168 of Methods in Molecular Biology. Humana Press, 2001. Cited on 148.
327. Bela de Sz. Nagy. Solution to problem 3763. Am. Math. Monthly,46:176-177, 1939. Cited on 74, 75.
328. Makoto Namiki and Komei Fukuda. Unfolding 3-dimensional convex polytopes: A package for Mathematica 1.2 or 2.0. Mathematica Notebook, University of Tokyo, 1993. Cited on 314, 386.
329. National standards and emblems.Harper’s New Mon. Mag.,47(278):171-181, July 1873. Cited on 254.
330. Alantha Newman. Anew algorithm for protein folding in the HP model. In Proc. 13th Annu. ACM-SIAM Symp. Discrete Algorithms, ACM/SIAM, New York/Philadelphia, pages 876-884, January 2002. Cited on 161, 162.
331. Poul Nissen, Jeffrey Hansen, Nenad Ban, Peter B. Moore, and Thomas A. Steitz. The structural basis of ribosome activity in peptide bond synthesis. Science,289:920-930, 2000. Cited on 148.
332. Kari J. Nurmela and Patric R. J. Ostergoard. Packing up to 50 equal circles in a square. Discrete Comput. Geom.,18:111-120,1997. Cited on 246.
333. Jun O’Hara. Morse functions on configuration spaces of planar linkages. arXiv:math.GT/0505462, 2005. Cited on 28.
334. David Orden, Francisco Santos, Brigitte Servatius, and Herman Servatius. Combinatorial pseudotriangulations. arXiv:math.CO/0307370. Discrete Math., to appear. Cited on 46.
335. Joseph O’Rourke. Computational Geometry in C, 2nd edition. Cambridge University Press, Cambridge, UK, 1998. Cited on 19, 21, 63, 266, 355, 386.
336. Joseph O’Rourke. Computational geometry column 39. Int. J. Comput. Geom. Appl.,10(4):441-444, 2000a. Also in SIGACTNews, 31(3):47-49, 2000a, Issue 116. Cited on 98.
337. Joseph O’Rourke. Folding and unfolding in computational geometry. In Proc. 1998 Japan Conf. Discrete Comput. Geom., volume 1763 of Lecture Notes in Computer Science, pages 258-266. Springer-Verlag, Berlin, 2000b. Cited on 357.
338. Joseph O’Rourke. On the development of the intersection of a plane with a polytope. Technical Report 068, Department of Computer Science, Smith College, Northampton, MA, June 2000c. arXiv:cs.CG/0006035v3. Cited on 146.
339. Joseph O’Rourke. An extension of Cauchy’s arm lemma with application to curve development. In Proc. 2000 Japan Conf. Discrete Comput. Geom., volume 2098 of Lecture Notes in Computer Science, pages 280-291. Springer-Verlag, Berlin, 2001a. Cited on 147.
340. Joseph O’Rourke. Unfolding prismoids without overlap. Unpublished manuscript, May 2001b. Cited on 323.
341. Joseph O’Rourke. On the development of the intersection of a plane with a polytope. Comput. Geom. TheoryAppl.,24(1):3-10, 2003. Cited on 377, 378, 379, 380.
342. Joseph O’Rourke and Catherine Schevon. On the development of closed convex curves on 3-polytopes. J. Geom.,13:152-157, 1989. Cited on 376, 377.
343. Roger Pain. Mechanisms of Protein Folding. Oxford University Press, Oxford, UK, 2000. Cited on 148.
344. Igor Pak. A short proof of rigidity of convex polytopes. Siberian J. Math.,47:859-864, 2006. Cited on 342.
345. Charles-Nicolas Peaucellier. Lettre de M. Peaucellier. NouvellesAnn. Math., 3:414,1864. Letter to the editor (“Lettre de M. Peaucellier, capitaine du Genie, a Nice”). Cited on 30.
346. Ronald Peikert. Dichteste Packungen von gleichen Kreisen in einem Quadrat (Densest packings of equal circles in a square). Elem. Math., 49(1):16-26,1994. Cited on 246.
347. Tony Phillips. Descartes’ lost theorem. In What’s New in Math. American Mathematics Society, 1999. www.ams.org. Feature Column Archive. Cited on 305.
348. Margherita Piazzolla Beloch. Sulla risoluzione dei problemi di terzo e quarto grado col metodo del ripiegamento della carta. Scritti Matematici Offerti a Luigi Berzolari, Pavia, pages 93-96, 1936. Cited on 169, 289.
349. Michel Pocchiola and Gert Vegter. Computing the visibility graph via pseudo-triangulations. In Proc. 11th Annu. ACM Symp. Comput. Geom., ACM, New York, pages 248-257, 1995. Cited on 108.
350. Michel Pocchiola and Gert Vegter. Pseudo-triangulations: Theory and applications. In Proc. 12th Annu. ACM Symp. Comput. Geom., ACM, New York, pages 291-300,1996. Cited on 108.
351. Aleksei V.Pogorelov. Quasi-geodesic lines on a convex surface. Mat. Sb.,25(62):275-306, 1949. English translation, Am. Math. Soc. Transl. 74,1952. Cited on 374.
352. Aleksei V.Pogorelov. Extrinsic Geometry of Convex Surfaces, volume 35 of Translations of Mathematical Monographs. American Mathematical Society, Providence, RI, 1973. Cited on 349,352, 353, 373.
353. Konrad Polthier and Markus Schmies. Straightest geodesics on polyhedral surfaces. In H. C. Hege and K. Polthier, editors, Mathematical Visualization, page 391. Springer-Verlag, Berlin, 1998. Cited on 373.
354. Sheung-Hung Poon. On straightening low-diameter unit trees. In P Healy and N. S. Nikolov, editors, Proc. 13th Int. Symp. Graph Drawing (2005), volume 3843 of Lecture Notes in Computer Science, pages 519-521. Springer-Verlag, Berlin, 2006. Cited on 96,154.
355. Helmut Pottmann and Johannes Wallner. Computational Line Geometry. Springer-Verlag, Berlin, 2001. Cited on 191, 352,354.
356. Robert C. Read and Robert E. Tarjan. Bounds on backtrack algorithms for listing cycles, paths and spanning trees. Networks,5:237-252,1975. Cited on 315.
357. John H. Reif. Complexity of the mover’s problem and generalizations. In Proc. 20th Annu. IEEE Symp. Found. Comput. Sci., IEEE, Los Alamitos, pages 421-427, 1979. Cited on 22, 24.
358. John H. Reif. Complexity of the generalized movers problem. In J. E. Hopcroft, J. Schwartz, and M. Sharir, editors, Planning, Geometry and Complexity of Robot Motion, pages 267-281. Ablex Publishing, Norwood, NJ, 1987. Cited on 22, 23.
359. Gunter Rote, Francisco Santos, and Ileana Streinu. Expansive motions and the polytope of pointed pseudo-triangulations. In B. Aronov, S. Basu, J. Pach, and M. Sharir, editors, Discrete and Computational Geometry: The Goodman-PollackFestschrift, pages 699-736. Springer-Verlag, Berlin, 2003. Cited on 111.
360. Ben Roth and Walter Whiteley. Tensegrity frameworks. Trans. Am. Math. Soc.,265(2):419-446, 1981. Cited on 56, 57.
361. T. Sundara Row. Geometric Exercises in Paper Folding. Addison & Co., Madras, India, 1893. Edited and revised by W. W. Beman and D. E. Smith, The Open Court Publishing Co., Chicago, 1901. Republished by Dover, New York, 1966. Cited on 168.
362. Idzhad Sabitov. The volume of a polyhedron as a function of its metric and algorithmical solution of the main problems in the metric theory of polyhedra. In International School-Seminar Devoted to the N. V Efimov’s Memory, pages 64-65. Rostov University, 1996a. Cited on 354.
363. Idzhad Sabitov. The volume of polyhedron as a function of its metric. Fundam. Prikl. Mat.,2(4):1235-1246, 1996b. Cited on 348, 355.
364. Idzhad Sabitov. The volume as a metric invariant of polyhedra. Discrete Comput. Geom.,20:405-425, 1998. Cited on 355.
365. G. Thomas Sallee. Stretching chords of space curves. Geom. Dedicata, 2:311-315,1973. Cited on 67.
366. James B. Saxe. Embeddability of weighted graphs in k-space is strongly NP-hard. In Proc. 17th Allerton Conf. Commun. Control Comput., pages 480-489,1979. Cited on 48.
367. Thomas J. Schaefer. The complexity of satisfiability problems. In Proc. 10th Annu. ACM Symp. Theory Comput., ACM, New York, pages 216-226,1978. Cited on 217.
368. Catherine Schevon. Unfolding polyhedra, February 1987. sci.math Usenet article. http://www.ics.uci.edu/~eppstein/gina/unfold.html. Cited on 318.
369. Catherine Schevon. Algorithms for Geodesics on Polytopes. PhD thesis, Johns Hopkins University, 1989. Cited on 315, 375.
370. Catherine Schevon and Joseph O’Rourke. A conjecture on random unfoldings. Technical Report JHU-87/20, Johns Hopkins University, Baltimore, MD, July 1987. Cited on 315.
371. Wolfram Schlickenrieder. Nets ofPolyhedra. PhD thesis, Technische Universitat Berlin, 1997. Cited on 312, 315, 316, 317.
372. Isaac J. Schoenberg and Stanislaw K. Zaremba. On Cauchy’s lemma concerning convex polygons. Can. J. Math,19:1062-1077, 1967. Cited on 144.
373. Yevgeny Schreiber and Micha Sharir. An optimal-time algorithm for shortest paths on a convex polytope in three dimensions. In Proc. 22nd Annu. ACM Symp. Comput. Geom., ACM, New York, pages 30-39, 2006. Cited on 366.
374. Axel Schur. Uber die Schwarzche Extremaleigenschaft des Kreises unter den Kurven konstantes Kriimmung. Math. Ann.,83:143-148,1921. Cited on 147.
375. Kan Chu Sen. Wakoku Chiyekurabe (Mathematical Contests), 1721. Excerpts at http://theory.csail.mit.edu/~edemaine/foldcut/senbook.html. Cited on 254.
376. Micha Sharir. Algorithmic motion planning. In J. E. Goodman and J. O’Rourke, editors, Handbook ofDiscrete and Computational Geometry, 2nd edition, chapter 47, pages 1037-1064. CRC Press LLC, Boca Raton, FL, 2004. Cited on 19,173.
377. Micha Sharir and Amir Schorr. On shortest paths in polyhedral spaces. SIAM J. Comput.,15:193-215, 1986. Cited on 358, 359, 360,361.
378. Geoffrey C. Shephard. Convex polytopes with convex nets. Math. Proc. Camb. Phil. Soc.,78:389-403, 1975. Cited on 300, 327, 328,389,411.
379. Don Shimamoto and Catherine Vanderwaart. Spaces of polygons in the plane and Morse theory. Am. Math. Mon.,112(4):289-310, 2005. Cited on 28.
380. David Singer. Geometry: Plane and Fancy. Springer-Verlag, Berlin, 1997. Cited on 144.
381. John S. Smith. Notes on the history of origami (3rd edition). Unpublished manuscript, 2005. http://www.bitsofsmith.co.uk/history.htm. First edition published as Booklet 1 in a series by the British Origami Society, 1972. Cited on 167.
382. Jack Snoeyink and Jorge Stolfi. Objects that cannot be taken apart with two hands. Discrete Comput. Geom, 12:367-384,1994. Cited on 125.
383. Guang Song and Nancy M. Amato. Using motion planning to study protein folding pathways. In Proc. 5th Annu. Int. Conf. Comput. Bio., ACM, New York, pages 287-296, 2001. Cited on 157.
384. Guang Song and Nancy M. Amato. A motion planning approach to folding: From paper craft to protein folding. IEEE Trans. Robot. Autom.,20(1):60-71, February 2004. Cited on 157.
385. Michael Soss. Geometric and Computational Aspects of Molecular Reconfiguration. PhD thesis, School of Computer Science, McGill University, 2001. Cited on 132,135.
386. Michael Soss and Godfried T. Toussaint. Geometric and computational aspects of polymer reconfiguration. J. Math. Chem., 27(4):303-318, 2000. Cited on 132, 135.
387. Chris E. Soteros and Stuart G. Whittington. Polygons and stars in a slit geometry. J. Phys. A: Math. Gen. Phys, 21:L857-L861,1988. Cited on 131.
388. Michael Spivak. A Comprehensive Introduction to Differential Geometry, volume 3. Publish or Perish Press, Berkeley, CA, 1979. Cited on 303.
389. Ernst Steinitz and Hans Rademacher. Vorlesungen uber die Theorie derPolyeder. Springer, Berlin, 1934. Cited on 341, 342.
390. J. J. Stoker. Geometrical problems concerning polyhedra in the large. Comm. PureAppl. Math.,21:119-168,1968. Cited on 340.
391. Ileana Streinu. A combinatorial approach to planar non-colliding robot arm motion planning. In Proc. 41st Annu. IEEESymp. Found. Comput. Sci., IEEE, Los Alamitos, pp. 443-453. November 2000. Cited on 88, 107, 108, 110.
392. Ileana Streinu. Combinatorial roadmaps in configuration spaces of simple planar polygons. In S. Basu and L. Gonzalez-Vega, editors, Proc. DIMACS Workshop Algorithmic Quant. Aspects Real Algebraic Geom. Math. Comput. Sci., pages 181-206, 2003. Cited on 111.
393. Ileana Streinu. Pseudotriangulations, rigidity, and motion planning. Discrete Comput. Geom.,34:587-635, 2005. Cited on 107, 109, 110.
394. Ileana Streinu and Walter Whiteley. The spherical carpenter’s rule problem and conical origami folds. In Proc. 11th Annu. Fall Workshop Comput. Geom., Brooklyn, New York, November 2001. Cited on 212, 213.
395. Kokichi Sugihara. On redundant bracing in plane skeletal structures. Bull. Electrotech. Lab., 44:78-88,1980. Cited on 46.
396. William A. Sutherland. Introduction to Metric and Topological Spaces. Oxford University Press, Oxford, UK, 1975. Cited on 174.
397. Alexei S. Tarasov. Polyhedra with no natural unfoldings. Russian Math. Surv.,54(3):656-657,1999. Cited on 318.
398. William P. Thurston and Jeffrey R. Weeks. The mathematics of three-dimensional manifolds. Sci. Am,251(1):108-120, July 1984. Cited on 61.
399. Michael J. Todd. Mathematical programming. In J. E. Goodman and J. O’Rourke, editors, Handbook of Discrete and Computational Geometry, 2nd edition, chapter 46, pages 1015-1036. CRC Press LLC, Boca Raton, FL, 2004. Cited on 54.
400. Godfried T. Toussaint. Movable separability of sets. In G. T. Toussaint, editor, Computational Geometry, pages 335-375. North-Holland, Amsterdam, 1985. Cited on 125.
401. Godfried T. Toussaint. A new class of stuck unknots in Pole. Beitrage Algebra Geom.,42(2):301-306, 2001. Cited on 90, 91.
402. Godfried T. Toussaint. Simple proofs of a geometric property of four-bar linkages. Am. Math. Mon., 110(6):482-494, 2003. Cited on 67, 73.
403. Godfried Toussaint. The Erdos-Nagy theorem and its ramifications. Comput. Geom. TheoryAppl.,31(3):219-236, 2005. Cited on 67, 75,80, 81.
404. Luca Trevisan. When Hamming meets Euclid: The approximability of geometric TSP and MST. In Proc. 29th Annu. ACMSymp. Theory Comput., ACM, New York, pages 21-29, 1997. Cited on 159.
405. John M. Troyer, Fred E. Cohen, and David M. Ferguson. Langevin dynamics of simplified protein models. In Electronic Comput. Chem. Conf, 1997. Paper 76; http://www.cmpharm.ucsf.edu/~troyer/eccc/. Cited on 15.
406. Marc van Kreveld, Jack Snoeyink, and Sue Whitesides. Folding rulers inside triangles. Discrete Comput. Geom.,15:265-285, 1996. Cited on 69.
407. Ju. A. Volkov and E. G. Podgornova. The cut locus of a polyhedral surface of positive curvature. Ukrainian Geom. Sb,11:15-25,1971. In Russian. Cited in Miller and Pak (to appear). Cited on 359.
408. Cheng-Hua Wang. Manufacturability-Driven Decomposition of Sheet Metal Products. PhD thesis, Robotics Institute, Carnegie Mellon University, 1997. Cited on 14, 306.
409. Pierre-Laurent Wantzel. Recherches sur les moyens de reconnaître si un probleme de geometrie peut se résoudre avec la régle et le compas. Journ. de Math. Pures et Appl., 2:366-372, 1837. Cited on 285.
410. Bernd Wegner. Partial inflation of closed polygons in the plane. Beitrage Algebra Geom.,34(1):77-85, 1993. Cited on 78.
411. Eric W. Weisstein. CRC ConciseEncylopedia ofMathematics. CRC Press LLC, Boca Raton, FL, 1999. Cited on 128.
412. Margaret Wertheim. Cones, curves, shells, towers: He made paper jump to life. New York Times, page 2, June 22, 2004. Cited on 296.
413. Walter Whiteley. Motions and stresses of projected polyhedra. Structural Topology,7:13-38,1982. Cited on 58.
414. Walter Whiteley. Rigidity and scene analysis. InJ. E. Goodman andJ. O’Rourke, editors, Handbook ofDiscrete and Computational Geometry, 2nd edition, chapter 60, pages 1327-1354. CRC Press LLC, Boca Raton, FL, 2004. Cited on 43.
415. Stacia Wyman. Geodesics on Polytopes. Undergraduate thesis, Smith College, 1990. Cited on 374.
416. Dianna Xu. Shortest Paths on the Surface of a Polytope. Undergraduate thesis, Smith College, 1996. Cited on 359.
417. Yechiam Yemini. Some theoretical aspects of position-location problems. In Proc. 20th Annu. IEEESymp. Found. Comput. Sci., IEEE, Los Alamitos, pages 1-8,1979. Cited on 48.
418. Akira Yoshizawa. Atarashi Origami Geijutsu (New Origami Art) [in Japanese], 1954. Cited on 168.
419. Jianmin Zhao and Normanl, Badler. Inverse kinematics position ingusingn online arprogramming for highly articulated figures. ACM Trans. Graph.,13(4):313-336,1994. Cited on 12.
420. Gunter M. Ziegler. Lectures on Polytopes, volume 152 of Graduate Texts in Mathematics. SpringerVerlag, Berlin, 1994. Cited on 339.
421. Konrad Zindler. Eine raumliche Geradfahrung. Sitzungsberichte Wien,140:399-402, 1931. Cited on 31.