Origami fold as algebraic graph rewriting

DOI10.1016/J.JSC.2009.10.002zbMath1214.05092OpenAlexW2022732032MaRDI QIDQ2269692

Hidekazu Takahashi, Tetsuo Ida

Publication date: 17 March 2010

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://tsukuba.repo.nii.ac.jp/?action=repository_action_common_download&item_id=19261&item_no=1&attribute_id=17&file_no=1

zbMATH Keywords

graph rewritingrewrite systemcomputational origamigeometrical modeling

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Formalizing polygonal knot origami

Cites Work

• Unnamed Item
• An algorithm for transitive reduction of an acyclic graph
• Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami
• A mathematical theory of origami constructions and numbers
• Fundamentals of algebraic graph transformation
• Computational Origami Construction as Constraint Solving and Rewriting
• Computational Construction of a Maximum Equilateral Triangle Inscribed in an Origami

This page was built for publication: Origami fold as algebraic graph rewriting