Computational Origami Construction as Constraint Solving and Rewriting

作     者：Ida, Tetsuo Marin, Mircea Takahashi, Hidekazu Ghoura, Fadoua 

作者机构：Univ Tsukuba Dept Comp Sci Tsukuba Ibaraki 3058357 Japan 

出 版 物：《ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE》 (理论计算机科学电子札记)

年 卷 期：2008年第216卷第C期

页      面：31-44页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：JSPS Exploratory Research Grants-in-Aid for Scientific Research [17300004, 19650001] Funding Source: KAKEN 

主　　题：computational origami constraint solving rewriting functional logic programming automated theorem proving 

摘      要：Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consisting in folding along a fold line. We base the fold methods on Huzita s axiomatization, and show how folding an origami can be formulated by a conditional rewrite system. A rewriting sequence of origami structures is viewed as an abstraction of origami construction. We also explain how the basic concepts of constraint and functional and logic programming are related to this computational construction. Our approach is not only useful for computational construction of an origami, but it leads us to automated theorem proving of the correctness of the origami construction.