On the smallest disks enclosing graph-directed fractals

DENİZ A., ÇAKMAK G.

CHAOS SOLITONS & FRACTALS, vol.114, pp.483-490, 2018 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 114
  • Publication Date: 2018
  • Doi Number: 10.1016/j.chaos.2018.07.040
  • Journal Name: CHAOS SOLITONS & FRACTALS
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.483-490
  • Keywords: Fractals, Graph-directed iterated function system, Smallest enclosing disk
  • Anadolu University Affiliated: Yes

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. (C) 2018 Elsevier Ltd. All rights reserved.