<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>An e-origami artwork of a big wing crane</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Tetsuo Ida</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Tsukuba</institution>
          ,
          <addr-line>1-1-1 Tennoudai, Tsukuba, 305-8573</addr-line>
          ,
          <country country="JP">Japan</country>
        </aff>
      </contrib-group>
      <fpage>34</fpage>
      <lpage>45</lpage>
      <abstract>
        <p>We present the construction of a big wing crane as an application of folding with virtual cutting and gluing edges of origami faces in the e-origami environment. With the new methodology, we can reason about the construction algorithm for classical origami in finer steps rather than relying on the skill of the human hand. We employ a new origami model, as described in our earlier work, and we have developed software that implements classical origami folds.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;e-origami</kwd>
        <kwd>classical fold</kwd>
        <kwd>paper folding rule</kwd>
        <kwd>cut and glue edges</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Modeling for e-origami</title>
      <sec id="sec-2-1">
        <title>Origami is a term meaning “folding paper.” It also refers to a sheet of paper used for origami. Folding</title>
        <p>an origami along a fold line and unfolding the fold to the previous shape leaves a line segment, called
a crease, on the origami. We can construct various interesting geometric objects when we freely
choose fold lines and allow overlaps of faces without breaking the original sheet. When we impose
mathematically plausible fold line construction rules, we can define an origami geometry that deserves
deep mathematical investigation.</p>
      </sec>
      <sec id="sec-2-2">
        <title>Euclidean (plane) geometry constructs geometrical objects using only a straightedge and a compass.</title>
      </sec>
      <sec id="sec-2-3">
        <title>Similarly, origami geometry, a tool-less approach, defines its rules. Huzita-Justin’s rules are the com</title>
        <p>monly agreed rule set on which origami geometry is based. In Table 1, we list some (4 out of 7) of the</p>
      </sec>
      <sec id="sec-2-4">
        <title>Huzita-Justin rules implemented in the Eos system [5] that we use to construct a big wing crane. These rules, together with newly implemented classical folds (see next section) and software tools of Eos, allow us to manipulate origami flexibly.</title>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Modeling for e-origami</title>
      <sec id="sec-3-1">
        <title>We give a mathematical notation for the definition of origami and reason about its properties. In origami,</title>
        <p>we have faces and two kinds of neighborhood relations between the faces, i.e., superposition and
adjacency. The superposition is a vertical neighborhood relation, and the adjacency is a horizontal one.</p>
        <sec id="sec-3-1-1">
          <title>A face is a polygon having an attribute of sides. When we denote polygon 1 . . . , where we arrange</title>
          <p>points 1 . . .  counterclockwise, we call the plane front side, and the polygon  . . . 1 is identified
the same as with polygon 1 . . .  with the attribute of the back side. For any faces,  = 1 . . .  and
 = 1 . . . ,  is equal to  if  is a cyclic permutation of  or a cyclic permutation of a reverse of  .</p>
          <p>We let Π be a finite set of faces, ∽ be a binary relation on Π , called adjacency relation, and ≻ be a
binary relation on Π , called superposition relation. An abstract origami is a structure (Π , ∽, ≻ ). We
abbreviate abstract origami to AO. We denote the set of AOs by O. An abstract origami system is an
abstract rewriting system (O, ↬) [6] , where ↬ is a rewrite relation on O, called abstract fold.</p>
          <p>For , ′(∈ O), we write  ↬ ′ when  is abstractly folded to ′. We begin an origami
construction with an initial AO and perform an abstract fold repeatedly until we obtain the desired AO.</p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>Usually, we start an origami construction with a square sheet of paper. This initial sheet of paper is</title>
        <p>abstracted as a structure having a single distinguished face denoted by the numeral 1. Then, the initial
AO 1 is represented by ({1}, ∅, ∅). Furthermore, when we fold face , the face is divided into two
faces 2 and 2 + 1. We use this convention in this paper and the realization of the data structure of
the e-origami system Eos [7] and the origami language Orikoto of Eos. Suppose that we are at the
beginning of step  of the construction, having AO − 1 = (Π − 1, ∽− 1, ≻ − 1). We perform an abstract
fold and obtain a next AO  = (Π , ∽, ≻ ). Thus, we have the following ↬-sequence.
1 ↬ 2 ↬ · · ·
↬</p>
        <sec id="sec-3-2-1">
          <title>An abstract origami construction is a finite ↬-sequence of AOs. In concrete terms, the operation ↬ can</title>
          <p>be a fold by one of Huzita-Justin’s rules, a mountain fold, a valley fold, etc., each requiring arguments
of diferent kinds. We abuse  to be a name of the origami constructed at step .</p>
        </sec>
      </sec>
      <sec id="sec-3-3">
        <title>We now move on to concrete origami. Origami is a term meaning “folding paper.” It also refers</title>
        <p>to a sheet of paper used for origami. Folding an origami along a fold line and unfolding the fold to
the previous shape leaves a line segment, called a crease, on the origami. We can construct various
interesting geometric objects when we freely choose fold lines and allow overlaps of faces without
breaking the original sheet. When we impose mathematically plausible rules for choosing fold lines, we
can define an origami geometry that deserves deep mathematical investigation.</p>
      </sec>
      <sec id="sec-3-4">
        <title>Euclidean (plane) geometry constructs geometrical objects using only a straightedge and a com</title>
        <p>pass. Similarly, origami geometry, a tool-less approach, defines its rules. Huzita-Justin’s rules are the
commonly agreed rule set on which origami geometry is based. In Table 1, we list some (4 out of 7)</p>
      </sec>
      <sec id="sec-3-5">
        <title>Huzita-Justin rules that we use to construct a big wing crane. These rules, newly implemented classical folds (to be discussed in the next section), and our software tools allow us to manipulate origami flexibly.</title>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Classical Folds</title>
      <p>4.1. Mountain fold and Valley fold</p>
      <sec id="sec-4-1">
        <title>Understanding the fundamental fold operations of the mountain and valley fold is crucial in origami.</title>
        <p>These folds are named after the resemblance of the crease to a mountain ridge and a valley lap. The
crease is formed by the unfold operation that follows the mountain (or valley) fold. The result of the
valley fold is shown in Fig.1(b). The origami is now two-layered, but the back layer is not visible since
the upper triangle face completely overlaps the lower triangle face. Next, we unfold the origami shown
in Fig. 1(c). Unfold does not mean "undoing," although we recover the shape of the origami to the one
in Fig.1(a) except for the dotted line segment CA. We call the line segment valley crease. If we have a
rich imagination, the crease looks like a lap in the valley.</p>
        <p>(a) before valley fold
(b) after valley fold
(c) after unfold</p>
      </sec>
      <sec id="sec-4-2">
        <title>Similarly, we have a mountain fold below.</title>
        <p>(a) before mountain fold (b) after mountain fold
(c) after unfold</p>
      </sec>
      <sec id="sec-4-3">
        <title>The mountain and valley folds are similar to the Huzita-Justin rule (O1), with the important diference that rule (O1) operates on all the stacked faces. In contrast, the mountain and valley folds apply to automatically selected faces.</title>
      </sec>
      <sec id="sec-4-4">
        <title>The terms “valley” and “mountain” are sometimes misleading to beginner origami hobbyists since those folds are not necessarily immediately followed by an unfold. Hence, valley and mountain creases may not appear unless the origami is entirely unfolded. More geometrically clear terminology is desired for origami geometers.</title>
        <p>4.2. FO</p>
      </sec>
      <sec id="sec-4-5">
        <title>The above observation led us to define command FO. FO, standing for Fold Origami, is a command</title>
        <sec id="sec-4-5-1">
          <title>FO[ ][faces, ray] for rotating target faces along ray by angle  . It is a generalization of the mountain</title>
          <p>and valley folds. The implementation of FO contains an algorithm to select the target faces to be rotated
based on faces.</p>
        </sec>
      </sec>
      <sec id="sec-4-6">
        <title>Note that FO is defined as a Curried function. Using FO, we could define ValleyFold and MountainFold as follows:</title>
        <p>ValleyFold = FO[- ]; MountainFold = FO[ ];
With  other than ±  , FO constructs a 3D origami in general. Usually, we use FO[ ] towards the ending
steps of the construction.
4.3. Inside reverse and outside reverse folds</p>
      </sec>
      <sec id="sec-4-7">
        <title>The inside reverse and outside reverse folds are often used in paper folding. Both work on a pair of superposed faces that share an edge. When the cut-and-glue technique is introduced, both folds are realized by combinations of the valley and mountain folds. However, each uses the valley and mountain folds on opposite faces.</title>
        <p>4.3.1. Inside reverse fold</p>
      </sec>
      <sec id="sec-4-8">
        <title>Below we show a simple example of an inside reverse fold. Let</title>
        <p>1 ↬* 4 ↬* 6 ↬ 7 ↬ 8
be a construction sequence of the example. Each origami ,  ∈ {1, 4, 6, 7, 8} is visualized in Fig. 3.</p>
        <p>Origami 4 is consructed from 1 by a sequence of commands; VallyFold, ValleyFold, and Unfold. It
is a double-layered stack of faces. On the top layer are two faces, i.e., face CFE and face AEFD. On the
second one, i.e., the bottom layer, are two faces of the same shapes as the ones above but in opposite
orientations. Each face is identified by a unique face ID, automatically assigned by the system. In this
elementary example, we do not have to be concerned with face IDs since it is unnecessary to specify to
which faces we apply the inside reverse fold. To the example 4 of Fig. 3(b) we apply the following
command:</p>
        <p>InsideReverseFold["CE", "FE"]</p>
      </sec>
      <sec id="sec-4-9">
        <title>The first argument, CE, specifies the edge to be cut. It is specified as the type ray. The second argument, FE, is the ray along which mountain and valley folds are performed. The above inside reverse fold command performs the following operations:</title>
        <p>1. Check if the inside reverse fold is feasible. Namely, check if ∠CFE ≤ / 2.
2. Cut the edge CE. As a result, point C is split into C and C1(not shown). The result is 5. Origami
5 is not shown in Fig. 3.
3. Valley fold along ray FE. The face C1EG is moved. We impose a rule that faces to the right of a fold
line (interpreted as a ray) are moved by a fold. The result is 6,
4. Mountain fold along ray FE. The face CFE is moved. The result is 7.
5. Glue the moved edges CE and C1E to form a new edge CE. The result is 8.
(f) 8′ with wider gap</p>
      </sec>
      <sec id="sec-4-10">
        <title>Note in passing that performing Steps 2 and 3 above in sequence would only be possible when we</title>
        <p>cut and separated the shared edge EC. As we construct origami in a virtual space, we can cut CE and
glue the moved CEs without complication. After following the above steps, the obtained origami is
shown in Fig. 3(e) and (f); the latter illustrating the ins and outs of the origami object. Our specially
designed viewer generates this graphics image, providing a comprehensive view of the origami.</p>
      </sec>
      <sec id="sec-4-11">
        <title>On the other hand, in the case of the outside reverse fold, we make a polygonal cover on the faces.</title>
        <p>4.3.2. Outside reverse fold</p>
      </sec>
      <sec id="sec-4-12">
        <title>An outside reverse fold is similar to an inside reverse fold. The diference is that the outside reverse fold applies mountain and valley folds to diferent faces in opposite layers. We refer to the construction sequence</title>
        <p>
          1 ↬ 2 ↬ · · · ↬ 8,
where ,  = 1, . . . , 8 are visualized in Fig. 4(a)∼ (e). We apply the following command:
OutsideReverseFold["CE","FE"]
(
          <xref ref-type="bibr" rid="ref1">1</xref>
          )
to 4, and obtain 8. Note that constraint / 2 ≤ ∠ ≤  should be satisfied; otherwise the
execution of (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ) fails. The origami construction sequence in Fig. 4 is now self-explanatory. Figure 4 (f)
shows the origami structure of 8 more clearly.
4.3.3. Other classical folds
        </p>
      </sec>
      <sec id="sec-4-13">
        <title>In addition to the classical folds we have discussed so far, we analyzed the folding algoriths of the</title>
        <p>following classical folds well-known in the origami community and implemented them: SquashFold,</p>
      </sec>
      <sec id="sec-4-14">
        <title>RabbitEarFold, SwivelFold, InsideCrimpPleatFold, and OutsideCrimpPleatFold, using the cut-and-glue technique. They are given in the Appendix.</title>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Construction of a big wing crane</title>
      <p>5.1. Overview
