How would you continuously improve the mandelbrot fractal?

Question

I've seen many mandelbrot image generator drawing a low resolution fractal of the mandelbrot and then continuously improve the fractal. Is this a tiling algorithm? Here is an example: http://neave.com/fractal/

Update: I've found this about recursively subdivide and calculate the mandelbrot: http://www.metabit.org/~rfigura/figura-fractal/math.html. Maybe it's possible to use a kd-tree to subdivide the image?

Update 2: http://randomascii.wordpress.com/2011/08/13/faster-fractals-through-algebra/ Update 3: http://www.fractalforums.com/programming/mandelbrot-exterior-optimization/15/

What do you mean? I know how to draw a mandelbrot. But the tiling and improvement thing is new to me? — Micromega, Dec 03 '12 at 23:26
https://mightymandel.mathr.co.uk/current/usage.html#usagetile — Adam, Apr 23 '18 at 18:05

score 6 · Answer 1 · answered Mar 12 '15 at 00:09

Author of Fractal eXtreme and the randomascii blog post linked in the question here.

Fractal eXtreme does a few things to give a gradually improving fractal image:

Start from the middle, not from the top. This is a trivial change that many early fractal programs ignored. The center should be the area the user cares the most about. This can either be starting with a center line, or spiraling out. Spiraling out has more overhead so I only use it on computationally intense images.
Do an initial low-res pass with 8x8 blocks (calculating one pixel out of 64). This gives a coarse initial view that is gradually refined at 4x4, 2x2, then 1x1 resolutions. Note that each pass does three times as many pixels as all previous passes -- don't recalculate the original points. Subsequent passes also start at the center, because that is more important.
A multi-pass method lends itself well to guessing. If four pixels in two rows have the same value then the pixels in-between probably have the same value, so don't calculate them. This works extremely well on some images. A cleanup pass at the end to look for pixels that were miscalculated is necessary and usually finds a few errors, but I've never seen visible errors after the cleanup pass, and this can give a 10x+ speedup. This feature can be disabled. The success of this feature (guess percentage) can be viewed in the status window.
When zooming in (double-click to double the magnification) the previously calculated pixels can be used as a starting point so that only three quarters of the pixels need calculating. This doesn't work when the required precision increases but these discontinuities are rare.

More sophisticated algorithms are definitely possible. Curve following, for instances.

Having fast math also helps. The high-precision routines in FX are fully unwound assembly language (generated by C# code) that uses 64-bit multiplies.

FX also has a couple of checks for points within the two biggest bulbs, to avoid calculating them at all. It also watches for cycles in calculations -- if the exact same point shows up then the calculations will repeat.

To see this in action visit http://www.cygnus-software.com/

Your answers are underrated on SO in my opinion. For your forth point are you talking about the [Huvpička algorithm (used in Xaos)](https://en.wikipedia.org/wiki/XaoS)? — Z boson, May 26 '15 at 08:17
Thanks for saying that. I've never heard that technique called the Huvpička algorithm before. FX has been doing variations of that for 18 years, and I think my previous fractal programs did it as well, so almost 30 years? Long before Xaos, although Xaos may be doing it in new and interesting ways. — Bruce Dawson, May 27 '15 at 06:15
@Zboson I don't think the FX documentation covers that explicitly - it's an internal detail that users don't need to know. Some related optimizations are covered at http://www.cygnus-software.com/docs/index.html. Only calculating 3/4 of the pixels when doing a 2x zoom is heavily used when calculating zoom movies. In addition, for those movies the central quarter of pixels aren't stored because they are implicit in the next image. Same idea. — Bruce Dawson, May 28 '15 at 05:53

karatedog · Answer 2 · 2021-05-02T19:36:36.173

3

The oldschool Mandelbrot rendering algorithm is the one that begins calculating pixels at the top-left position, goes right until it reaches the end of the screen then moves to the beginning of next line, like an ordinary typewriter machine (visually).

The linked algorithm is just calculating pixels in a different order, and when it calculates one, it quickly makes assumption about certain neighboring pixels and later goes back to properly redraw them. That's when you see improvement, think of it as displaying a progressive JPEG. If you zoom into the set, certain pixel values will remain the same (they don't need to be recalculated) the interim pixels will be guessed, quickly drawn and later recalculated.

A continuously improving Mandelbrot is just for your eyes, it will never finish earlier than a properly calculating per-pixel algorithm which can detect "islands".

edited May 02 '21 at 19:36

answered Dec 03 '12 at 23:47

karatedog

2,508
19
29

But how would you determine if the point is within the cardioid, the last the period-2 bulb? What does this mean? – Micromega Dec 03 '12 at 23:58
It fills pixel with same colors? – Micromega Dec 04 '12 at 13:12
Yes it does. Try AakashM suggestion. Zoom into the set quickly, then grab the screen and move left or right. There are no pixels drawn in this state and when you release the mouse button, then will the screen redraw. – karatedog Dec 04 '12 at 13:42
Yes, but how do you make assumption. Kd-tree, quadtree? – Micromega Dec 04 '12 at 15:49
As I see it this is a simple nearest neighbor pixel doubling. No magic. – karatedog Dec 05 '12 at 08:11
I think it's just different iterations. – Micromega Dec 05 '12 at 08:17

score 3 · Accepted Answer · answered Dec 04 '12 at 09:30

I think that site is not as clever as you give it credit for. I think what happens on a zoom is this:

Take the previous image, scale it up using a standard interpolation method. This gives you the 'blurry' zoomed in image. Click the zoom in button several times to see this best
Then, in concentric circles starting from the central point, recalculate squares of the image in full resolution for the new zoom level. This 'sharpens' the image progressively from the centre outwards. Because you're probably looking at the centre, you see the improvement straight away.

You can more clearly see what it's doing by zooming far in, then dragging the image in a diagonal direction, so that almost all the screen is undrawn. When you release the drag, you will see the image rendered progressively in squares, in concentric circles from the new centre.

I haven't checked, but I don't think it's doing anything clever to treat in-set points differently - it's just that because an entirely-in-set square will be black both before and after rerendering, you can't see a difference.

How would you continuously improve the mandelbrot fractal?

3 Answers3