On the smallest disks enclosing graph-directed fractals

DENİZ A., ÇAKMAK G.

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

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 114
  • Basım Tarihi: 2018
  • Doi Numarası: 10.1016/j.chaos.2018.07.040
  • Dergi Adı: CHAOS SOLITONS & FRACTALS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.483-490
  • Anahtar Kelimeler: Fractals, Graph-directed iterated function system, Smallest enclosing disk
  • Anadolu Üniversitesi Adresli: Evet

Özet

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.