Proving and Constraint Solving in Computational Origami

نویسندگان

  • Tetsuo Ida
  • Dorin Tepeneu
  • Bruno Buchberger
  • Judit Robu
چکیده

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.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational Origami Construction as Constraint Solving and Rewriting

Computational origami is the computer assisted study of origami geometry. An origami is constructed by a finite sequence of fold steps, each consisting in folding along a fold line or unfolding. We base the fold methods on a formal system called Huzita’s axiom system, and show how folding an origami can be formulated by a conditional rewrite system. A rewriting sequence of origami structures is...

متن کامل

Computational Construction of a Maximum Equilateral Triangle Inscribed in an Origami

We present an origami construction of a maximum equilateral triangle inscribed in an origami, and an automated proof of the correctness of the construction. The construction and the correctness proof are achieved by a computational origami system called Eos (E-origami system). In the construction we apply the techniques of geometrical constraint solving, and in the automated proof we apply Gröb...

متن کامل

Computational Origami of a Morley's Triangle

We present a computational origami construction of Morley’s triangles and automated proof of correctness of the generalized Morley’s theorem in a streamlined process of solving-computing-proving. The whole process is realized by a computational origami system being developed by us. During the computational origami construction, geometric constraints in symbolic and numeric representation are ge...

متن کامل

Proof Documents for Automated Origami Theorem Proving

A proof document for origami theorem proving is a record of entire process of reasoning about origami construction and theorem proving. It is produced at the completion of origami theorem proving as a kind of proof certificate. It describes in detail how the whole process of an origami construction and the subsequent theorem proving are carried out in our computational origami system. In partic...

متن کامل

Interactive Construction and Automated Proof in Eos System with Application to Knot Fold of Regular Polygons

In origami geometry, the construction and the verification should go hand in hand. When we present a new origami by a new fold method, we will show certain geometric properties that enable us to claim its novelty by formal argument, i.e. proving. It is desirable to have some kind of automation by a computer towards computer-aided origami. Several systems have been implemented to simulate and tr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004