Single-vertex origami and spherical expansive motions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3742 LNCS, Issue , 2005, Pages 161-173

  Streinu, Ileana ^a   Whiteley, Walter ^b  

^a SMITH COLLEGE   (United States)

^b YORK UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTER SCIENCE; THREE DIMENSIONAL; TRIANGULATION;

COMBINATORIAL CHARACTERIZATION; PSEUDO-TRIANGULATION; SINGLE-VERTEX ORIGAMI SHAPES; SPHERICAL EXPANSIVE MOTIONS;

COMPUTATIONAL GEOMETRY;

EID: 33646508139     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11589440_17     Document Type: Conference Paper

References (20)

1. M. Bern and B. Hayes. The complexity of flat origami. In Proc. 7th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 175-183, Atlanta, January 1996.
2. T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, I. Streinu, G. Toussaint and S. Whitesides. Locked and unlocked polygonal chains in three dimensions. Discrete & Computational Geometry, 26(3):269-281, 2001.
3. J. Cantarella and H. Johnston. Nontrivial embeddings of polygonal intervals and unknots in 3-space. J. Knot Theory Ramifications, 7(8):1027-1039, 1998.
4. R. Connelly, E. Demaine and G. Rote. Straightening polygonal arcs and convexifying polygonal cycles. Discrete & Computational Geometry, 30(5):205-239, 2003.
5. H. Crapo and W. Whiteley. Statics of frameworks and motions of panel structures: a projective geometric introduction. Structural Topology, 6:43-82, 1982.
6. E. Demaine and M. Demaine. Recent results in computational origami. In Proc. 3rd Int. Meeting of Origami Science, Math, and Education (OSME 2001), pages 3-16, Monterey, California, March 9-11 2001.
7. E. Demaine, M. Demaine, and J. Mitchell. Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami. In Proc. 15th ACM Symp. on Computational Geometry (SoCG'99), pages 105-114, Miami Beach, Florida, June 13-16 1999.
8. J. Graver, B. Servatius and H. Servatius. Combinatorial Rigidity. Graduate Studies in Mathematics vol. 2. American Mathematical Society, 1993.
9. D. Huffman. Curvature and creases: a primer on paper. IEEE Transactions on Computers, C-25(10):1010-1019, Oct. 1976.
10. T. Hull. Rigid origami, http://www.merrimack.edu/-thull/rigid/rigid.html, 2003.
11. M. Kapovich and J. Millson. Hodge theory and the art of paper-folding. Publications of RIMS, Kyoto, 33(1):1-33, 1997.
12. M. Kapovich and J. Millson. On the moduli space of a spherical polygonal linkage. Canad. Math. Bull., 42(3):307-320, 1999.
13. R. Lang. A computational algorithm for origami design. In Proc. 12th ACM Symposium on Computational Geometry, pages 98-105, 1996.
14. K. Miura. A note on intrinsic geometry of origami. Proc. First International Meeting of Origami Science and Technology (H. Huzita ed.), pages 239-249, 1989.
15. G. Rote, F. Santos and I. Streinu. Expansive motions and the polytope of pointed pseudo-triangulations. In J. Pach, B. Aronov, S. Basu and M. Sharir, editors, Discrete and Computational Geometry - The Goodman-Pollack Festschrift, Algorithms and Combinatorics, pages 699-736. Springer Verlag, Berlin, 2003.
16. F. Saliola and W. Whiteley. Notes on the equivalence of first-order rigidity in various geometries. Preprint, 2002.
17. I. Streinu. A combinatorial approach to planar non-colliding robot arm motion planning. In Proc. ACM-IEEE Symposium on Foundations of Computer Science (FOCS), pages 443-453, 2000.
18. T.S. Tay and W. Whiteley. Generating isostatic graphs. Structural Topology, 11:21-68, 1985.
19. W. Whiteley. Cones, infinity and one-story buildings. Structural Topology, 8:53-70, 1983.
20. W. Whiteley. Rigidity and scene analysis. In J.E. Goodman arid J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, pages 893-916. CRC Press, Boca Raton New York, first edition, 1997.