ArticlesNo Access

DISTINGUISHING BETWEEN SIERPINSKI TRIANGLE CONSTRUCTIONS

DAVID ETTESTAD

Department of Physics, State University of New York, College at Buffalo, 1300 Elmwood Ave, Buffalo, NY 14222, USA

E-mail Address: ettestdj@buffalostate.edu

Search for more papers by this author

and

JOAQUIN CARBONARA

http://orcid.org/0000-0003-2975-9371

Department of Mathematics, State University of New York, College at Buffalo, 1300 Elmwood Ave, Buffalo, NY 14222, USA

E-mail Address: carbonjo@buffalostate.edu

Corresponding author.

Search for more papers by this author

https://doi.org/10.1142/S0218348X19500919Cited by:4 (Source: Crossref)

Abstract

There are several methods given for constructing the Sierpinski Triangle (ST). In particular, the ST can be created as a countably infinite intersection of contained figures, or as the countably infinite union of triangles. At first glance they both appear to create the same object. In this paper, we show that they are not the same. In addition, we analyze and compare with the previous two methods, a third method of constructing the ST which entails generating a countable number of points using an algorithm.

Keywords:

References

1. B. B. Mandelbrot, The Fractal Geometry of Nature (W. H. Freeman, 1982). Google Scholar
2. K. Falconer, Fractal Geometry, 2nd edn. (Wiley, 2006). Google Scholar
3. http://www.oftenpaper.net/sierpinski.htm. Google Scholar
4. D. Ettestad and J. Carbonara, The Sierpinski triangle plane, Fractals 26(1) (2018) 1850003. Link, Web of Science, Google Scholar
5. F. Barnsley, Fractals Everywhere (Dover, 2012). Google Scholar
6. “Sierpinski Triangle”, https://en.wikipedia.org/wiki/Sierpinski_triangle. Google Scholar
7. M. Barnsley and A. Vince, The Chaos game on a general iterated function system, Ergodic Theory Dynam. Syst. 31(4) (2011) 1073–1079. Crossref, Web of Science, Google Scholar