Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8253433 | Chaos, Solitons & Fractals | 2018 | 8 Pages |
Abstract
We consider the graph-directed iterated function systems and give upper bounds for the diameters of the smallest disks enclosing their attractors. We also give an algorithm to obtain these smallest enclosing disks with any proximity.
Related Topics
Physical Sciences and Engineering
Physics and Astronomy
Statistical and Nonlinear Physics
Authors
Ali Deniz, Gökçe Ãakmak,