Estimating the spatial extent of attractors of iterated function systems
By: by D. Canright
Contributors: Naval Postgraduate School (U.S.). Dept. of Mathematics
Publisher: Naval Postgraduate School; Available from National Technical Information Service
Published: 1993
Place of publication: Monterey, Calif; Springfield, Va
Language: eng
Subjects: SET THEORY; FRACTALS; ITERATIONS
Other titles: NPS-MA-93-017.
Description: As Barnsley, Demko and others have shown, one effective method for producing fractal      shapes (in any number of dimensions) is with Iterated Function Systems (IFSs), using the      'Chaos Game' algorithm (or some deterministic algorithm). This approach has been used for      producing naturalistic shapes, finding interpolants to given data and fractal approximations of      given functions, and even for visualizing arbitrary discrete sequences. Indeed, any contractive      IFS will give an attractor (usually of fractal dimension); thus it is possible to generate IFSs at      random to explore the graphical possibilities, as is done in some educational software.      Similarly, because the attractor depends continuously on the parameters in the IFS, a small      data sets from any source could be encoded as IFSs for visualization.
Notes: Cover title.

"NPS-MA-93-017."

"Technical report for period January 1993 - April 1993."

AD A265 856.

Includes bibliographical references (p. 8-9)

aq/  /aq cc:9116 09/23/97