摘要
在分析比较已有迭代函数系统吸引子逼近算法的基础上,提出了一种改进的算法.通过绘制分形图时先对迭代函数迭代后的点及其原像点增加标记来判断某一点是否已经被迭代运算过,有效减少了计算点的个数,提高了计算效率.经实验验证效果明显.
An improved algorithm was proposed based on analyzing and comparing the existing algorithms for attrator approximation in iterated function system.Through marking the iterated points and it＇s original points to determine whether a point has been iterated or not before drawing fractal diagram can effectively reduce the number of points and improve the computational efficiency.The results show that the improved algorithm has a good effect.
出处
《兰州工业高等专科学校学报》
2012年第1期38-40,共3页
Journal of Lanzhou Higher Polytechnical College
基金
甘肃省科技厅高新科技支撑计划(1104GKCA049)
关键词
迭代函数系统
吸引子
标记
计算效率
Iterated function system
attractor
marking
computational efficiency
