[1]徐永安,陶海燕.分形图案的快速生成法[J].南京理工大学学报(自然科学版),1996,(04):27-30.
 Xu Yongan Tao Haiyan.Fast Algorithm for Fractal Images[J].Journal of Nanjing University of Science and Technology,1996,(04):27-30.
点击复制

分形图案的快速生成法()
分享到:

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

卷:
期数:
1996年04期
页码:
27-30
栏目:
出版日期:
1996-08-30

文章信息/Info

Title:
Fast Algorithm for Fractal Images
作者:
徐永安陶海燕
扬州大学工学院机械系, 扬州225009
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
分类号:
TB231
摘要:
该文给出了经典Mandelbrot集合和Julia集合的概念,分析了常用的点点计算法的特征,在此基础上设计出快速的有限递归细分算法(finiterecursionsub-devide,简称FRS)。利用这2种算法生成Mandelbrot放大集以及三角函数、指数函数、Gauss和函数、Newton解函数的Julia集合并进行比较,FRS法一般要比点点计算法快3~5倍,解决了微机生成分形图案时间太长的问题。通过快速算法显示出分形图案的内部蕴涵的精妙结构,提供了深入研究分形的手段
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

相似文献/References:

[1]胡学龙,姜楠.平面构成中的几种特殊变换方案的研究[J].南京理工大学学报(自然科学版),1998,(05):6.
 Hu Xuelong Jiang Nan.A Study on Some Special Transformations in Planar Composition[J].Journal of Nanjing University of Science and Technology,1998,(04):6.
[2]胡学龙.基于L-系统的分形平面图案造型[J].南京理工大学学报(自然科学版),1996,(04):19.
 Hu Xuelong.2D Fractal Modeling Based on L systems[J].Journal of Nanjing University of Science and Technology,1996,(04):19.
[3]高旭,徐永安.迭代函数系统及其应用[J].南京理工大学学报(自然科学版),1996,(04):31.
 Gao Xu Xu Yongan.Iterated Function System and Its Application[J].Journal of Nanjing University of Science and Technology,1996,(04):31.
[4]王荣珏,胡晓华.画家算法中漏点产生原因分析及消除方法[J].南京理工大学学报(自然科学版),1996,(04):44.
 Wang Rongjue Hu Xiaohua.Causes and Ways of Eliminating the Leak Points in Z buffer Algorithm[J].Journal of Nanjing University of Science and Technology,1996,(04):44.
[5]李靖谊,伍铁军.测试点的包容性的改进算法[J].南京理工大学学报(自然科学版),1996,(04):48.
 Li Jingyi Wu Tiejun.An Improved Algorithm for Testing Containment of Points[J].Journal of Nanjing University of Science and Technology,1996,(04):48.
[6]崔敏.交互图形输入及动画技术研究与实现[J].南京理工大学学报(自然科学版),1996,(04):93.
 CuiMin.Research and Realization of Interactive Graphics Input and Animation Technique[J].Journal of Nanjing University of Science and Technology,1996,(04):93.
[7]王艳春,朱明武.一种有效的MIMD并行DFP算法[J].南京理工大学学报(自然科学版),1994,(06):1.
 Wang Yancbun.An Efficient MIMD Parallel DFP Algorithm[J].Journal of Nanjing University of Science and Technology,1994,(04):1.
[8]左恩栋,胡庆.最长公共子串的快速搜索算法[J].南京理工大学学报(自然科学版),1988,(01):36.
[9]欧阳普仁,杨叔子.一种改进的Marple算法[J].南京理工大学学报(自然科学版),1988,(01):41.

备注/Memo

备注/Memo:
徐永安 男 31岁 助教
更新日期/Last Update: 2013-04-11