构造广义M-J集的邻域逃逸时间算法  

Construction of General M-J Set with Neighborhood Escape Time Algorithm

作　　者：章立亮[1] 

机构地区：[1]宁德师范高等专科学校数学研究所,福建宁德352100

出　　处：《工程图学学报》2008年第3期109-115,共7页Journal of Engineering Graphics

基　　金：福建省自然科学基金资助项目(Z0511053);宁德师范高等专科学校"教授培养工程"资助项目

摘　　要：逃逸时间算法是绘制M-J分形图像的重要方法。研究了复映射构造广义M-J集的算法问题,分析了传统的逃逸时间算法存在的不足,针对该算法时间效率低的情况,提出基于区域处理的绘制算法。实验表明,新算法具有普适性和健壮性,对任意形式复映射的广义M-J集都有较高的绘制速度。最后还利用新算法所具有的边界检测特性,提取出广义M-J集的边界。The escape time algorithm is an important method in generating Mandelbrot set and Julia set fractal images. Method of generating fractal images using escape time algorithm is discussed. Firstly, the properties of escape time algorithm are analyzed. Secondly, the method based on area transaction is put forward to avoid the shortages that the existed methods are not good enough for time efficiency. The results show that the new algorithm is generality and healthy. Furthermore, the boundary of M-J set can be generated by using of new algorithm.

关 键 词：计算机应用 邻域逃逸时间算法 区域处理 广义M-J集 分形 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]