18 Jul
2006
18 Jul
'06
4:26 p.m.
On 7/18/06, Mike Stay <mike@math.ucr.edu> wrote:
In fact, there's a clever algorithm for poltting the mandelbrot set that uses that fact: since points in the set take the longest to compute, we want to compute as few as possible. So divide up the space into quadrants and compute the edge values: if all the edge values are the same, then the interior is the same (assuming you don't have the entire set inside one quadrant).
And if the edge values aren't all the same, recurse. -- Mike Stay metaweta@gmail.com http://math.ucr.edu/~mike