Graph Rewriting in Computational Origami

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 R².