Accession Number : ADA265856


Title :   Estimating the Spatial Extent of Attractors of Iterated Function System


Descriptive Note : Technical rept. Jan-Apr 1993


Corporate Author : NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF MATHEMATICS


Personal Author(s) : Canright, D


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/a265856.pdf


Report Date : 27 Apr 1993


Pagination or Media Count : 23


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


Descriptors :   *FRACTALS , *ITERATIONS , *SET THEORY , COMPUTER PROGRAMS , COMPUTATIONS , ESTIMATES , CHAOS , ALGORITHMS


Subject Categories : Theoretical Mathematics


Distribution Statement : APPROVED FOR PUBLIC RELEASE