Mathematics of origami

Notes and references

1. ^ . American Mathematical Monthly. 118 (4): 307–315. doi:10.4169/amer.math.monthly.118.04.307. MR 2800341. S2CID 2540978.
2. ^.
3. ^
4. ^
5. ^
6. ^
7. ^
8. ^
9. ^
10. ^ . Reproduced in British Origami, 1981, and online at the British Origami Society web site.
11. ^
12. ^
13. ^ . International Journal of Pure and Applied Mathematics. 79 (2): 269–279.
14. ^ . Crux Mathematicorum. 12 (10): 284–285 – via Canadian Mathematical Society.
15. ^
16. ^
17. ^
18. ^ 183. MR 1381938.
19. ^
20. ^
21. ^ 3): 273–282. doi:10.1016/S0024-3795(01)00608-5.
22. ^ 93. doi:10.1201/b15735. ISBN .
23. ^ 33. doi:10.1007/11615798_2. ISBN .
24. ^ 211. arXiv:math/0408159. doi:10.2307/30037438. JSTOR 30037438.
25. ^ 702. doi:10.1017/S0956796805005642. ISSN 1469-7653. S2CID 46359986.
26. ^ . Origami 4. Origami: Fourth International Meeting of Origami Science, Mathematics, and Education. pp. 383–406. doi:10.1201/b10653-38. ISBN .
27. ^ . Carleton College.
28. ^ . langorigami.com 2021.
29. ^ . ISBN .
30. ^
31. ^
32. ^.
33. ^
34. ^ . Forum Geometricorum. 14: 241–242.
35. ^ . Usenix Conference, Boston, MA.
36. ^ 2021.
37. ^
38. ^ ". Archived from the original on 2017-05-08.
39. ^ 23. Archived from the original on 14 November 2016 2015.
40. ^
41. ^
42. ^ 24. doi:10.1080/10724117.2002.11975147. JSTOR 25678354. S2CID 126397750.
43. ^ .
44. ^
45. ^ .
46. ^ 179. doi:10.1007/978-3-319-48532-4_15., correcting an earlier NP-completeness proof of Bern, Marshall; Hayes, Barry (1996). "The complexity of flat origami". Proc. 7th ACM-SIAM Symposium on Discrete Algorithms (SODA '96). Philadelphia, PA: Society for Industrial and Applied Mathematics. pp. 175–183.
47. ^ 973. doi:10.2197/ipsjjip.33.954.
48. ^.
49. ^{{}}: CS1 maint: location ()
50. ^.
51. ^.
52. ^.
53. ^ .
54. ^.
55. ^.
56. ^ . Science. 345 (6197): 644–646. Bibcode:2014Sci...345..644F. doi:10.1126/science.1252610. ISSN 0036-8075. PMID 25104380. S2CID 18415193.
57. ^.
58. ^.