Folding and cutting paper

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

Volumn 1763, Issue , 2000, Pages 104-118

  Demaine, Erik D ^a   Demaine, Martin L ^a   Lubiw, Anna ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

FOLDED STATE; PLANE GRAPHS; STRAIGHT CUTS; STRAIGHT SKELETON;

COMPUTATIONAL GEOMETRY;

EID: 84947764604     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/978-3-540-46515-7_9     Document Type: Article

References (22)

1. O. Aichholzer and F. Aurenhammer. Straight skeletons for general polygonal figures in the plane. In Proc. 2nd Int. Computing and Combinatorics Conf., pp. 117-126, Hong Kong, 1996.
2. O. Aichholzer, F. Aurenhammer, D. Alberts, and B. Gärtner. A novel type of skeleton for polygons. JUCS, 1(12):752-761, 1995.
3. M. Bern, E. Demaine, D. Eppstein, and B. Hayes. A disk-packing algorithm for an origami magic trick. In Proc. Int. Conf. Fun with Algorithms, Italy, June 1998.
4. M. Bern and B. Hayes. The complexity of flat origami. In Proc. 7th ACM-SIAM Symp. Discrete Algorithms, pp. 175-183, Atlanta, Jan. 1996.
5. E. D. Demaine and M. L. Demaine. Computing extreme origami bases. Tech. Rep. CS-97-22, University of Waterloo, May 1997.
6. E. D. Demaine, M. L. Demaine, and A. Lubiw. Folding and one straight cut suffice. Tech. Rep. CS-98-18, University of Waterloo, 1998.
7. D. Eppstein and J. Erickson. Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions. In Proc. lth ACM Symp. Computational Geometry, pp. 58-67, Minneapolis, June 1998.
8. G. N. Frederickson. Updates to Dissections: Plane and Fancy, July 1997. World Wide Web. http://www.cs.purdue.edu/homes/gnf/book/Booknews/ch2.html.
9. M. Gardner. Paper cutting. In New Mathematical Diversions (Revised Edition), chapter 5, pp. 58-69. MAA, Washington, D.C., 1995.
10. R. Geretschläger. Euclidean constructions and the geometry of origami. Math. Mag., 68(5):357-371, 1995.
11. H. Houdini. Paper Magic, pp. 176-177. E. P. Dutton Sz Company, 1922.
12. T. Hull. On the mathematics of fiat origamis. Congr. Numer., 100:215-224, 1994.
13. H. Huzita and B. Scimemi. The algebra of paper folding (origami). In Proc. 1st Int. Meeting of Origami Science and Technology, pp. 215-222, Ferrara, Dec. 1989.
14. J. Justin. Towards a mathematical theory of origami. In Proc. 2nd Int. Meeting of Origami Science and Scientific Origami, pp. 15-29, Otsu, Nov.-Dee. 1994.
15. T. Kawasaki. On the relation between mountain-creases and valley-creases of a flat origami. In Proc. 1st Int. Meeting of Origami Science and Technology, pp. 229-237, Ferrara, Dec. 1989.
16. D. König. Theorie der endlichen und unendlichen Graphen. Akademische Verlagsgesellschaft, Leipzig, 1936.
17. R. J. Lang. A computational algorithm for origami design. In Proc. 12th Symp. Computational Geometry, pp. 98-105, Philadelphia, May 1996.
18. R. J. Lang. TreeMaker 1.0: A Program for Origami Design, 1998.
19. G. M. Loe. Paper Capers. Magic, Inc., Chicago, 1955.
20. E. A. Lord and C. B. Wilson. The Mathematical Description of Shape and Form. Ellis Horwood Limited, West Sussex, England, 1984.
21. G. Nakamura. Personal communication, Dec. 1998.
22. K. C. Sen. Wakoku Chiyekurabe (Mathematical Contests). 1721.