It is also given upper and lower bounds for the diameter of the attractors of a graph-directed system.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:In this work it is considered the graph-directed iterated function systems, and a sufficient condition to find disks which are centered at arbitrarily given points and containing the attractors of these systems is given.
📊
Key Findings & Data:In this work it is considered the graph-directed iterated function systems, and a sufficient condition to find disks which are centered at arbitrarily given points and containing the attractors of these systems is given.
💡
Conclusion & Impact:It is also given upper and lower bounds for the diameter of the attractors of a graph-directed system.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters
Abstract
In this work it is considered the graph-directed iterated function systems, and a sufficient condition to find disks which are centered at arbitrarily given points and containing the attractors of these systems is given. It is also given upper and lower bounds for the diameter of the attractors of a graph-directed system.
Özet
Bu çalışmada çizge-yönlendirilmiş yinelemeli fonksiyon sistemleri ele alınmış, verilen keyfi noktaları merkez kabul eden vebu sistemlerin çekicilerini kapsayan disklerin bulunabilmesi için bir yeterli koşul verilmiştir. Ayrıca çizge-yönlendirilmişyinelemeli fonksiyon sistemi çekicilerinin çapları için alt ve üst sınırlar verilmiştir.
🔖
Cite This Article
DENİZ, A. (2022). ON THE DIAMETERS OF GRAPH-DIRECTED FRACTALS. Anadolu Üniversitesi Bilim ve Teknoloji Dergisi :B-Teorik Bilimler, Cilt: 5 - Sayı: 1, 13–21. https://ajindex.com/articles/438551
Hutchinson, JE. Fractals and self similarity. Indiana Univ Math J 1981; 30: 713-747.
Barnsley, M. Fractals Everywhere. Boston: Academic Press, 1993.
Dubuc S, Elqortobi A. Approximations of fractal sets. J Comput Appl Math 1990; 29: 79-89.
Hepting D, Prusinkiewicz P, Saupe D. Rendering methods for iterated function systems. In: Fractals in the Fundamental and Applied Sciences; 1991;
H.-O. Peitgen, J. M. Henriques, L. Peneda (eds.), North-Holland, Amsterdam. Dubuc S, Hamzaoui R. On the diameter of the attractor of an IFS. C R Math Rep Acad Sci. Canada, 1994. Canright D. Estimating the spatial extent of attractors of iterated function systems. Computers and Graphics 1994; 18(2): 231-238. Rice J. Spatial Bounding of Self-Affine Iterated Function System Attractor Sets. Procedings of the Conference Graphics Interface 1996; 107-115.
Hart JC, DeFanti TA. Efficient antialiased rendering of 3-D linear fractals. Computer Graphics 1991; 25(4): 91-100. Martyn T. The smallest enclosing disc of an affine IFS fractal. Fractals 2009; 17(3): 269-281.
Edgar G. Measure, Topology and Fractal Geometry. Springer, New York, 2008.
Mauldin RD, Williams SC. Hausdorff dimension in graph directed constructions. Trans Amer Math Soc 1988; 309(2):811–829.
Berger M, Cole M, Levy S. Geometry I. Springer, 2009.