• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Formalization of origami and origami-programming based on algebraic graph rewriting

Research Project

Project/Area Number 22650001
Research Category

Grant-in-Aid for Challenging Exploratory Research

Allocation TypeSingle-year Grants
Research Field Fundamental theory of informatics
Research InstitutionUniversity of Tsukuba

Principal Investigator

IDA Tetsuo  筑波大学, 名誉教授 (70100047)

Co-Investigator(Kenkyū-buntansha) MARIN Mircea  筑波大学, 大学院・システム情報工学研究科, 講師 (60396603)
Project Period (FY) 2010 – 2012
Project Status Completed (Fiscal Year 2012)
Budget Amount *help
¥3,280,000 (Direct Cost: ¥2,800,000、Indirect Cost: ¥480,000)
Fiscal Year 2012: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2011: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2010: ¥1,200,000 (Direct Cost: ¥1,200,000)
Keywords計算折紙論 / 記号計算 / 書換え系 / 自動幾何定理証明 / 制約問題 / 代数的グラフ書換系 / グロブナ基底計算 / 計算折紙 / グラフ書き換え / 検証支援系 / 制約計算 / 計算理論 / グラフ書換系 / 折紙計算論 / 定理自動証明
Research Abstract

Abstraction of paper fold (origami) and establishment of a formal theory of fold are our ultimate goal. Towards that goal, we formalized origami by algebraic graph rewriting theory and verified certain geometrical propertiesof origami. The results we obtained are as follows:
(1) We develop a graph rewriting language for origami and its interpreter.
(2) In order to concretize the graph rewriting to be used to simulate actual origami and to verify geometrical properties, we developed algorithms for transformingbasic folds to algebraic expressions.
(3) In parallel with the above developments we extended and improved e-origami system Eos that we have developed. The extension enables us to automatically verify more geometrical theorems and to speed up the computation of proving.

Report

(4 results)
  • 2012 Annual Research Report   Final Research Report ( PDF )
  • 2011 Annual Research Report
  • 2010 Annual Research Report
  • Research Products

    (13 results)

All 2012 2011 2010 Other

All Journal Article (10 results) (of which Peer Reviewed: 9 results) Presentation (1 results) (of which Invited: 1 results) Remarks (2 results)

  • [Journal Article] Interactive vs. Automated Proofs in Computational Origami, Proceedings of 14thInternational Symposium on Symbolic and Numeric Algorithmsfor Scientific Computing (SYNASC 2012)2012

    • Author(s)
      Ida, T
    • Journal Title

      IEEE Computer Scociety

    • Related Report
      2012 Final Research Report
  • [Journal Article] Origami Axioms and Circle Extension2011

    • Author(s)
      Kasem. A, Ghourabi. F, and Ida. T
    • Journal Title

      Proceedings of the 26th Symposium onApplied Computing (ACM/SAC 2011)

      Pages: 1106-1111

    • Related Report
      2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] Morley's theorem revisited: Origami construction and automated proof2011

    • Author(s)
      Ida. T, Kasem. A, Ghourabi. F, and Takahashi. H
    • Journal Title

      Journal of Symbolic Computation

      Volume: 46 Pages: 162-170

    • NAID

      120007130912

    • Related Report
      2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] Proof Documents for Automated OrigamiTheorem Proving2011

    • Author(s)
      Ghourabi. F, Ida. T, and Kasem. A
    • Journal Title

      Lecture Notes in Computer Science (post-proceeding of the 8th International Workshop on Automated Deduction in Geometry (ADG 2010))

      Volume: 6877巻 Pages: 78-97

    • Related Report
      2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] Proof Assistant Decision Procedures for Formalizing Origami2011

    • Author(s)
      Kaliszyk. C, and Ida. T
    • Journal Title

      Lecture Notes in Computer Science (proceedings of the Conference on Intelligent Computer Mathematics (CICM'11))

      Volume: 6824巻 Pages: 45-57

    • Related Report
      2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] Proof Documents for Automated Origami Theorem Proving2011

    • Author(s)
      Ghourabi. F, Ida. T, Kasem. A
    • Journal Title

      Lecture Notes in Computer Science (post-proceeding of the 8th International Workshop on Automated Deduction in Geometry (ADG 2010))

      Volume: 6877 Pages: 78-97

    • DOI

      10.1007/978-3-642-25070-5_5

    • ISBN
      9783642250699, 9783642250705
    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Proof Assistant Decision Procedures for Formalizing Origami2011

    • Author(s)
      Kaliszyk. C, Ida. T
    • Journal Title

      Lecture Notes in Computer Science (proceedings of the Conference on Intelligent Computer Mathematics (CICM'11))

      Volume: 6824 Pages: 45-57

    • DOI

      10.1007/978-3-642-22673-1_4

    • ISBN
      9783642226724, 9783642226731
    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Origami Axioms and Circle Extension2011

    • Author(s)
      Kasem. A, Ghourabi. F, Ida. T
    • Journal Title

      Proceedings of the 26th Symposium on Applied Computing (SAC 2011)

      Pages: 1106-1111

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Morley's theorem revisited : Origami construction and automated proof2011

    • Author(s)
      Ida. T, Kasem. A, Ghourabi. F, Takahashi. H
    • Journal Title

      Journal of Symbolic Computation

      Volume: 46 Pages: 162-170

    • NAID

      120007130912

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] グラフ書換による計算折り紙のモデル化と実現2010

    • Author(s)
      高橋英和,井田哲雄
    • Journal Title

      コンピュータソフトウェア

      Volume: 27 Pages: 2-13

    • NAID

      10026468268

    • Related Report
      2012 Final Research Report 2010 Annual Research Report
    • Peer Reviewed
  • [Presentation] Interactive vs. automated proofs in computational origami2012

    • Author(s)
      Tetsuo Ida
    • Organizer
      14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
    • Place of Presentation
      Tmisoara, Rumania
    • Related Report
      2012 Annual Research Report
    • Invited
  • [Remarks]

    • URL

      http://www.i-eos.org

    • Related Report
      2012 Final Research Report
  • [Remarks] Eos Project

    • URL

      http://www.i-eos.org/

    • Related Report
      2012 Annual Research Report

URL: 

Published: 2010-08-23   Modified: 2019-07-29  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi