<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">jamp</journal-id>
      <journal-title-group>
        <journal-title>Journal of Applied Mathematics and Physics</journal-title>
      </journal-title-group>
      <issn pub-type="epub">2327-4379</issn>
      <issn pub-type="ppub">2327-4352</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/jamp.2026.1411222</article-id>
      <article-id pub-id-type="publisher-id">jamp-155409</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Physics</subject>
          <subject>Mathematics</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Fractals Generated through the Chaos Game: A Study of Iterated Function Systems, the Barnsley Fern, the Collage Theorem, and the Dragon Curve</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <contrib-id contrib-id-type="orcid">0000-0003-3574-3392</contrib-id>
          <name name-style="western">
            <surname>Akter</surname>
            <given-names>Reshma</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Afroz</surname>
            <given-names>Shahana</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Akter</surname>
            <given-names>Taslima</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Ahmed</surname>
            <given-names>Payer</given-names>
          </name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> Department of Mathematics, European University of Bangladesh, Dhaka, Bangladesh </aff>
      <aff id="aff2"><label>2</label> Department of Mathematics, Jagannath University, Dhaka, Bangladesh </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The authors declare no conflicts of interest regarding the publication of this paper.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>05</day>
        <month>11</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>11</month>
        <year>2026</year>
      </pub-date>
      <volume>14</volume>
      <issue>11</issue>
      <fpage>4516</fpage>
      <lpage>4528</lpage>
      <history>
        <date date-type="received">
          <day>31</day>
          <month>08</month>
          <year>2026</year>
        </date>
        <date date-type="accepted">
          <day>16</day>
          <month>11</month>
          <year>2026</year>
        </date>
        <date date-type="published">
          <day>19</day>
          <month>11</month>
          <year>2026</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2026 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/jamp.2026.1411222">https://doi.org/10.4236/jamp.2026.1411222</self-uri>
      <abstract>
        <p>Chaos Game is an easy-to-implement random algorithm that can create highly complex and structured fractals. This paper is devoted to the mathematical and computational analysis of the Chaos Game based on the ideas of Iterated Function Systems (IFS). We will present a brief overview of the main notions of IFS-attractors and Barnsley’s Collage Theorem and discusses their application to the description of the emergence of the classic Chaos Game algorithm with three points to the Sierpinski triangle. Then we will show how the algorithm of the Chaos Game can be expanded to work with non-uniform affine transformations (for generating the Barnsley fern) and to include transformations with rotations (for creating dragon curves). We also consider fractals created with different numbers of reference points <inline-formula><mml:math display="inline"></mml:math></inline-formula></p>
        <p>(</p>
        <p>n=3,4,6,8</p>
        <p>)</p>
        <p>, including fractals associated with the Sierpinski carpet.</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>Fractals</kwd>
        <kwd>Chaos Game</kwd>
        <kwd>Iterated Function Systems</kwd>
        <kwd>Sierpinski Triangle</kwd>
        <kwd>Barnsley Fern</kwd>
        <kwd>Collage Theorem</kwd>
        <kwd>Dragon Curve</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>Over the past several decades, a field of mathematics broadly known as non-linear dynamics, or the theory of chaotic dynamical systems, has developed around the study of complex curves called fractals. These objects are, in a precise mathematical sense, infinitely detailed: successive magnification of any region reveals structure that never resolves into simplicity. Fractals entered popular scientific awareness largely through expository articles such as those of A. K. Dewdney in Scientific American, which made the subject accessible beyond specialist mathematical audiences [<xref ref-type="bibr" rid="B1">1</xref>].</p>
      <p>There is a deep structural link between fractals and chaos: both arise from iterated functions, in which the state produced by one iteration becomes the input to the next. Some chaotic systems, such as bifurcation diagrams, display exact self-similarity under magnification, while other, more asymmetric fractals can appear visually irregular even though they retain a well-defined self-similar structure. A common feature of chaotic iteration is unpredictability at the level of an individual step: the value produced by a specific iteration cannot, in general, be anticipated without explicitly computing every preceding iteration. In this sense, fractals may be described as a form of ordered, or “beautiful,” chaos -globally structured, yet locally unpredictable.</p>
      <p>Theoretical investigation of IFS has its roots in the seminal work of Hutchinson on self-similarity and contraction mappings [<xref ref-type="bibr" rid="B2">2</xref>] that later became widely known due to Barnsley’s geometric formulation of IFS and the collage theorem [<xref ref-type="bibr" rid="B3">3</xref>] as well as its placement into the context of the fractal geometry program developed by Mandelbrot [<xref ref-type="bibr" rid="B4">4</xref>], Falconer [<xref ref-type="bibr" rid="B5">5</xref>], and in expository works such as [<xref ref-type="bibr" rid="B1">1</xref>] [<xref ref-type="bibr" rid="B6">6</xref>]. Continuing this line of research, recent investigations have been carried out in the following directions: algorithmic and probabilistic analysis of chaos game and convergence issues, involving both classical chaos game and its generalizations (standard and disjunctive) along with fuzzy IFS [<xref ref-type="bibr" rid="B7">7</xref>]-[<xref ref-type="bibr" rid="B9">9</xref>]; quantitative research of contraction ratios and fractal dimension for special families of attractors including Sierpinski n-gons, fractal functions in function spaces, and continued-fraction sets [<xref ref-type="bibr" rid="B10">10</xref>]-[<xref ref-type="bibr" rid="B12">12</xref>]; extension of the classical Hutchinson-Barnsley scheme onto arbitrary shift spaces, multivalued mappings in neutrosophic metric spaces, and unifying fractal interpolation schemes [<xref ref-type="bibr" rid="B13">13</xref>]-[<xref ref-type="bibr" rid="B15">15</xref>]; advances in multifractal analysis of inhomogeneous measures under the action of non-doubling projections [<xref ref-type="bibr" rid="B16">16</xref>]; application of fractal and fractional descriptors in modeling of material microstructure [<xref ref-type="bibr" rid="B17">17</xref>]. A fractal is a mathematically created geometric figure that displays scale invariance: rising into or out of any segment reproduces a structure identical or fundamentally similar to the unique whole [<xref ref-type="bibr" rid="B18">18</xref>]. The overall trend of recent research is that of a transition from geometric to computational, probabilistic, and abstract generalization aspects of IFS theory.</p>
      <p>Thus, justifying the choice of focus for this research, this paper examines one particular route from randomness to structure: the Chaos Game, and its formalisation as the attractor of an Iterated Function System (IFS). Section 2 introduces the Chaos Game and its classical three-point realisation. Section 3 develops the necessary mathematical framework of IFS theory. Section 4 states Barnsley’s Collage Theorem, which explains why the Chaos Game works. Section 5 describes representative computational implementations. Section 6 presents results and discussion, including the Barnsley fern, the dragon curve, and a generalised n-point Chaos Game, and Section 7 concludes.</p>
    </sec>
    <sec id="sec2">
      <title>2. The Chaos Game</title>
      <p>Chaos Game Illustration assists as a powerful method for transforming linear sequence data into revealing visual patterns [<xref ref-type="bibr" rid="B19">19</xref>]. The Chaos Game is an algorithm that produces images of fractal structures using nothing more than paper and pencil or, more practically, a computer. The term was coined by the mathematician Michael Barnsley [<xref ref-type="bibr" rid="B3">3</xref>]. Notably, the relationship between the random, game-like procedure and the highly structured fractal image it produces is not obvious from the rules alone; there is no evident a priori connection between the two. This element of surprise is part of what makes the result mathematically interesting.</p>
      <sec id="sec2dot1">
        <title>Classical Procedure</title>
        <p>In its simplest form, the Chaos Game proceeds as follows. Three points (vertices of a triangle) are fixed in the plane, and an arbitrary starting point is chosen. On each iteration, one of the three vertices is selected at random (for example, by rolling a die and mapping the result onto the three vertices), and the current point is replaced by the midpoint between itself and the selected vertex. This process is then repeated many times.</p>
        <p>Intuitively, one might expect that this procedure, repeated indefinitely, would produce a triangle filled uniformly with random dots. This is not the case. When the Chaos Game is implemented on a computer using a pseudo-random number generator for the vertex selection and run for several thousand iterations, the resulting point cloud is not uniform at all: it converges to the well-known Sierpinski triangle (<xref ref-type="fig" rid="fig1">Figure 1</xref>), named after the mathematician Wacław Sierpiński, who first described the set.</p>
        <fig id="fig1">
          <label>Figure 1</label>
          <caption>
            <p>The attractor produced by the classical three-point Chaos Game: The Sierpinski triangle.</p>
          </caption>
          <graphic xlink:href="https://html.scirp.org/file/1724925-rId17.jpeg?20261119011945" />
        </fig>
      </sec>
    </sec>
    <sec id="sec3">
      <title>3. Mathematical Formalism: Iterated Function Systems</title>
      <p>Barnsley’s Chaos Game exploits the self-similar structure of fractals by using a random walk procedure to plot points of the attractor of a given Iterated Function System (IFS). To make this precise, we require the following definitions.</p>
      <sec id="sec3dot1">
        <title>3.1. Iterated Function Systems</title>
        <p>We restrict attention to affine iterated function systems. An iterated function system (IFS) <italic>M</italic> on a complete metric space <inline-formula><mml:math display="inline"><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> X </mml:mi><mml:mo> , </mml:mo><mml:mi> d </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> where <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> X </mml:mi><mml:mo> = </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mn> 2 </mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> d </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> x </mml:mi><mml:mo> , </mml:mo><mml:mi> y </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo> ‖ </mml:mo><mml:mrow><mml:mi> x </mml:mi><mml:mo> − </mml:mo><mml:mi> y </mml:mi></mml:mrow><mml:mo> ‖ </mml:mo></mml:mrow></mml:mrow><mml:mn> 2 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is the Euclidean distance, is a finite set of affine contraction map pings <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> M </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> f </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> f </mml:mi><mml:mi> N </mml:mi></mml:msub></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> : </mml:mo><mml:mi> X </mml:mi><mml:mo> → </mml:mo><mml:mi> X </mml:mi></mml:mrow></mml:math></inline-formula> . Each mapping takes the affine form <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> x </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:msub><mml:mi> A </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mi> x </mml:mi><mml:mo> + </mml:mo><mml:msub><mml:mi> b </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , where <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mrow><mml:mn> 2 </mml:mn><mml:mo> × </mml:mo><mml:mn> 2 </mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> b </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mn> 2 </mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> . The map <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is a contraction with respect to <inline-formula><mml:math display="inline"><mml:mi> d </mml:mi></mml:math></inline-formula> if the eigenvalues <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> λ </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mo> , </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> λ </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mo> , </mml:mo><mml:mn> 2 </mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> of <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> A </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> satisfy <inline-formula><mml:math display="inline"><mml:mrow><mml:mrow><mml:mo> | </mml:mo><mml:mrow><mml:msub><mml:mi> λ </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mo> , </mml:mo><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> | </mml:mo></mml:mrow><mml:mo> &lt; </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> for <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> j </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn><mml:mo> , </mml:mo><mml:mn> 2 </mml:mn></mml:mrow></mml:math></inline-formula> ensuring that every <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> strictly contracts distances.</p>
      </sec>
      <sec id="sec3dot2">
        <title>3.2. The Attractor of an Iterated Function System</title>
        <p>The term attractor is reserved exclusively for the unique non-empty compact set <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> A </mml:mi><mml:mo> ⊂ </mml:mo><mml:mi> X </mml:mi></mml:mrow></mml:math></inline-formula> invariant under <inline-formula><mml:math display="inline"><mml:mi> M </mml:mi></mml:math></inline-formula> , satisfying <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> A </mml:mi><mml:mo> = </mml:mo><mml:mstyle displaystyle="true"><mml:munderover><mml:mo> ∪ </mml:mo><mml:mrow><mml:mi> i </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow><mml:mi> N </mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> A </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:mstyle></mml:mrow></mml:math></inline-formula> . Any finite set of points used to seed or generate an approximation of <inline-formula><mml:math display="inline"><mml:mi> A </mml:mi></mml:math></inline-formula> should be referred to as reference vertices or seed points, not as the attractor.</p>
      </sec>
      <sec id="sec3dot3">
        <title>3.3. The Chaos Game: Precise Statement</title>
        <p>Let <inline-formula><mml:math display="inline"><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> X </mml:mi><mml:mo> , </mml:mo><mml:mi> d </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> be a compact metric space (here <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> X </mml:mi><mml:mo> ⊂ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mn> 2 </mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> is a compact set with <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> X </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> ⊂ </mml:mo><mml:mi> X </mml:mi></mml:mrow></mml:math></inline-formula> ). Let <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mi> N </mml:mi></mml:msub><mml:mo> : </mml:mo><mml:mi> X </mml:mi><mml:mo> → </mml:mo><mml:mi> X </mml:mi></mml:mrow></mml:math></inline-formula> be contractions with Lipschitz constants <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> r </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> ≤ </mml:mo><mml:mi> r </mml:mi><mml:mo> &lt; </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> . Let <inline-formula><mml:math display="inline"><mml:mi> A </mml:mi></mml:math></inline-formula> be the attractor, <italic>i.e.</italic> the unique non empty compact set with <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> A </mml:mi><mml:mo> = </mml:mo><mml:mstyle displaystyle="true"><mml:msub><mml:mo> ∪ </mml:mo><mml:mi> i </mml:mi></mml:msub><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> A </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:mstyle></mml:mrow></mml:math></inline-formula> .</p>
        <p>(H1) Contractivity. Each <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is a contraction, as above.</p>
        <p>(H2) Map selection. The indices <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> σ </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> σ </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> ∈ </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> , </mml:mo><mml:mn> 2 </mml:mn><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:mi> N </mml:mi></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> are independent and identically distributed, independent of <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mn> 0 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> , with <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> σ </mml:mi><mml:mi> n </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:mi> i </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:msub><mml:mi> p </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> &gt; </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> for every <inline-formula><mml:math display="inline"><mml:mi> i </mml:mi></mml:math></inline-formula> , <inline-formula><mml:math display="inline"><mml:mrow><mml:mstyle displaystyle="true"><mml:msub><mml:mo> ∑ </mml:mo><mml:mi> i </mml:mi></mml:msub><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:mstyle></mml:mrow></mml:math></inline-formula> .</p>
        <p>The chaos game is <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> n </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mrow><mml:msub><mml:mi> σ </mml:mi><mml:mi> n </mml:mi></mml:msub></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> n </mml:mi><mml:mo> − </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mrow><mml:msub><mml:mi> σ </mml:mi><mml:mi> n </mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo> ∘ </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> ∘ </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mrow><mml:msub><mml:mi> σ </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mn> 0 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> .</p>
        <p>Let <inline-formula><mml:math display="inline"><mml:mi> μ </mml:mi></mml:math></inline-formula> be the unique Borel probability measure with <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> μ </mml:mi><mml:mo> = </mml:mo><mml:mstyle displaystyle="true"><mml:msub><mml:mo> ∑ </mml:mo><mml:mi> i </mml:mi></mml:msub><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:mstyle><mml:mo> # </mml:mo><mml:mi> μ </mml:mi></mml:mrow></mml:math></inline-formula> . It is supported on <inline-formula><mml:math display="inline"><mml:mi> A </mml:mi></mml:math></inline-formula> . Note that <inline-formula><mml:math display="inline"><mml:mi> A </mml:mi></mml:math></inline-formula> depends only on the maps, while <inline-formula><mml:math display="inline"><mml:mi> μ </mml:mi></mml:math></inline-formula> also depends on <inline-formula><mml:math display="inline"><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> .</p>
        <p><bold>Theorem</bold></p>
        <p>Assume (H1) and (H2). Then for every starting point <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mn> 0 </mml:mn></mml:msub><mml:mo> ∈ </mml:mo><mml:mi> X </mml:mi></mml:mrow></mml:math></inline-formula> : </p>
        <p><bold>a) Convergence of the sampled points (forgetting and attraction).</bold></p>
        <p>For every realization <inline-formula><mml:math display="inline"><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> σ </mml:mi><mml:mi> n </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and any two starting points <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mn> 0 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> y </mml:mi><mml:mn> 0 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> ,</p>
        <disp-formula id="FD1">
          <mml:math display="inline">
            <mml:mrow>
              <mml:mi>d</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>x</mml:mi>
                    <mml:mi>n</mml:mi>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mi>y</mml:mi>
                    <mml:mi>n</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>≤</mml:mo>
              <mml:msup>
                <mml:mi>r</mml:mi>
                <mml:mi>n</mml:mi>
              </mml:msup>
              <mml:mi>d</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>x</mml:mi>
                    <mml:mn>0</mml:mn>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mi>y</mml:mi>
                    <mml:mn>0</mml:mn>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>.</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Moreover, <inline-formula><mml:math display="inline"><mml:mrow><mml:mtext> dist </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> n </mml:mi></mml:msub><mml:mo> , </mml:mo><mml:mi> A </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> ≤ </mml:mo><mml:msup><mml:mi> r </mml:mi><mml:mi> n </mml:mi></mml:msup><mml:mtext> dist </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mn> 0 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:mi> A </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , and if <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mn> 0 </mml:mn></mml:msub><mml:mo> ∈ </mml:mo><mml:mi> A </mml:mi></mml:mrow></mml:math></inline-formula> then <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> n </mml:mi></mml:msub><mml:mo> ∈ </mml:mo><mml:mi> A </mml:mi></mml:mrow></mml:math></inline-formula> for all <inline-formula><mml:math display="inline"><mml:mi> n </mml:mi></mml:math></inline-formula> . Also, the law of <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> n </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> converges to <inline-formula><mml:math display="inline"><mml:mi> μ </mml:mi></mml:math></inline-formula> in Wasserstein distance: <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> W </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mtext> Law </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> n </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> , </mml:mo><mml:mi> μ </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> ≤ </mml:mo><mml:msup><mml:mi> r </mml:mi><mml:mi> n </mml:mi></mml:msup><mml:mstyle displaystyle="true"><mml:mrow><mml:mo> ∫ </mml:mo><mml:mrow><mml:mi> d </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mn> 0 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:mi> y </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mtext> d </mml:mtext><mml:mi> μ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> y </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mstyle></mml:mrow></mml:math></inline-formula> .</p>
        <p><bold>b) Orbit density (topological statement).</bold></p>
        <p>Almost surely, the set of accumulation points of <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> n </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is <inline-formula><mml:math display="inline"><mml:mi> A </mml:mi></mml:math></inline-formula> . Equivalently, for every <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> a </mml:mi><mml:mo> ∈ </mml:mo><mml:mi> A </mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> ε </mml:mi><mml:mo> &gt; </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> n </mml:mi></mml:msub><mml:mo> ∈ </mml:mo><mml:mi> B </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> a </mml:mi><mml:mo> , </mml:mo><mml:mi> ε </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> for infinitely many n. In particular, if <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mn> 0 </mml:mn></mml:msub><mml:mo> ∈ </mml:mo><mml:mi> A </mml:mi></mml:mrow></mml:math></inline-formula> then <inline-formula><mml:math display="inline"><mml:mrow><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> n </mml:mi></mml:msub></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is dense in <inline-formula><mml:math display="inline"><mml:mi> A </mml:mi></mml:math></inline-formula> almost surely. </p>
        <p><bold>c) Convergence of the sampled measure (statistical statement).</bold></p>
        <p>Let <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> v </mml:mi><mml:mi> n </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:mfrac><mml:mn> 1 </mml:mn><mml:mi> n </mml:mi></mml:mfrac><mml:mstyle displaystyle="true"><mml:msubsup><mml:mo> ∑ </mml:mo><mml:mrow><mml:mi> k </mml:mi><mml:mo> = </mml:mo><mml:mn> 0 </mml:mn></mml:mrow><mml:mrow><mml:mi> n </mml:mi><mml:mo> − </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msubsup><mml:mrow><mml:msub><mml:mi> δ </mml:mi><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> k </mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mstyle></mml:mrow></mml:math></inline-formula> . Almost surely, <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> v </mml:mi><mml:mi> n </mml:mi></mml:msub><mml:mo> → </mml:mo><mml:mi> μ </mml:mi></mml:mrow></mml:math></inline-formula> weakly, <italic>i.e.</italic><inline-formula><mml:math display="inline"><mml:mrow><mml:mfrac><mml:mn> 1 </mml:mn><mml:mi> n </mml:mi></mml:mfrac><mml:mstyle displaystyle="true"><mml:munderover><mml:mo> ∑ </mml:mo><mml:mrow><mml:mi> k </mml:mi><mml:mo> = </mml:mo><mml:mn> 0 </mml:mn></mml:mrow><mml:mrow><mml:mi> n </mml:mi><mml:mo> − </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:munderover><mml:mrow><mml:mi> f </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> k </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:mstyle><mml:mo> → </mml:mo><mml:mstyle displaystyle="true"><mml:mrow><mml:mo> ∫ </mml:mo><mml:mrow><mml:mi> f </mml:mi><mml:mtext>   </mml:mtext><mml:mtext> d </mml:mtext><mml:mi> μ </mml:mi></mml:mrow></mml:mrow></mml:mstyle></mml:mrow></mml:math></inline-formula> for all continuous <inline-formula><mml:math display="inline"><mml:mi> f </mml:mi></mml:math></inline-formula> .</p>
      </sec>
    </sec>
    <sec id="sec4">
      <title>4. Barnsley’s Collage Theorem</title>
      <p>The Chaos Game solves the forward problem: given an IFS, find (a picture of) its attractor. Barnsley’s Collage Theorem addresses the inverse problem: given a target image, find an IFS whose attractor approximates it.</p>
      <sec id="sec4dot1">
        <title>4.1. Theorem (The Collage Theorem)</title>
        <p>Let <inline-formula><mml:math display="inline"><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> X </mml:mi><mml:mo> , </mml:mo><mml:mi> d </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> be a complete metric space, and let <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> H </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> X </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> be the space of nonempty compact subsets of <inline-formula><mml:math display="inline"><mml:mi> X </mml:mi></mml:math></inline-formula> , equipped with the Hausdorff metric <inline-formula><mml:math display="inline"><mml:mi> h </mml:mi></mml:math></inline-formula> . Consider a finite iterated function system <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> M </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> w </mml:mi><mml:mi> N </mml:mi></mml:msub></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and its Hutchinson operator</p>
        <disp-formula id="FD2">
          <mml:math display="inline">
            <mml:mrow>
              <mml:mi>W</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>B</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mstyle displaystyle="true">
                <mml:munderover>
                  <mml:mo>∪</mml:mo>
                  <mml:mrow>
                    <mml:mi>i</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                  <mml:mi>N</mml:mi>
                </mml:munderover>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>w</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
              </mml:mstyle>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>B</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>.</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Suppose <inline-formula><mml:math display="inline"><mml:mi> W </mml:mi></mml:math></inline-formula> is contractive with factor <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> s </mml:mi><mml:mo> ∈ </mml:mo><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:mn> 0 </mml:mn><mml:mo> , </mml:mo><mml:mn> 1 </mml:mn></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , meaning</p>
        <disp-formula id="FD3">
          <mml:math display="inline">
            <mml:mrow>
              <mml:mi>h</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>W</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>B</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>,</mml:mo>
                  <mml:mi>W</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>C</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>≤</mml:mo>
              <mml:mi>s</mml:mi>
              <mml:mi>h</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>B</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>C</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>for</mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>all</mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mi>B</mml:mi>
              <mml:mo>,</mml:mo>
              <mml:mi>C</mml:mi>
              <mml:mo>∈</mml:mo>
              <mml:mi>H</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>X</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>.</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>For example, if the maps <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> have Lipchitz constants <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> s </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> &lt; </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> , one may take <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> s </mml:mi><mml:mo> = </mml:mo><mml:msub><mml:mrow><mml:mi> max </mml:mi></mml:mrow><mml:mi> i </mml:mi></mml:msub><mml:msub><mml:mi> s </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> .</p>
        <p>Let <inline-formula><mml:math display="inline"><mml:mi> A </mml:mi></mml:math></inline-formula> be the unique attractor satisfying <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> W </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> A </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mi> A </mml:mi></mml:mrow></mml:math></inline-formula> . Then, for every target set <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> L </mml:mi><mml:mo> ∈ </mml:mo><mml:mi> H </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> X </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> h </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> L </mml:mi><mml:mo> , </mml:mo><mml:mi> A </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> ≤ </mml:mo><mml:mfrac><mml:mrow><mml:mi> h </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> L </mml:mi><mml:mo> , </mml:mo><mml:mi> W </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> L </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> − </mml:mo><mml:mi> s </mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:math></inline-formula> .</p>
        <p>Consequently, if the collage error satisfies <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> h </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> L </mml:mi><mml:mo> , </mml:mo><mml:mi> W </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> L </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> ≤ </mml:mo><mml:mi> ε </mml:mi></mml:mrow></mml:math></inline-formula> , then <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> h </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> L </mml:mi><mml:mo> , </mml:mo><mml:mi> A </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> ≤ </mml:mo><mml:mfrac><mml:mi> ε </mml:mi><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> − </mml:mo><mml:mi> s </mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:math></inline-formula> .</p>
        <p>To guarantee an attractor approximation error of at most<inline-formula><mml:math display="inline"><mml:mi> δ </mml:mi></mml:math></inline-formula> , it therefore suffices to require <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> h </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> L </mml:mi><mml:mo> , </mml:mo><mml:mi> W </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> L </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> ≤ </mml:mo><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> − </mml:mo><mml:mi> s </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mi> δ </mml:mi></mml:mrow></mml:math></inline-formula> .</p>
      </sec>
      <sec id="sec4dot2">
        <title>4.2. Illustrative Example: The Sierpinski Triangle as a Collage</title>
        <p>The Sierpinski triangle provides the simplest non-trivial illustration of the Collage Theorem. Placing a vertex of the triangle at the origin, the triangle can be exactly tiled by three smaller copies of itself, each scaled by a factor of one-half and positioned at each of the three corners (<xref ref-type="fig" rid="fig2">Figure 2</xref>). Each of the three smaller triangles has exactly half the vertical and horizontal extent of the whole. Reading these three placements directly as the three affine contraction maps of an IFS reproduces exactly the classical three-point Chaos Game of Section 2, now derived rigorously from the collage geometry of the target shape rather than assumed ad hoc.</p>
        <fig id="fig2">
          <label>Figure 2</label>
          <caption>
            <p>The Sierpinski triangle as a self-tiling collage of three half-scale copies of itself, illustrating the Collage Theorem.</p>
          </caption>
          <graphic xlink:href="https://html.scirp.org/file/1724925-rId184.jpeg?20261119011948" />
          <graphic xlink:href="https://html.scirp.org/file/1724925-rId185.jpeg?20261119011948" />
          <p>(a) (b)</p>
        </fig>
      </sec>
    </sec>
    <sec id="sec5">
      <title>5. Computational Implementation</title>
      <p>The Chaos Game was implemented in MATLAB. The program proceeds in three stages: (i) initialise the set of reference vertices and a starting point; (ii) repeatedly select a vertex at random, with all vertices equally likely and each selection independent of the previous ones, and move the current point <inline-formula><mml:math display="inline"><mml:mi> x </mml:mi></mml:math></inline-formula> to <inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mi> x </mml:mi><mml:mo> ′ </mml:mo></mml:msup><mml:mo> = </mml:mo><mml:mi> r </mml:mi><mml:mo> ⋅ </mml:mo><mml:mi> x </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> − </mml:mo><mml:mi> r </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> ⋅ </mml:mo><mml:msub><mml:mi> v </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> where <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> v </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the selected vertex and <inline-formula><mml:math display="inline"><mml:mi> r </mml:mi></mml:math></inline-formula> is the contraction ratio (<inline-formula><mml:math display="inline"><mml:mrow><mml:mi> r </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> / </mml:mo><mml:mn> 2 </mml:mn></mml:mrow></mml:mrow></mml:math></inline-formula> gives the midpoint rule of the Sierpinski triangle; other values of <inline-formula><mml:math display="inline"><mml:mi> r </mml:mi></mml:math></inline-formula> are used in Section 6); (iii) plot the accumulated set of points. For the Barnsley fern and the dragon curve, step (ii) instead applies one of the affine maps given in Section 6, chosen independently with the stated probabilities.</p>
      <p>The program does not use graphical animation: all retained points are plotted once the iteration loop has completed, and the number of iterations is supplied interactively by the user. The implementation was validated by checking that, for <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> n </mml:mi><mml:mo> = </mml:mo><mml:mn> 3 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> r </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> / </mml:mo><mml:mn> 2 </mml:mn></mml:mrow></mml:mrow></mml:math></inline-formula> , the output reproduces the Sierpinski triangle. It was then extended to the more general cases discussed in Section 6.</p>
    </sec>
    <sec id="sec6">
      <title>6. Results and Discussion</title>
      <sec id="sec6dot1">
        <title>6.1. Chaos Game Output for the Sierpinski Triangle</title>
        <p><xref ref-type="fig" rid="fig3">Figure 3</xref> illustrates the progressive formation of the Sierpinski triangle generated via the iterative Chaos Game algorithm (<inline-formula><mml:math display="inline"><mml:mrow><mml:mi> n </mml:mi><mml:mo> = </mml:mo><mml:mn> 3 </mml:mn></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> r </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> / </mml:mo><mml:mn> 2 </mml:mn></mml:mrow></mml:mrow></mml:math></inline-formula> ), demonstrating the emergence of deterministic fractal structure from an underlying stochastic process. Beginning with <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> n </mml:mi><mml:mo> = </mml:mo><mml:mn> 3 </mml:mn></mml:mrow></mml:math></inline-formula> fixed corner vertices that define a triangle, an initial point is iteratively moved half the distance toward a randomly selected vertex at each step. The sequence captures the transition from an early phase characterized by a sparse point distribution after <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> N </mml:mi><mml:mo> ≈ </mml:mo><mml:mn> 500 </mml:mn></mml:mrow></mml:math></inline-formula> iterations (<xref ref-type="fig" rid="fig3">Figure 3(a)</xref>) to an intermediate phase where sub-triangular clusters and inverted void regions emerge (<inline-formula><mml:math display="inline"><mml:mrow><mml:mi> N </mml:mi><mml:mo> ≈ </mml:mo><mml:mn> 2500 </mml:mn></mml:mrow></mml:math></inline-formula> ; <xref ref-type="fig" rid="fig3">Figure 3(b)</xref>), culminating in a dense, highly detailed representation of the self-similar attractor after <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> N </mml:mi><mml:mo> ≥ </mml:mo><mml:mn> 10000 </mml:mn></mml:mrow></mml:math></inline-formula> iterations (<xref ref-type="fig" rid="fig3">Figure 3(c)</xref>).</p>
        <fig id="fig3">
          <label>Figure 3</label>
          <caption>
            <p>Sequential formation of the Sierpinski triangle fractal via the Chaos Game algorithm.</p>
          </caption>
          <graphic xlink:href="https://html.scirp.org/file/1724925-rId212.jpeg?20261119011949" />
          <p>(a)</p>
          <graphic xlink:href="https://html.scirp.org/file/1724925-rId213.jpeg?20261119011949" />
          <graphic xlink:href="https://html.scirp.org/file/1724925-rId214.jpeg?20261119011949" />
          <p>(b) (c)</p>
        </fig>
      </sec>
      <sec id="sec6dot2">
        <title>6.2. The Barnsley Fern</title>
        <p>The Barnsley fern is the attractor of a four-map affine IFS. In the Sierpinski triangle all maps are chosen with equal probability, but here each map is assigned a different selection probability. One map (probability about 1%) generates the central stem. The remaining maps generate the main frond and the successively smaller left- and right-leaning leaflets, each contracted and rotated by a different affine transformation (<xref ref-type="fig" rid="fig4">Figure 4</xref>). </p>
        <p>The affine maps determine the geometric attractor, that is, the shape of the fern. As long as every <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> &gt; </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> , any choice of probabilities yields the same set. The selection probabilities, by contrast, determine the sampled invariant measure, which governs how many points land in each part of the fern and therefore how dense it looks in the plot. The values 0.01, 0.85, 0.07, 0.07 are Barnsley’s standard empirical choice, which makes the fern clearly visible with reasonably even density after relatively few points. They are not derived from the maps’ relative area contraction (<xref ref-type="fig" rid="fig5">Figure 5</xref>).</p>
        <fig id="fig4">
          <label>Figure 4</label>
          <caption>
            <p>The Barnsley fern, the attractor of a four-map affine iterated function system.</p>
          </caption>
          <graphic xlink:href="https://html.scirp.org/file/1724925-rId217.jpeg?20261119011949" />
        </fig>
        <fig id="fig5">
          <label>Figure 5</label>
          <caption>
            <p>The Barnsley fern rendered by the Chaos Game with non-uniform map-selection probabilities weighted by relative contraction area.</p>
          </caption>
          <graphic xlink:href="https://html.scirp.org/file/1724925-rId218.jpeg?20261119011949" />
        </fig>
      </sec>
      <sec id="sec6dot3">
        <title>6.3. The Dragon Curve: Introducing Rotation</title>
        <p>The dragon curve fractal extends the Chaos Game to an IFS whose maps combine contraction with rotation (see <xref ref-type="fig" rid="fig6">Figure 6</xref>). The dragon curve is composed of two smaller copies of itself, but unlike the Sierpinski triangle, these copies are related to the whole not merely by scaling and translation but also by a rotation. Each copy is obtained by rotating the curve through a fixed angle <italic>θ</italic> about the origin, contracting it by a factor of <inline-formula><mml:math display="inline"><mml:mrow><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> / </mml:mo><mml:mrow><mml:msqrt><mml:mn> 2 </mml:mn></mml:msqrt></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> , and applying a horizontal offset of +1 or −1 to obtain the two respective smaller curves. The corresponding rotation matrix follows directly from elementary linear algebra. Equal selection probabilities (<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:msub><mml:mi> p </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 0.5 </mml:mn></mml:mrow></mml:math></inline-formula> ) are assigned to the two affine maps. </p>
        <fig id="fig6">
          <label>Figure 6</label>
          <caption>
            <p>The dragon curve, the attractor of a two-map iterated function system incorporating rotation.</p>
          </caption>
          <graphic xlink:href="https://html.scirp.org/file/1724925-rId223.jpeg?20261119011949" />
        </fig>
        <p>As the Chaos Game plots the orbit of this two-map IFS, the dragon curve gradually emerges (<xref ref-type="fig" rid="fig7">Figure 7</xref>); points are naturally colourable according to which of the two affine maps was selected at each step, visually distinguishing the two self-similar halves of the curve [<xref ref-type="bibr" rid="B6">6</xref>].</p>
        <fig id="fig7">
          <label>Figure 7</label>
          <caption>
            <p>The Chaos Game plotting the dragon curve; the left panel colours points by the affine map selected at each iteration, while the centre and right panels show the same attractor in a single colour at increasing iteration counts.</p>
          </caption>
          <graphic xlink:href="https://html.scirp.org/file/1724925-rId224.jpeg?20261119011949" />
        </fig>
      </sec>
      <sec id="sec6dot4">
        <title>6.4. A Generalised n-Point Chaos Game</title>
        <p><xref ref-type="fig" rid="fig8">Figure 8</xref> demonstrates the structural dependence of the Iterated Function System (IFS) attractor on the contraction ratio <inline-formula><mml:math display="inline"><mml:mi> r </mml:mi></mml:math></inline-formula> for an <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> n </mml:mi><mml:mo> = </mml:mo><mml:mn> 3 </mml:mn></mml:mrow></mml:math></inline-formula> vertex system. In <bold>Panel A</bold>, applying a scaling factor <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> r </mml:mi><mml:mo> &lt; </mml:mo><mml:mn> 0.5 </mml:mn></mml:mrow></mml:math></inline-formula> results in a disconnected fractal structure consisting of isolated, self-similar triangular clusters separated by clear voids. Conversely, in <bold>Panel B</bold>, increasing the contraction factor to <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> r </mml:mi><mml:mo> &gt; </mml:mo><mml:mn> 0.5 </mml:mn></mml:mrow></mml:math></inline-formula> causes the sub-attractor regions corresponding to each vertex (color-coded red, green, and blue) to overlap, yielding a denser, continuous triangular distribution with overlapping sub-structures.</p>
        <fig id="fig8">
          <label>Figure 8</label>
          <caption>
            <p>Chaos game attractors for <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> n </mml:mi><mml:mo> = </mml:mo><mml:mn> 3 </mml:mn></mml:mrow></mml:math></inline-formula> reference vertices after <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> N </mml:mi><mml:mo> = </mml:mo><mml:mn> 50000 </mml:mn></mml:mrow></mml:math></inline-formula> iterations under two different parameter settings: (a) a disconnected Cantor-like fractal formed with a reduced scaling factor ( <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> r </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.38 </mml:mn><mml:mo> &lt; </mml:mo><mml:mn> 0.5 </mml:mn></mml:mrow></mml:math></inline-formula> ), and (b) an overlapping continuous attractor generated with an increased scaling factor <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> r </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.62 </mml:mn><mml:mo> &gt; </mml:mo><mml:mn> 0.5 </mml:mn></mml:mrow></mml:math></inline-formula> ).</p>
          </caption>
          <graphic xlink:href="https://html.scirp.org/file/1724925-rId233.jpeg?20261119011950" />
        </fig>
        <p><xref ref-type="fig" rid="fig9">Figure 9(a)</xref> illustrates Chaos Game attractors for <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> n </mml:mi><mml:mo> = </mml:mo><mml:mn> 4 </mml:mn></mml:mrow></mml:math></inline-formula> reference vertices using a contraction factor of <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> r </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.5 </mml:mn></mml:mrow></mml:math></inline-formula> . In <bold>Panel A</bold>, placing the four vertices at the corners of a square with unrestricted random vertex selection results in a solid, space-filling square split into four equal quadrant regions (color-coded cyan, red, green, and blue). In <bold>Panel B</bold>, altering the vertex geometry to a trapezoidal layout reveals a complex fractal pattern with self-similar, triangular voids distributed across all four colored regions. </p>
        <p><xref ref-type="fig" rid="fig9">Figure 9(b)</xref> depicts the Sierpinski Carpet fractal attractor generated via an 8-transformation Chaos Game system (<inline-formula><mml:math display="inline"><mml:mrow><mml:mi> n </mml:mi><mml:mo> = </mml:mo><mml:mn> 8 </mml:mn></mml:mrow></mml:math></inline-formula> ) with a contraction factor of <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> r </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> / </mml:mo><mml:mn> 3 </mml:mn></mml:mrow></mml:mrow></mml:math></inline-formula> after <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> N </mml:mi><mml:mo> = </mml:mo><mml:mn> 50000 </mml:mn></mml:mrow></mml:math></inline-formula> iterations. The square domain is partitioned into a <inline-formula><mml:math display="inline"><mml:mrow><mml:mn> 3 </mml:mn><mml:mo> × </mml:mo><mml:mn> 3 </mml:mn></mml:mrow></mml:math></inline-formula> grid, where eight perimeter vertices/sub-regions are assigned as target maps, leaving the central square empty. Points are color-coded according to the chosen transformation at each step, clearly illustrating the eight self-similar, recursively perforated sub-carpets that collectively form the overall fractal structure.</p>
        <fig id="fig9">
          <label>Figure 9</label>
          <caption>
            <p>(a): Chaos Game attractors generated with <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> n </mml:mi><mml:mo> = </mml:mo><mml:mn> 4 </mml:mn></mml:mrow></mml:math></inline-formula> reference vertices and a contraction factor of <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> r </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.5 </mml:mn></mml:mrow></mml:math></inline-formula> after <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> N </mml:mi><mml:mo> = </mml:mo><mml:mn> 50000 </mml:mn></mml:mrow></mml:math></inline-formula> iterations. (b): Chaos Game generation of the Sierpinski Carpet fractal ( <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> n </mml:mi><mml:mo> = </mml:mo><mml:mn> 8 </mml:mn></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> r </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> / </mml:mo><mml:mn> 3 </mml:mn></mml:mrow></mml:mrow></mml:math></inline-formula> ) after <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> N </mml:mi><mml:mo> = </mml:mo><mml:mn> 50000 </mml:mn></mml:mrow></mml:math></inline-formula> iterations.</p>
          </caption>
          <graphic xlink:href="https://html.scirp.org/file/1724925-rId254.jpeg?20261119011950" />
        </fig>
        <p><xref ref-type="fig" rid="fig10">Figure 10</xref> depicts the Hexagasket fractal attractor generated via a 6-vertex Chaos Game algorithm (<inline-formula><mml:math display="inline"><mml:mrow><mml:mi> n </mml:mi><mml:mo> = </mml:mo><mml:mn> 6 </mml:mn></mml:mrow></mml:math></inline-formula> ) with a contraction scaling factor of <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> r </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> / </mml:mo><mml:mn> 3 </mml:mn></mml:mrow></mml:mrow></mml:math></inline-formula> after <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> N </mml:mi><mml:mo> = </mml:mo><mml:mn> 50000 </mml:mn></mml:mrow></mml:math></inline-formula> iterations. Positioning six reference vertices at the corners of a regular hexagon creates a ring of six self-similar sub-hexagons surrounding a central void. The six distinct colors (red, orange, magenta, cyan, green, and blue) delineate the attractor sub-regions corresponding to each target vertex, illustrating the recursive, self-similar structure at multiple spatial scales.</p>
        <fig id="fig10">
          <label>Figure 10</label>
          <caption>
            <p>Chaos Game generation of the Hexagasket fractal ( <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> n </mml:mi><mml:mo> = </mml:mo><mml:mn> 6 </mml:mn></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> r </mml:mi><mml:mo> = </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> / </mml:mo><mml:mn> 3 </mml:mn></mml:mrow></mml:mrow></mml:math></inline-formula> ) after <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> N </mml:mi><mml:mo> = </mml:mo><mml:mn> 50000 </mml:mn></mml:mrow></mml:math></inline-formula> iterations.</p>
          </caption>
          <graphic xlink:href="https://html.scirp.org/file/1724925-rId271.jpeg?20261119011950" />
        </fig>
      </sec>
    </sec>
    <sec id="sec7">
      <title>7. Conclusion</title>
      <p>In this article, the mathematics and computation underlying the Chaos Game have been unified into a rigorous treatment of the technique as a means of rendering IFS attractors. Beginning with Barnsley’s original construction using three points and its counter-intuitive emergence into the Sierpinski triangle, the formalism of complete metric spaces, affine contraction mappings, and attractors of IFSes was introduced and used to prove the convergence. In addition, it was shown that the Collage Theorem provides a method to construct an IFS that approximates a predetermined object via its attractor. The examples of using probability weights and adding rotation operations to affine mappings showed the power of the framework in its generality, whereas the generalized n-point Chaos Game allowed us to consider the classical Sierpinski carpet in terms of polygon-based attractors. Collectively, these findings reaffirm one of the main concepts of fractal geometry: namely, chaotic and unpredictable processes at the local level can produce highly deterministic and structured objects governed solely by a few contraction and probability parameters.</p>
      <p>Future work can proceed with the framework described here and calculate fractal dimensions numerically.</p>
    </sec>
    <sec id="sec8">
      <title>Author Contributions</title>
      <p>Conceptualization, R.A., S.A. and P.A.; methodology, R.A. and T.A.; software, R.A. and P.A.; validation, R.A., S.A. and T.A.; formal analysis, R.A. and S.A.; investigation, R.A.; resources, R.A.; data curation, R.A. and T.A.; writing—original draft preparation, R.A., S.A. and T.A.; writing—review and editing, R.A., and S.A.; visualization, S.A. and P.A.; supervision, P.A.; project administration, R.A.. All authors have read and agreed to the published version of the manuscript.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Dewdney, A.K. (1985) Computer Recreations Columns on Fractal Geometry. <italic>Scientific American</italic>, 253, 16-25.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Dewdney, A.K.</string-name>
            </person-group>
            <year>1985</year>
            <article-title>Computer Recreations Columns on Fractal Geometry</article-title>
            <source>Scientific American</source>
            <volume>253</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Hutchinson, J.E. (1981) Fractals and Self-Similarity. <italic>Indiana</italic><italic>University</italic><italic>Mathematics</italic><italic>Journal</italic>, 30, 713-747. https://doi.org/10.1512/iumj.1981.30.30055 <pub-id pub-id-type="doi">10.1512/iumj.1981.30.30055</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1512/iumj.1981.30.30055">https://doi.org/10.1512/iumj.1981.30.30055</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Hutchinson, J.E.</string-name>
            </person-group>
            <year>1981</year>
            <article-title>Fractals and Self-Similarity</article-title>
            <source>Indiana University Mathematics Journal</source>
            <volume>30</volume>
            <pub-id pub-id-type="doi">10.1512/iumj.1981.30.30055</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Barnsley, M.F., Rising, H. and Barnsley, M.F. (1993) Fractals Everywhere (Vol. 2). Academic Press.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Barnsley, M.F.</string-name>
              <string-name>Rising, H.</string-name>
              <string-name>Barnsley, M.F.</string-name>
            </person-group>
            <year>1993</year>
            <article-title>Fractals Everywhere (Vol</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Garg, A. and Negi, A. (2014) A Review on Natural Phenomenon of Fractal Geometry. <italic>International Journal of Computer Applications</italic>, 86, 1-7.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Garg, A.</string-name>
              <string-name>Negi, A.</string-name>
            </person-group>
            <year>2014</year>
            <article-title>A Review on Natural Phenomenon of Fractal Geometry</article-title>
            <source>International Journal of Computer Applications</source>
            <volume>86</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Falconer, K. (2013) Fractal Geometry: Mathematical Foundations and Applications. Wiley.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Falconer, K.</string-name>
            </person-group>
            <year>2013</year>
            <article-title>Fractal Geometry: Mathematical Foundations and Applications</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Peitgen, H.O., Jürgens, H., Saupe, D. and Feigenbaum, M.J. (2004) Chaos and Fractals: New Frontiers of Science. 2nd Edition, Springer.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Peitgen, H.O.</string-name>
              <string-name>Saupe, D.</string-name>
              <string-name>Feigenbaum, M.J.</string-name>
              <string-name>Edition, S</string-name>
            </person-group>
            <year>2004</year>
            <article-title>Chaos and Fractals: New Frontiers of Science</article-title>
            <source>2nd Edition</source>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Kolenda, M., Strobin, F. and Wiśniewski, K. (2025) Chaos Game Algorithm for Fuzzy Iterated Function Systems. <italic>Fuzzy Sets and Systems</italic>, 500, Article 109173. https://doi.org/10.1016/j.fss.2024.109173 <pub-id pub-id-type="doi">10.1016/j.fss.2024.109173</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.fss.2024.109173">https://doi.org/10.1016/j.fss.2024.109173</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Kolenda, M.</string-name>
              <string-name>Strobin, F.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Chaos Game Algorithm for Fuzzy Iterated Function Systems</article-title>
            <source>Fuzzy Sets and Systems</source>
            <volume>500</volume>
            <elocation-id>109173</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.fss.2024.109173</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Leśniak, K., Snigireva, N. and Strobin, F. (2022) Rate of Convergence in the Disjunctive Chaos Game Algorithm. <italic>Chaos</italic>: <italic>An Interdisciplinary Journal of Nonlinear Science</italic>, 32, Article 013107. https://doi.org/10.1063/5.0076743 <pub-id pub-id-type="doi">10.1063/5.0076743</pub-id><pub-id pub-id-type="pmid">35105112</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1063/5.0076743">https://doi.org/10.1063/5.0076743</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Snigireva, N.</string-name>
              <string-name>Strobin, F.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Rate of Convergence in the Disjunctive Chaos Game Algorithm</article-title>
            <source>Chaos: An Interdisciplinary Journal of Nonlinear Science</source>
            <volume>32</volume>
            <elocation-id>013107</elocation-id>
            <pub-id pub-id-type="doi">10.1063/5.0076743</pub-id>
            <pub-id pub-id-type="pmid">35105112</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Morris, I.D. and Jurga, N. (2021) How Long Is the Chaos Game? <italic>Bulletin of the London Mathematical Society</italic>, 53, 1749-1765. https://doi.org/10.1112/blms.12539 <pub-id pub-id-type="doi">10.1112/blms.12539</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1112/blms.12539">https://doi.org/10.1112/blms.12539</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Morris, I.D.</string-name>
              <string-name>Jurga, N.</string-name>
            </person-group>
            <year>2021</year>
            <article-title>How Long Is the Chaos Game? Bulletin of the London Mathematical Society, 53, 1749-1765</article-title>
            <pub-id pub-id-type="doi">10.1112/blms.12539</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Abdulaziz, A. and Said, J. (2021) On the Contraction Ratio of Iterated Function Systems Whose Attractors Are Sierpinski <italic>n</italic>-gons. <italic>Chaos</italic>, <italic>Solitons &amp; Fractals</italic>, 150, Article 111140. https://doi.org/10.1016/j.chaos.2021.111140 <pub-id pub-id-type="doi">10.1016/j.chaos.2021.111140</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.chaos.2021.111140">https://doi.org/10.1016/j.chaos.2021.111140</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Abdulaziz, A.</string-name>
              <string-name>Said, J.</string-name>
              <string-name>Chaos, S</string-name>
            </person-group>
            <year>2021</year>
            <article-title>On the Contraction Ratio of Iterated Function Systems Whose Attractors Are Sierpinski n-gons</article-title>
            <source>Chaos</source>
            <volume>150</volume>
            <elocation-id>111140</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.chaos.2021.111140</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B11">
        <label>11.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Chandra, S. and Abbas, S. (2022) On Fractal Dimensions of Fractal Functions Using Function Spaces. <italic>Bulletin</italic><italic>of</italic><italic>the</italic><italic>Australian</italic><italic>Mathematical</italic><italic>Society</italic>, 106, 470-480. https://doi.org/10.1017/s0004972722000685 <pub-id pub-id-type="doi">10.1017/s0004972722000685</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1017/s0004972722000685">https://doi.org/10.1017/s0004972722000685</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Chandra, S.</string-name>
              <string-name>Abbas, S.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>On Fractal Dimensions of Fractal Functions Using Function Spaces</article-title>
            <source>Bulletin of the Australian Mathematical Society</source>
            <volume>106</volume>
            <pub-id pub-id-type="doi">10.1017/s0004972722000685</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B12">
        <label>12.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Fang, L., Moreira, C.G. and Zhang, Y. (2024) Fractal Geometry of Continued Fractions with Large Coefficients and Dimension Drop Problems. arXiv:2409.00521. https://doi.org/10.48550/arXiv.2409.00521 <pub-id pub-id-type="doi">10.48550/arXiv.2409.00521</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.48550/arXiv.2409.00521">https://doi.org/10.48550/arXiv.2409.00521</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Fang, L.</string-name>
              <string-name>Moreira, C.G.</string-name>
              <string-name>Zhang, Y.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Fractal Geometry of Continued Fractions with Large Coefficients and Dimension Drop Problems</article-title>
            <fpage>2409</fpage>
            <pub-id pub-id-type="doi">10.48550/arXiv.2409.00521</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B13">
        <label>13.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Ahmadi Dastjerdi, D. and Aghaee, M. (2023) Iterated Function Systems over Arbitrary Shift Spaces. <italic>Khayyam Journal of Mathematics</italic>, 9, 127-143.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Dastjerdi, D.</string-name>
              <string-name>Aghaee, M.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Iterated Function Systems over Arbitrary Shift Spaces</article-title>
            <source>Khayyam Journal of Mathematics</source>
            <volume>9</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B14">
        <label>14.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Pasupathi, R. and Miculescu, R. (2024) A Very General Framework for Fractal Interpolation Functions. J <italic>ournal of Mathematical Analysis and Applications</italic>, 534, Article 128093. https://doi.org/10.1016/j.jmaa.2024.128093 <pub-id pub-id-type="doi">10.1016/j.jmaa.2024.128093</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.jmaa.2024.128093">https://doi.org/10.1016/j.jmaa.2024.128093</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Pasupathi, R.</string-name>
              <string-name>Miculescu, R.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>A Very General Framework for Fractal Interpolation Functions</article-title>
            <source>Journal of Mathematical Analysis and Applications</source>
            <volume>534</volume>
            <elocation-id>128093</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.jmaa.2024.128093</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B15">
        <label>15.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Saleem, N., Ahmad, K., Ishtiaq, U. and de la Sen, M. (2023) Multivalued Neutrosophic Fractals and Hutchinson-Barnsley Operator in Neutrosophic Metric Space. <italic>Chaos</italic>, <italic>Solitons &amp; Fractals</italic>, 172, Article 113607. https://doi.org/10.1016/j.chaos.2023.113607 <pub-id pub-id-type="doi">10.1016/j.chaos.2023.113607</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.chaos.2023.113607">https://doi.org/10.1016/j.chaos.2023.113607</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Saleem, N.</string-name>
              <string-name>Ahmad, K.</string-name>
              <string-name>Ishtiaq, U.</string-name>
              <string-name>Sen, M.</string-name>
              <string-name>Chaos, S</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Multivalued Neutrosophic Fractals and Hutchinson-Barnsley Operator in Neutrosophic Metric Space</article-title>
            <source>Chaos</source>
            <volume>172</volume>
            <elocation-id>113607</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.chaos.2023.113607</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B16">
        <label>16.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Selmi, B., Shen, S. and Yuan, Z. (2025) Multifractal Analysis of Inhomogeneous Multinomial Measures with Non-Doubling Projections. <italic>Fractals</italic>, 33, Article 2550027. https://doi.org/10.1142/s0218348x25500276 <pub-id pub-id-type="doi">10.1142/s0218348x25500276</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1142/s0218348x25500276">https://doi.org/10.1142/s0218348x25500276</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Selmi, B.</string-name>
              <string-name>Shen, S.</string-name>
              <string-name>Yuan, Z.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Multifractal Analysis of Inhomogeneous Multinomial Measures with Non-Doubling Projections</article-title>
            <source>Fractals</source>
            <volume>33</volume>
            <elocation-id>2550027</elocation-id>
            <pub-id pub-id-type="doi">10.1142/s0218348x25500276</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B17">
        <label>17.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wang, L. and Tang, S. (2025) Fractal and Fractional in Construction Materials. <italic>Fractal</italic><italic>and</italic><italic>Fractional</italic>, 9, Article 785. https://doi.org/10.3390/fractalfract9120785 <pub-id pub-id-type="doi">10.3390/fractalfract9120785</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/fractalfract9120785">https://doi.org/10.3390/fractalfract9120785</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wang, L.</string-name>
              <string-name>Tang, S.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Fractal and Fractional in Construction Materials</article-title>
            <source>Fractal and Fractional</source>
            <volume>9</volume>
            <elocation-id>785</elocation-id>
            <pub-id pub-id-type="doi">10.3390/fractalfract9120785</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B18">
        <label>18.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Lefler, S. (2006) Fractals and the Chaos Game. MAT Exam Expository Papers, 24. https://digitalcommons.unl.edu/mathmidexppap/24</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Lefler, S.</string-name>
            </person-group>
            <year>2006</year>
            <article-title>Fractals and the Chaos Game</article-title>
            <source>MAT Exam Expository Papers</source>
            <volume>24</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B19">
        <label>19.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Chan, E.Y.S. and Corless, R.M. (2023) Chaos Game Representation. <italic>SIAM</italic><italic>Review</italic>, 65, 261-290. https://doi.org/10.1137/20m1386438 <pub-id pub-id-type="doi">10.1137/20m1386438</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1137/20m1386438">https://doi.org/10.1137/20m1386438</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Chan, E.Y.S.</string-name>
              <string-name>Corless, R.M.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Chaos Game Representation</article-title>
            <source>SIAM Review</source>
            <volume>65</volume>
            <pub-id pub-id-type="doi">10.1137/20m1386438</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>