Origami fold as algebraic graph rewriting
From MaRDI portal
Publication:2269692
Recommendations
- Realization and connectivity of the graphs of origami flat foldings
- Realization and connectivity of the graphs of origami flat foldings
- Computational origami construction as constraint solving and rewriting
- On the folding of graphs-theory and application
- Origami edge-paths in the curve graph
- Transitive decompositions of graphs and their links with geometry and origami
- Origami at the intersection of algebra, geometry and calculus
- Origami, Linkages, and Polyhedra: Folding with Algorithms
- scientific article; zbMATH DE number 2217748
Cites work
- A mathematical theory of origami constructions and numbers
- An algorithm for transitive reduction of an acyclic graph
- Computational construction of a maximum equilateral triangle inscribed in an origami
- Computational origami construction as constraint solving and rewriting
- Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami
- Fundamentals of algebraic graph transformation
- Geometric folding algorithms. Linkages, origami, polyhedra
Cited in
(7)- Algorithmische Transformation von Papierstrukturen. Ein Beitrag zur Verallgemeinerung des Konstruktionsbegriffes. (Algorithmic transformation of paper structures. A contribution to the generalization of the construction-concept)
- A new modeling of classical folds in computational origami
- An Algorithm for Finding the Veech Group of an Origami
- Formalizing polygonal knot origami
- Algebraic systems motivated by DNA origami
- Graph models for PLA folding problems
- DNA origami words, graphical structures and their rewriting systems
This page was built for publication: Origami fold as algebraic graph rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2269692)