Sciweavers

79 search results - page 1 / 16
» Graph Rewriting in Computational Origami
Sort
View
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
13 years 11 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida
SAC
2009
ACM
13 years 11 months ago
Origami fold as algebraic graph rewriting
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
Tetsuo Ida, Hidekazu Takahashi
ENTCS
2008
116views more  ENTCS 2008»
13 years 4 months ago
Computational Origami Construction as Constraint Solving and Rewriting
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 consi...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fado...
ICCSA
2007
Springer
13 years 10 months ago
Modeling Origami for Computational Construction and Beyond
Computational origami is the computer assisted study of origami as a branch of science of shapes. The origami construction is a countably finite sequence of fold steps, each consi...
Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Fado...
RTA
2010
Springer
13 years 8 months ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser