Estimating the Spatial Extent of Attractors of Iterated Function System

Abstract

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

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 27, 1993
Accession Number
ADA265856

Entities

People

  • D. Canright

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • C Programming Language
  • California
  • Computations
  • Computer Programming
  • Data Sets
  • Equations
  • Inequalities
  • Language
  • Mathematics
  • Military Research
  • Probability
  • Programming Languages
  • Schools
  • Sequences
  • Two Dimensional

Readers

  • Approximation Theory.
  • Team-Based Human-Centered Cognitive Task Decision Making and Information Performance.
  • Wave Propagation and Nonlinear Chaotic Dynamics.