说明：  给出了二次函数的Julia集分形图的概念及逃逸时间算法绘制复杂分形图的基本原理,对Julia集给出了严格的数学定义.逃逸时间算法即取定迭代次数界限N,经N次迭代后,若x点仍在给定的区域内,则认为x是分形A中的点 否则x不是分形A中的点.该算法同样适用于Mandelbrot集、Sierpinski三角形等其他复杂分形图.试验表明,该算法绘制的Julia集分形图准确有效、优美清晰,算法简单实用.
(given quadratic function of the Julia set fractal images and the concept of escape time algorithm mapping complex fractal graph- The principle of Julia Sets is a strict mathematical definition. Escape from time algorithm that will limit the number of iterations N, by the N-th iteration, if x is still point to the region, think x A fractal is the point otherwise x A fractal is not the point. It is also applicable to Mandelbro t set, Sierpinski triangle and other complex fractal images. Test shows that The algorithm mapping the Julia set fractal images accurately and effectively, a beautiful clear, simple and practical algorithm.)