Origami fold as algebraic graph rewriting

Journal of Symbolic Computation - Tập 45 - Trang 393-413 - 2010
Tetsuo Ida1, Hidekazu Takahashi2
1Department of Computer Science, University of Tsukuba, Tsukuba 305-8573, Japan
2Shiga Prefectural Yokaichi High School, Higashiomi, 527-0022, Japan

Tài liệu tham khảo

Alperin, 2000, A mathematical theory of origami constructions and numbers, New York Journal of Mathematics, 6, 119 Demaine, 2002, Recent results in computational origami, 3 Demaine, 2007 Ehrig, 2006 Gries, 1989, An algorithm for transitive reduction of an acyclic graph, Science of Computer Programming, 12, 151, 10.1016/0167-6423(89)90039-7 Huzita, H., Axiomatic development of origami geometry, in: H. Huzita (Ed.), Proceedings of the First International Meeting of Origami Science and Technology, 1989, pp. 143–158 Ida, 2008, Computational origami construction as constraint solving and rewriting, vol. 216, 31 Ida, 2007, Modeling origami for computational construction and beyond, vol. 4706, 653 Ida, 2006, Computational construction of a maximal equilateral triangle inscribed in an origami, vol. 4151, 361 Schneider, 2008