Proving and constraint solving in computational origami

被引:0
|
作者
Ida, T
Tepeneu, D
Buchberger, B
Robu, J
机构
[1] Univ Tsukuba, Dept Comp Sci, Tsukuba, Ibaraki 3058573, Japan
[2] Johannes Kepler Univ Linz, Res Inst Symbol Computat, A-4232 Hagenberg, Austria
[3] Univ Babes Bolyai, Dept Comp Sci, Cluj Napoca 3400, Romania
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Origami (paper folding) has a long tradition in Japan's culture and education. We are developing a computational origami system, based on symbolic computation system Mathematica, for performing and reasoning about origami on the computer. This system is based on the implementation of the six fundamental origami folding steps (origami axioms) formulated by Huzita. In this paper, we show how our system performs origami folds by constraint solving, visualizes each step of origami construction, and automatically proves general theorems on the result of origami construction using algebraic methods. We illustrate this by a simple example of trisecting an angle by origami. The trisection of an angle is known to be impossible by means of a ruler and a compass. The entire process of computational origami shows nontrivial combination of symbolic constraint solving, theorem proving and graphical processing.
引用
收藏
页码:132 / 142
页数:11
相关论文
共 50 条
  • [1] Computational Origami Construction as Constraint Solving and Rewriting
    Ida, Tetsuo
    Marin, Mircea
    Takahashi, Hidekazu
    Ghoura, Fadoua
    [J]. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2008, 216 : 31 - 44
  • [2] Theorem Proving as Constraint Solving with Coherent Logic
    Janicic, Predrag
    Narboux, Julien
    [J]. JOURNAL OF AUTOMATED REASONING, 2022, 66 (04) : 689 - 746
  • [3] Theorem Proving as Constraint Solving with Coherent Logic
    Predrag Janičić
    Julien Narboux
    [J]. Journal of Automated Reasoning, 2022, 66 : 689 - 746
  • [4] PROVING CORRECTNESS OF A KRK CHESS ENDGAME STRATEGY BY SAT-BASED CONSTRAINT SOLVING
    Malikovic, Marko
    Janicic, Predrag
    [J]. ICGA JOURNAL, 2013, 36 (02) : 81 - 99
  • [5] Proof Documents for Automated Origami Theorem Proving
    Ghourabi, Fadoua
    Ida, Tetsuo
    Kasem, Asem
    [J]. AUTOMATED DEDUCTION IN GEOMETRY, 2011, 6877 : 78 - +
  • [6] Mathematics - Proving a link between logic and origami
    Cipra, B
    [J]. SCIENCE, 1998, 279 (5352) : 804 - 805
  • [7] Swinging UML - How to make class diagrams and state machines amenable to constraint solving and proving
    Padawitz, P
    [J]. UML 2000 - THE UNIFIED MODELING LANGUAGE, PROCEEDINGS: ADVANCING THE STANDARD, 2000, 1939 : 162 - 177
  • [8] Proving concurrent constraint programs correct
    DeBoer, FS
    Gabbrielli, M
    Marchiori, E
    Palamidessi, C
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1997, 19 (05): : 685 - 725
  • [9] SOFT ORIGAMI: CLASSIFICATION, CONSTRAINT, AND ACTUATION OF HIGHLY COMPLIANT ORIGAMI STRUCTURES
    Wheeler, Charles M.
    Culpepper, Martin L.
    [J]. INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, 2015, VOL 5B, 2016,
  • [10] Soft Origami: Classification, Constraint, and Actuation of Highly Compliant Origami Structures
    Wheeler, Charles M.
    Culpepper, Martin L.
    [J]. JOURNAL OF MECHANISMS AND ROBOTICS-TRANSACTIONS OF THE ASME, 2016, 8 (05):