skip to main content
10.1145/1982185.1982429acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Origami axioms and circle extension

Published:21 March 2011Publication History

ABSTRACT

Origami, i.e. paper folding, is a powerful tool for geometrical constructions. In 1989, Humiaki Huzita introduced six folding operations based on aligning one or more combinations of points and lines [6]. Jacques Justin, in his paper of the same proceedings, also presented a list of seven distinct operations [9]. His list included, without literal description, one extra operation not in Huzita's paper. Justin's work was written in French, and was somehow unknown among researchers. This led Hatori [5] to 'discover' the same seventh operation in 2001. Alperin and Lang in 2006 [1] showed, by exhaustive enumeration of combinations of superpositions of points and lines involved, that the seven operations are complete combinations of the alignments. Huzita did not call his list of operations axioms. However, over years, the term Huzita axioms, or Huzita-Justin or Huzita-Hatori axioms, has been widely used in origami community. From logical point of view, it is not accurate to call Huzita's original statements of folding operations as axioms, because they are not always true in plane Euclidean geometry. In this paper, we present precise statements of the folding operations, by which naming them 'axioms' is logically valid, and we make some notes about the work of Huzita and Justin.

References

  1. R. C. Alperin and R. J. Lang. One-, Two-, and Multi-fold Origami Axioms. In Origami<sup>4</sup> Fourth International Meeting of Origami Science, Mathematics and Education. A K Peters Ltd.Google ScholarGoogle Scholar
  2. B. C. Edwards and J. Shurman. Folding quartic roots. Mathematics Magazine, 74(1): 19--25, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  3. K. Fushimi. Science of Origami. October 1980. A supplement to Saiensu (in Japanese).Google ScholarGoogle Scholar
  4. F. Ghourabi, T. Ida, H. Takahashi, M. Marin, and A. Kasem. Logical and algebraic view of huzita's origami axioms with applications to computational origami. In Proceedings of the 22nd ACM Symposium on Applied Computing, pages 767--772. ACM Press, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. K. Hatori. K's Origami: Fractional Library, 2001. http://origami.ousaan.com/library/conste.html.Google ScholarGoogle Scholar
  6. H. Huzita. Axiomatic Development of Origami Geometry. In Proceedings of the 1st International Meeting of Origami Science and Technology, pages 143--158.Google ScholarGoogle Scholar
  7. T. Ida, A. Kasem, F. Ghourabi, and H. Takahashi. Morley's theorem revisited: Origami construction and automated proof. Journal of Symbolic Computation, In Press, Accepted Manuscript, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. T. Ida, H. Takahashi, M. Marin, A. Kasem, and F. Ghourabi. Computational Origami System Eos. In Origami<sup>4</sup> Fourth International Meeting of Origami Science, Mathematics and Education. A K Peters Ltd, 2009.Google ScholarGoogle Scholar
  9. J. Justin. Résolution par le pliage de l'équation du troisième degré et applications géométriques. In Proceedings of the 1st International Meeting of Origami Science and Technology, pages 251--261.Google ScholarGoogle Scholar
  10. R. J. Lang. Origami and Geometric Constructions. http://www.langorigami.com/science/hha/origami_constructions.pdf, 1996--2003.Google ScholarGoogle Scholar

Index Terms

  1. Origami axioms and circle extension

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          SAC '11: Proceedings of the 2011 ACM Symposium on Applied Computing
          March 2011
          1868 pages
          ISBN:9781450301138
          DOI:10.1145/1982185

          Copyright © 2011 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 21 March 2011

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate1,650of6,669submissions,25%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader