|Table of Contents|

Fast Algorithm for Fractal Images(PDF)

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

Issue:
1996年04期
Page:
27-30
Research Field:
Publishing date:

Info

Title:
Fast Algorithm for Fractal Images
Author(s):
Xu Yongan Tao Haiyan
Department of Mechanical Engineering of Institute of Technology, Yangzhou University, Yangzhou 225009
Keywords:
algorithms computer gr aphics f inite recursio n subdivision f ractal imag es
PACS:
TB231
DOI:
-
Abstract:
The concept and the creat ing metho d of the classic Mandelbrot set and Julia set are g iven in this paper . A g eneral alg orithm—— comput ing po int by point is analyzed, meanw hile a fast alg orithm. Finite r ecursion subdivision metho d is designed fo r blow up of Mandelbrot set and Julia set of ang ular funct io n, ex po nent ial funct ion, Gauss sum functio n, Newto n method. Compared to PPC method, FRS method is 3 to 5 t imes faster than PPC. T he problem o f the unendur able running t ime is solved, and the intr icate st ructure of f ractal images ar e displayed. An ef fect ive method is pro vided fo r f ractal resear ch.

References:

1 Peitg en H O, Saupe D. The science o f fractal ima ges. New Yor k: Spr ing er-ver lag , 1988
2 J?rg ens H, Peit gen H O, Saupe D. 分形语言. 科学( 中译本) , 1990( 12) : 24~32
3 Dav idoff Fra nk. Thr ee unco nventio na l r epresentio ns of t he M  s et . Computer & Gr aphics, 1990( 1) : 127~129
4 Pickov er C A. Mat hematics and beauty V: tur bulent com ples curle. Computer & Graphics 1987( 4) : 499~508

Memo

Memo:
-
Last Update: 2013-04-11