MandelbrotPoint
MandelbrotPoint (x, y, maxIterations, algorithm)
The MandelbrotPoint function returns a value between 0 and maxIterations based on the Mandelbrot set complex quadratic recurrence relation z[n] = z[n-1]^2 + c where x is the real component of c, y is the imaginary component of c and z[0] = 0.
The returned value is the number of iterations the equation was evaluated before |z[n]| > 2 (the escape radius of the Mandelbrot set), or maxIterations, whichever is less.
Parameters
| algorithm =0 | The "Escape Time" algorithm returns the integer n which is the number of iterations until |z[n]| > 2. | |||||
| algorithm =1 | The "Renormalized Iteration Count Algorithm" algorithm returns a floating point value which is a refinement of the number of iterations n by adding the quantity: | |||||
5 - ln(ln(|z[n+4]|)) / ln(2) | ||||||
| (which requires four more iterations of the recurrence relation). The returned value is clipped to maxIterations. | ||||||
Demos
Open MultiThread Mandelbrot Demo