A fast algorithm for generating fractals

ASIA unversity > 資訊學院 > 資訊工程學系 > 會議論文 > Item 310904400/78217

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/78217

题名:	A fast algorithm for generating fractals
作者:	朱學亭;Chu, Hsueh-Ting
贡献者:	資訊工程學系
日期:	2000.09
上传时间:	2013-12-26 09:54:58 (UTC+0)
摘要:	With iterated function systems (IFS), there are two classical algorithms of generating artificial fractal pictures: the deterministic algorithm and the random iteration algorithm. The deterministic algorithm spends huge computations on checking convergence iteratively. On the other hand, the random iteration algorithm is nondeterministic and time consuming. People seldom check convergence by the algorithm. Moreover, many pixels in the picture are computed again and again by both of the algorithms. Thus a new algorithm is given. The algorithm promises convergence without iterative checks. Also, our algorithm runs faster than the existing algorithms do on a large scale
關聯:	15th International Conference on Pattern Recognition, 2000 (ICPR2000)
显示于类别:	[資訊工程學系] 會議論文

文件中的档案:

档案	大小	格式	浏览次数
index.html	0Kb	HTML	313	检视/开启

在ASIAIR中所有的数据项都受到原著作权保护.