Computational geometry: an introduction
Computational geometry: an introduction
Basic principles of mechanical theorem proving in elementary geometrics
Journal of Automated Reasoning
The Mathematica Book
Elimination Practice: Software Tools and Applications
Elimination Practice: Software Tools and Applications
Logical and algebraic view of Huzita's origami axioms with applications to computational origami
Proceedings of the 2007 ACM symposium on Applied computing
Modeling origami for computational construction and beyond
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Computational origami of a morley’s triangle
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Towards a geometric-object-oriented language
ADG'04 Proceedings of the 5th international conference on Automated Deduction in Geometry
Origami fold as algebraic graph rewriting
Proceedings of the 2009 ACM symposium on Applied Computing
Origami fold as algebraic graph rewriting
Journal of Symbolic Computation
CTP-based programming languages?: considerations about an experimental design
ACM Communications in Computer Algebra
| Hi-index | 0.00 |
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 consisting in folding along a fold line. We base the fold methods on Huzita's axiomatization, and show how folding an origami can be formulated by a conditional rewrite system. A rewriting sequence of origami structures is viewed as an abstraction of origami construction. We also explain how the basic concepts of constraint and functional and logic programming are related to this computational construction. Our approach is not only useful for computational construction of an origami, but it leads us to automated theorem proving of the correctness of the origami construction.