DocumentCode :
2966452
Title :
Graph Rewriting in Computational Origami
Author :
Ida, Tetsuo
Author_Institution :
Dept. of Comput. Sci., Univ. of Tsukuba, Tsukuba, Japan
fYear :
2008
fDate :
26-29 Sept. 2008
Firstpage :
20
Lastpage :
27
Abstract :
We give graph-theoretic formalization of origami, the art of paper folding. Starting from the abstract origami system, we model origami construction as are write sequence of abstract origami´s. To reason about the entire origami construction for the computational purposes, we define a labeled hypergraph for origami and give the abstraction of origami fold as a set of algebraic graph rewrite rules. We give detailed description of the fold operation in terms of graph rewriting. The graph-theoretic formalism enables us to reason in two separate domains of discourse, i.e. pure combinatoric domain and geometrical domain R2.
Keywords :
art; graph theory; rewriting systems; abstract origami system; algebraic graph rewrite rules; computational origami; graph rewriting; graph theoretic formalization; labeled hypergraph; origami construction; paper folding; Art; Bridges; Combinatorial mathematics; Computer science; Scientific computing; Solid modeling; computational origami; geometrical reasoning and modeling; graph rewiting;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Symbolic and Numeric Algorithms for Scientific Computing, 2008. SYNASC '08. 10th International Symposium on
Conference_Location :
Timisoara
Print_ISBN :
978-0-7695-3523-4
Type :
conf
DOI :
10.1109/SYNASC.2008.86
Filename :
5204784
Link To Document :
بازگشت