摘要
本文就分形集的逼近效率进行了探讨,对几个著名的分形集给出了数值实验的效率报告,对分形集逼近算法存在的问题和发展进行了分析.
In this paper, efficiency of approximations is to discuss. For sevenal famous fractal sets are gived out by efficient report. It is analysed for existential problem and direction of approximations of tractal sets.
出处
《工程图学学报》
CSCD
1999年第2期54-60,共7页
Journal of Engineering Graphics
关键词
分形
IFS
分形集逼近算法
approximation of fractal set, IFS(Iterated Function System), fractal set