END OF AN ERA, FRACTALFORUMS.COM IS CONTINUED ON FRACTALFORUMS.ORG

hi there, i have not implemented such a function, i cant give you any hint right now for guessing a reasonable maxIter for
getting the optimal iteration when close to interesting area, it is harder than one might think and i guess to common fractal
programm writers have struggled with it as well

considerations:
- i think the distance estimator might come in handy here but i can not give you a hint on how to use it, the distance estimator basically measures the distance of the "iteration bands" the closer they are to eachother, the more iterations you need, hmm, but i guess finding a point that is NOT in the set
brings you down to a point finding where the change from inside/outside happens, a point close to this border - within/rounded pixel screen resolution - the estimated distance could give you a hint how to set this value

any other comments about this ?!

You talk of a graph, which suggests you are keeping a count of the numbers of pixels for each iteration count.
When your maximum iteration level has more than say 40 pixels (or any arbitary number based on resolution) increase the maximum iterations.
If that new maximum has more than 40 pixels, increase again perhaps by a larger, amount say twice the previous increase, and so on.

You guys keep talking about maximum iteration cuont as if it was a problem to find the value that always works But, again,
If it turns out there is underiterated minibrot somewhere really deep with log(zoom)^4 you could just change to log(zoom)^5 or even something completely different - the point is, no matter what location, you can always find max iterations that will be sufficient for all of them (even if it will be overkill for most of locations).

My initial question, however, was about minimum iterations that you need for all the pixels in certain range around certain location. The only reason I would need it for is to look up the colors directly inside the loop; otherwise I would need to store iterations, check perimeter after the frame is done, and then use that found value to color everything. Yes, I know you could just make color from iteration number, but in this case I need to ensure color range... but whatever, this is not show stopper, I can do 2 passes just fine. Just thought that maybe there is some obscure paper that has some unknown formula that they do not put on wikipedia.