Bounding circle of julia sets

[knighty]

Hello,
This is quite simple and you may already know it but I couldn't find any reference in the net:
The question is what is the radius of the smallest circle bounding a given julia set? I found a formula that gives that radius when c is real and is <= 0. For other c's it gives very good bounding circle. an interresting fact about the bounding circles found with this formula is that when their radius is used as the bailout, the leminscates are tangent.
The radius "r" is the positive solution of the equation: r^p-r-|c|=0
Where p is the power of the julia set (in z<-z^p+c).

Here are two evaldraw srcipts for illustration:

Code:

static n=2;
(x,y) {
   static cx=-1,cy=0.5;
   static bo=2;
   static frm=-1;
   if(numframes>frm){
      frm=numframes;
      cx=(mousx-0.5*xres)*0.005;
      cy=(0.5*yres-mousy)*0.005;
      bo=newton(1,sqrt(cx*cx+cy*cy))^2;
   }
   1-julia(x,y,cx,cy,32,bo)
}
julia(x,y,cx,cy,it,bo){
   r2=x*x+y*y;
   for(i=0;i<it && r2<bo;i++){
      r=sqrt(r2);
      t=atan2(y,x);
      r=r^n;t=n*t;
      x=r*cos(t)+cx;
      y=r*sin(t)+cy;
      /*x1=x*x-y*y+cx;
      y=2*x*y+cy;
      x=x1;*/
      r2=x*x+y*y;
   }
   i/it
}
newton(x,c){//Solves for the radius
   i=0;
   do{
      x1=x-(x^n-x-c)/(n*x^(n-1)-1);
      if(abs(x-x1)/x<2^-53) break;
      x=x1;
      i++;
   }while(i<5);
   x
}

Code:

static n=2;
(x,y) {
   cx=x;cy=y;
   bo=newton(1,sqrt(cx*cx+cy*cy))^2;
   1-julia(x,y,cx,cy,32,bo)//in fact this is the mandelbrot set :) replace "bo" by 2 and see the difference
}
julia(x,y,cx,cy,it,bo){
   r2=x*x+y*y;
   for(i=0;i<it && r2<bo;i++){
      r=sqrt(r2);
      t=atan2(y,x);
      r=r^n;t=n*t;
      x=r*cos(t)+cx;
      y=r*sin(t)+cy;
      /*x1=x*x-y*y+cx;
      y=2*x*y+cy;
      x=x1;*/
      r2=x*x+y*y;
   }
   i/it
}
newton(x,c){
   i=0;
   do{
      x1=x-(x^n-x-c)/(n*x^(n-1)-1);
      if(abs(x-x1)/x<2^-53) break;
      x=x1;
      i++;
   }while(i<5);
   x
}

I haven't tried it yet with quaternion julia and julia bulbs but I think it should work with them.

[Adam Majewski]

Hi,
It is described in paper :
Julia Sets of Complex Polynomials and Their Implementation on the Computer by Christoph Martin Stroh

HTH
Ada

[Fractal Ken]

It is described in paper :
Julia Sets of Complex Polynomials and Their Implementation on the Computer by Christoph Martin Stroh

Here's the link.

[knighty]

Thank you very much.
Very interesting document even if it is maybe too technical for my small brain. How did you find it?

[Adam Majewski]

I have found it with google .
Please look also here :
http://en.wikibooks.org/wiki/Fractals/Iterations_in_the_complex_plane/Julia_set

Adam

[knighty]

Well... I'll have to improve my "googling" skills.
So you are the author of that wikibook! Excellent! Thank you for citing this thread. Just one note: the formula I've found is exactly the same as Stroh's. Moreover he had mathematically justified and generalized it.
BTW welcome to FF.

[Adam Majewski]

>So you are the author of that wikibook!
I started only some pages not the whole book.
Note that I use code made by other people so there are more authors.




>Excellent! Thank you for citing this thread. Just one note: the formula I've found is exactly the same as Stroh's
You can edit and change it or add new things.
There are many (new or old but hard to implement) algorithms even in case of http://en.wikipedia.org/wiki/Complex_quadratic_polynomial
Help is wellcome 

[knighty]

Thank you for the invitation.