The Escape Buffer: Efficient Computation of Escape Time for Linear Fractals
| dc.contributor.author | Hepting, Daryl | |
| dc.contributor.author | Hart, John | |
| dc.date.accessioned | 2018-10-19T17:32:41Z | |
| dc.date.available | 2018-10-19T17:32:41Z | |
| dc.date.issued | 1995-05-17 | |
| dc.description.abstract | The study of linear fractals has gained a great deal from the study of 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 map 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. | en_US |
| dc.description.authorstatus | Faculty | en_US |
| dc.description.peerreview | yes | en_US |
| dc.identifier.citation | Hepting, D. H. and Hart, J.C., The escape buffer: Efficient computation of escape time for linear fractals, Proceedings of Graphics Interface '95, pages 204-214, DOI 10.20380/GI1995.24, 1995. | en_US |
| dc.identifier.isbn | 0-9695338-4-5 | |
| dc.identifier.issn | 0713-5424 | |
| dc.identifier.uri | https://dx.doi.org/10.20380/GI1995.24 | |
| dc.identifier.uri | https://hdl.handle.net/10294/8412 | |
| dc.language.iso | en | en_US |
| dc.publisher | Canadian Human Computer Communications Society | en_US |
| dc.subject | escape time, computation, linear fractals | en_US |
| dc.title | The Escape Buffer: Efficient Computation of Escape Time for Linear Fractals | en_US |
| dc.type | Article | en_US |