Affordable Access

Publisher Website

Bounding the attractor of an IFS

Authors
Journal
Information Processing Letters
0020-0190
Publisher
Elsevier
Publication Date
Volume
64
Issue
4
Identifiers
DOI: 10.1016/s0020-0190(97)00156-7
Keywords
  • Algorithms
  • Analysis Of Algorithms
  • Iterated Function Systems
  • Fractals
Disciplines
  • Computer Science

Abstract

Abstract Fractal images defined by an iterated function system (IFS) are specified by a finite number of contractive affine transformations. In order to plot the attractor of an IFS on the screen of a digital computer, it is necessary to determine a bounding area for the attractor. Given a point on the plane, we obtain a formula for the radius of a circle centred on that point that contains the attractor of the IFS. We then describe an algorithm to find the point on the plane such that the bounding circle centred on that point has minimum radius.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Tight bounding ball for affine IFS attractor

on Computers & Graphics Jan 01, 2003

Attractors of generalized IFSs that are not attrac...

on Journal of Mathematical Analys... Feb 01, 2015

Attractors of generalized IFSs that are not attrac...

on Journal of Mathematical Analys...

IFS attractors and Cantor sets

on Topology and its Applications Jan 01, 2006
More articles like this..