A crane origami is an exciting example. It is one of the best-known artworks, requiring the classical
folds we discussed. Making a delicate crane by hand is challenging for beginner origami hobbyists. In</p>
      <p>(c) 6
(f) 8′ with wider gap
the context of e-origami, this example poses another challenge in modeling a new class of folds. We
will present the construction of a big wing crane origami. However, instead of describing in natural
language with guiding icons and annotation, we present an algorithm for constructing a crane origami.</p>
      <sec id="sec-5-1">
        <title>This algorithm provides a step-by-step prescription for folding the crane in a programming language.</title>
      </sec>
      <sec id="sec-5-2">
        <title>We present a big wing crane, a well-known flying crane origami variation [ 4]. Algorithmically, it is</title>
        <p>simpler than the ordinary, well-known ones.</p>
        <p>We start with a rhombus-shaped piece of paper. We have included entire program codes in a separate
webpage (www.i-eos.org/orikoto-program-of-a-big-wing-crane) to help the reader better understand
the internal origami structure. These codes are not just for show-they allow us to visualize the intricate
folds and their arrangement, making the construction process more accessible. In this construction,
we specify the origami faces of textured patterns on the completed work, adding an artistic dimension
to the origami. This approach, requiring a special texture mapping algorithm, opens up new creative
possibilities in origami modeling. To complete the artwork shown below, we need 71 steps. In one step,
an origami object will make one structural change. For example, we count one structural change of
the origami object in one application of a valley fold, a mountain fold, and one of the Huzita-Justin
folds. One inside reverse fold requires four substeps, i.e., cut, valley fold, mountain fold, and glue. The
number of steps for the entire construction is surprisingly large at first sight, but we should observe
that the origami objects have several symmetries. Therefore, a similar code sequence is repeated more
than once. The number of crucial operations is limited. While the space is limited in this paper, we
assure the readers that they grasp the essence of the construction by showing carefully selected crucial
steps and output graphics of the origami construction process.</p>
      </sec>
      <sec id="sec-5-3">
        <title>The construction consists of the following four stages.</title>
        <p>
          (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ) bird base construction,
(
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) leg construction,
(
          <xref ref-type="bibr" rid="ref3">3</xref>
          ) bill construction,
(
          <xref ref-type="bibr" rid="ref4">4</xref>
          ) wing construction.
        </p>
      </sec>
      <sec id="sec-5-4">
        <title>We will briefly explore the steps in each stage.</title>
        <p>5.2. Bird base construction
LLet  be a construction 1 ↬* , where  &gt; 1 and  has a certain distinguidh feature , we call
 an -base construction. We want to construct a bird-like origami . In this stage, we will construct
a bird base, i.e.,  is a bird and  = 49. We also call  a bird base.</p>
        <p>Let  be a construction 1 ↬* , where  &gt; 1 and  has a certain distinguidh feature , we call
 an -base construction. We want to construct a bird-like origami . In this stage, we will construct
a bird base, i.e.,  is a bird and  = 49. We also call  a bird base.</p>
        <sec id="sec-5-4-1">
          <title>The first 11 steps in  produce 1, . . . , 11 shown in Fig. 5. We start with an initial origami of a</title>
          <p>rhombus shape to make the crane’s wings bigger than the crane made from the square initial origami.
Applying rule (O2) to 1 and 2, we obtain 3. 3 is quad layered. We apply rule (O3) to fold 3
along the bisector of ∠BCE, and then unfold 4 to obtain 5. Steps 4 and 5 aim to construct a valley
crease F4E that will be used in the inside reverse fold on 5. 5 has three other creases, F3E, F2E, and</p>
        </sec>
      </sec>
      <sec id="sec-5-5">
        <title>F1E, at the intersection of the bisector and the hypotenuses of the right triangular faces on four layers.</title>
        <p>The subsequence of the construction 5 ↬* 9 ↬ 10 shows the first application of the inside
