Escape buffer: Efficient computation of escape time for linear fractals

Daryl H. Hepting, John C. Hart

Research output: Contribution to journalConference article

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 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.

Original languageEnglish (US)
Pages (from-to)204-214
Number of pages11
JournalProceedings - Graphics Interface
StatePublished - Dec 1 1995
Externally publishedYes
EventProceedings of the 1995 Graphics Interface Conference - Quebec, Que, Can
Duration: May 17 1995May 19 1995

Fingerprint

Fractals
Pixels

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design

Cite this

Escape buffer : Efficient computation of escape time for linear fractals. / Hepting, Daryl H.; Hart, John C.

In: Proceedings - Graphics Interface, 01.12.1995, p. 204-214.

Research output: Contribution to journalConference article

@article{6e5a7747d99d4785a0cee50cfd103eb5,
title = "Escape buffer: Efficient computation of escape time for linear fractals",
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 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.",
author = "Hepting, {Daryl H.} and Hart, {John C.}",
year = "1995",
month = "12",
day = "1",
language = "English (US)",
pages = "204--214",
journal = "Proceedings - Graphics Interface",
issn = "0713-5424",
publisher = "Canadian Information Processing Society",

}

TY - JOUR

T1 - Escape buffer

T2 - Efficient computation of escape time for linear fractals

AU - Hepting, Daryl H.

AU - Hart, John C.

PY - 1995/12/1

Y1 - 1995/12/1

N2 - 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 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.

AB - 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 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.

UR - http://www.scopus.com/inward/record.url?scp=0029454548&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029454548&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0029454548

SP - 204

EP - 214

JO - Proceedings - Graphics Interface

JF - Proceedings - Graphics Interface

SN - 0713-5424

ER -