Abstract
The iterative procedure of removing “almost everything” from a triangle ultimately leading to the Sierpinski's gasket S is well-known. But what is in fact left when almost everything has been taken out? Using the Sir Pinski's game described by Schroeder [4], we identify two dual sets of invariant points in this exquisite game, and from these we identify points left over in Sierpinski gasket. Our discussion also shows that the chaos game does not generate the Sierpinski gasket. It generates an approximation or, at most, a subset of S.
Original language | English |
---|---|
Title of host publication | CHAOS 2011 - 4th Chaotic Modeling and Simulation International Conference, Proceedings |
Publisher | cmsim.org |
Pages | 137-144 |
Number of pages | 8 |
Publication status | Published - 2019 |
Event | 4th International Conference on Chaotic Modeling and Simulation, CHAOS 2011 - Agios Nikolaos, Crete, Greece Duration: 31 May 2011 → 3 Jun 2011 |
Conference
Conference | 4th International Conference on Chaotic Modeling and Simulation, CHAOS 2011 |
---|---|
Country/Territory | Greece |
City | Agios Nikolaos, Crete |
Period | 31/05/11 → 3/06/11 |
Keywords
- Sierpinski gasket
- Sierpinski points
- Fractals
- Sir Pinski game
- Chaos game
- Self-similarity
- Periodicity