On the smallest disks enclosing graph-directed fractals

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