reverse fold on 5:</p>
        <p>InsideReverseFold}["BE", "F4E"].</p>
      </sec>
      <sec id="sec-5-6">
        <title>The application of InsideReverseFold requires four substeps, i.e., cut, valley fold, mountain fold, and</title>
        <p>glue, and returns 9. The top view of 5 and 9 appears the same, but two triangular faces BF3E and
BF4E have been moved below face CEF4 in 9 by the application. When we move face CEF4 at step 10,
we observe the diference. By turning over 10, we have origami 11 seen from the backside2.
2We have a command TurnOver[], which is a variation of FO[ ][].
(b) 2
(c) 3
(d) 4
(e) 5
(f) 9
(g) 10
(h) 11
struction sequence 11 ↬* 15 ↬ 16 ↬ 17.</p>
        <p>Similarly, we apply another inside reverse fold to the right half of 11, and by following the
con(a) 15: by insert reverse
fold
(b) 16: by (O1)
(c) 17: by turn over</p>
        <p>The rest of the subsequence in the bird base is given in Figs. 7 and 8 with annotation in the title of
each sub-figure. Each sequence of figures are the visualization of
and</p>
        <p>↬* 23 ↬ 29 ↬ 30,
↬* 36 ↬ 42 ↬ 43 ↬* 46 ↬ 48 ↬ 49.
(a) 23: by insert reverse(b) 29: by insert reverse
fold fold
(c) 30: by turn over</p>
        <p>At the end of the bird base construction, we obtain 48 and 49. The latter is the bird base. The bird
base is crucial in origami crane construction, whether for the big wing crane or for a commonly known
classical crane. This slim diamond-shaped origami piece has a crack in the middle of the upper half
shown in 49 in Fig. 8(f). This piece is quad-layered, and each double layer is vertically symmetric as
well as horizontallly symmetric with respect fo the axis AB.
5.3. Leg construction</p>
      </sec>
      <sec id="sec-5-7">
        <title>The leg construction subsequence is the following:</title>
        <p>↬* 53 ↬* 5*7 ↬* 61</p>
        <sec id="sec-5-7-1">
          <title>We apply the inside reverse fold to the right and left parts of the bird base 49. Note that the inside</title>
          <p>reverse fold can be applied to multiple layers of faces.
5.4. Bill construction</p>
        </sec>
      </sec>
      <sec id="sec-5-8">
        <title>The bill construction subsequence is the following:</title>
        <p>↬* 61 ↬* 63 ↬* 67 ↬ 68</p>
      </sec>
      <sec id="sec-5-9">
        <title>Here, we make crease Z1Z2, where we choose by the designer’s preference arbitraly positions of points</title>
      </sec>
      <sec id="sec-5-10">
        <title>Z1 and Z2 on the edges. The crease determines the twist of the bill. We apply the inside reverse fold on</title>
        <p>62. Then, we rotate 66 along R1L1 by  and obtain 68.
5.5.</p>
        <p>Wing construction
Finally, we apply the command FO twice to make the origami three-dimensional. We apply FO[-(3/8)  ]
to those faces that constitute the wings. We complete the construction to bring the bill partly to the
right, as this is our preferred posture. Our viewer can manipulate the origami object. The viewer and
(a) 36: by insert reverse (b) 42: by insert reverse
fold fold
(c) 43: by turn over
(d) 46: bring inner face to (e) 48: bring inner face to
outside outside
(f) 49: by turn over</p>
      </sec>
      <sec id="sec-5-11">
        <title>Mathematica’s graphics functions [8], for example, remove the point names and change the size of the image and lighting.</title>
        <p>↬* 69 ↬ 70 ↬ 71
5.6. Texture mapping and adjustment of posture
The following are the results of our artwork. Figure 11(a) is the polished version of 71. We removed
the point names, enlarged the image, and readjusted the posture of the crane. Figures 11(b) and (c)
are obtained by adding textures to the image of 71, using the functionality of texture mapping of</p>
      </sec>
      <sec id="sec-5-12">
        <title>Mathematica.</title>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Concluding remarks</title>
      <sec id="sec-6-1">
        <title>We have shown that the cut-and-glue technique simplifies modeling the classical folds and, hence,</title>
        <p>the implementation in the e-origami environment. Using a cut operation, we have shown that the
