| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 4.93 MB | Adobe PDF |
Advisor(s)
Abstract(s)
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.
Description
Keywords
Sierpinski gasket Sierpinski points Fractals Sir Pinski game Chaos game Self-similarity Periodicity
Citation
GOMES, Maria Ivette ; PESTANA, Dinis ; PESTANA, Pedro Duarte - Sir Pinski Rides Again. Chaotic Modeling and Simulation (CMSIM). ISSN 2241-0503. N.º 1 (2011), p. 77-90