旋转对称加速算法绘制Mandelbrot集和Julia集  

A Rotation Symmetry Accelerative Algorithm for Constructing Mandelbrot Set and Julia Set

作　　者：冯玲[1] 张桂兰[2] 

机构地区：[1]泰山学院信息科学与技术系,泰安271021 [2]济南广播电视大学信息技术学院计算机教研室,250014

出　　处：《信息技术与信息化》2007年第5期73-74,140,共3页Information Technology and Informatization

摘　　要：通过大量计算机数学实验,利用Mandelbrot集和Julia集不同的旋转对称性,在传统逃逸时间算法的基础上,提出了针对于M集和J集的特定的旋转对称加速算法,提高了绘图速度。并且引入不同判敛标准和收敛半径等其它条件,构造了美丽、奇异的分形图案。Through lots of computer - mathematics experiments, using different of M set and J set＇s rotation symmetry, based on the escape time algorithm, specifically rotation symmetry accelerative algorithm aimed at M set and J set were advanced. This algorithm reduces the time of drawing, and constructs a lot of beautiful, fantastic fractal images through importing other conditions such as different criterion for convergence and convergence radius.

关 键 词：M集 J集 逃逸时间算法 旋转对称性 

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