@article{oai:tsukuba.repo.nii.ac.jp:00019261,
author = {井田, 哲雄 and Ida, Tetsuo and Takahashi, Hidekazu},
issue = {4},
journal = {Journal of symbolic computation},
month = {Apr},
note = {We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting system View the MathML source, where View the MathML source is the set of abstract origamis and right arrow-looped is a binary relation on View the MathML source, that models fold. An abstract origami is a structure (Π,reverse similar,succeeds), where Π is a set of faces constituting an origami, and reverse similar and succeeds are binary relations on Π, each representing adjacency and superposition relations between the faces.
We then address representation and transformation of abstract origamis and further reasoning about the construction for computational purposes. We present a labeled hypergraph of origami and define fold as algebraic graph transformation. The algebraic graph-theoretic formalism enables us to reason about origami in two separate domains of discourse, i.e. pure combinatorial domain where symbolic computation plays the main role and geometrical domain View the MathML source. We detail the program language for the algebraic graph rewriting and graph rewriting algorithms for the fold, and show how fold is expressed by a set of graph rewrite rules.},
pages = {393--413},
title = {Origami fold as algebraic graph rewriting},
volume = {45},
year = {2010}
}