The Escape Buffer: Efficient Computation of Escape Time for Linear Fractals

The study of linear fractals has gained a great deal from the study quadratic fractals, despite important differences. Methods for classifying points in the complement of a fractal shape were originally developed for quadratic fractals, to provide insight into their underlying dynamics. These methods were later modified for use with linear fractals. This paper reconsiders one such classification, called escape time, and presents a new algorithm for its computation that is significantly faster and conceptually simpler. Previous methods worked backwards, by mapping pixels into classified regions, whereas the new forward algorithm uses an “escape buffer” to mapping classified regions onto pixels. The efficiency of the escape buffer is justified by a careful analysis of its performance on linear fractals with various properties.

[1]  Henning Fernau,et al.  Valuations of Languages, with Applications to Fractal Geometry , 1995, Theor. Comput. Sci..

[2]  John C. Hart,et al.  Efficient antialiased rendering of 3-D linear fractals , 1991, SIGGRAPH.

[3]  S. Dubuc,et al.  Approximations of fractal sets , 1990 .

[4]  Judson Rosebush.  The proceduralist manifesto , 1989, SIGGRAPH '89.

[5]  Przemyslaw Prusinkiewicz,et al.  Escape-time visualization method for language-restricted iterated function systems , 1992 .

[6]  Przemyslaw Prusinkiewicz,et al.  The Algorithmic Beauty of Plants , 1990, The Virtual Laboratory.

[7]  M. Barnsley,et al.  Recurrent iterated function systems , 1989 .

[8]  Laurie Reuter,et al.  Rendering and magnification of fractals using iterated function systems , 1987 .

[9]  Peter H. Richter,et al.  The Beauty of Fractals , 1988, 1988.

[10]  R. Voss.  Random Fractal Forgeries , 1985 .

[11]  John Hart,et al.  The object instancing paradigm for linear fractal modeling , 1992 .

[12]  Arnaud E. Jacquin,et al.  Image coding based on a fractal theory of iterated contractive image transformations , 1992, IEEE Trans. Image Process..

[13]  Przemyslaw Prusinkiewcz,et al.  Koch curves as attractors and repellers , 1988, IEEE Computer Graphics and Applications.

[14]  E OppenheimerPeter,et al.  Real time design and animation of fractal plants and trees , 1986 .

[15]  Daryl H. Hepting.  Approximation and Visualization of Sets Defined by Iterated Function Systems , 1991 .

[16]  M. Barnsley,et al.  Iterated function systems and the global construction of fractals , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[17]  Lisa Lorentzen,et al.  Compositions of contractions , 1990 .

[18]  Dietmar Saupe,et al.  Rendering Methods for Iterated Function Systems , 1991 .

[19]  Heinz-Otto Peitgen.  Fantastic deterministic fractals , 1988 .

[20]  Heinz-Otto Peitgen,et al.  The science of fractal images , 2011 .

[21]  Peter Oppenheimer,et al.  Real time design and animation of fractal plants and trees , 1986, SIGGRAPH.

[22]  Michael F. Barnsley,et al.  Fractals everywhere , 1988 .

[23]  Dubuc Raouf Hamzaoui.  ON THE DIAMETER OF THE ATTRACTOROF AN IFSSerge , 1994 .

[24]  C. Sparrow.  The Fractal Geometry of Nature , 1984 .

[25]  David Canright.  Estimating the spatial extent of attractors of iterated function systems , 1994, Comput. Graph..

[26]  Alvy Ray Smith,et al.  Plants, fractals, and formal languages , 1984, SIGGRAPH.

[27]  V. Leitáo,et al.  Computer Graphics: Principles and Practice , 1995 .