seemingly complex inside (and outside) reverse fold is reduced to a sequence of FO folds. We illustrated
other popular classical folds, such as a rabbit ear fold, are realized similarly.</p>
      </sec>
      <sec id="sec-6-2">
        <title>We constructed a big wing crane origami as a nontrivial application of the newly defined inside reverse fold. The design is coordinate-free yet allows for the freedom of choice of wing angles and</title>
        <p>(a) 53: creae X1F3
(b) 57: by insert reverse (c) 61: right leg
construc</p>
        <p>fold tion
two positions of bending points of a bill. The construction proceeds as step-by-step fold operations
described in the Orikoto origami programming language. Thus, creating a big wing crane is purely an
algorithmic process. Furthermore, the added feature of texture mapping of our system, Eos, makes the
ifnal product more original artwork.</p>
      </sec>
      <sec id="sec-6-3">
        <title>The algorithm’s implementation in the earlier paper [1] was extensively tested and extended for more capabilities. The newer Eos version and the construction program are published at the website [9].</title>
        <p>(b) 70: by turn over
(c) 71: by FO</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>A. Classical folds realizable by cut-and-glue technique</title>
      <p>• Squash fold</p>
      <p>SquashFold = InserReverseFold; (O1)
• Inside crimp pleat fold
• Outside crimp pleat fold
(a) before
(a) before
(a) before
(a) before
(b) after
(b) after
(b) after
(b) after</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>T.</given-names>
            <surname>Ida</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Takahashi</surname>
          </string-name>
          ,
          <article-title>A new modeling of classical folds in computational origami</article-title>
          , in: P.
          <string-name>
            <surname>Janičić</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          Kovács (Eds.),
          <source>Proceedings of the 13 th International Conference on Automated Deduction in Geometry</source>
          , volume
          <volume>352</volume>
          <source>of EPTCS</source>
          , Elsevier Inc.,
          <year>2021</year>
          , pp.
          <fpage>41</fpage>
          -
          <lpage>53</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>H.</given-names>
            <surname>Huzita</surname>
          </string-name>
          (Ed.),
          <source>Proceedings of the First International Meeting of Origami Science and Technology, Ferrara, Italy</source>
          ,
          <year>1989</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J.</given-names>
            <surname>Justin</surname>
          </string-name>
          ,
          <article-title>Résolution par le pliage de l'équation du 3e degré et applications géométriques</article-title>
          , L'
          <string-name>
            <surname>Ouvert</surname>
          </string-name>
          (
          <year>1986</year>
          )
          <fpage>9</fpage>
          -
          <lpage>19</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>K.</given-names>
            <surname>Fushimi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fushimi</surname>
          </string-name>
          , Geometry of Origami, Nippon Hyoron sha Co. Ltd.,
          <year>1979</year>
          . (in Japanese).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>T.</given-names>
            <surname>Ida</surname>
          </string-name>
          , An introduction to Computational Origami, Texts and Monographs in Symbolic Computation, Springer International Publishing Switzerland,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Bezem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Klop</surname>
          </string-name>
          ,
          <source>Abstract reduction systems, volume Term Rewriting Systems</source>
          , Cambridge University Press,
          <year>2003</year>
          , pp.
          <fpage>7</fpage>
          -
          <lpage>23</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>T.</given-names>
            <surname>Ida</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Tepeneu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Buchberger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Robu</surname>
          </string-name>
          ,
          <article-title>Proving and Constraint Solving in Computational Origami</article-title>
          ,
          <source>in: Proceedings of the 7th International Symposium on Artificial Intelligence and Symbolic Computation (AISC</source>
          <year>2004</year>
          ), volume
          <volume>3249</volume>
          <source>of Lecture Notes in Artificial Intelligence</source>
          ,
          <year>2004</year>
          , pp.
          <fpage>132</fpage>
          -
          <lpage>142</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Wolfram</given-names>
            <surname>Research</surname>
          </string-name>
          , Inc.,
          <string-name>
            <surname>Mathematica</surname>
          </string-name>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Eos</surname>
            <given-names>project</given-names>
          </string-name>
          ,
          <year>2024</year>
          . URL: https://www.i-eos.org.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>