Commit da1344e0 authored by Michael Niedermayer's avatar Michael Niedermayer

vsrc_mandelbrot: simplify second bailout search by not recalculating values.

Signed-off-by: 's avatarMichael Niedermayer <michaelni@gmx.at>
parent e749b378
...@@ -264,25 +264,22 @@ static void draw_mandelbrot(AVFilterContext *ctx, uint32_t *color, int linesize, ...@@ -264,25 +264,22 @@ static void draw_mandelbrot(AVFilterContext *ctx, uint32_t *color, int linesize,
Z_Z2_C_ZYKLUS(t, zi, zr, zi, 0) Z_Z2_C_ZYKLUS(t, zi, zr, zi, 0)
i++; i++;
Z_Z2_C_ZYKLUS(zr, zi, t, zi, 1) Z_Z2_C_ZYKLUS(zr, zi, t, zi, 1)
if(zr*zr + zi*zi > mb->bailout) if(zr*zr + zi*zi > mb->bailout){
break;
}
i-= FFMIN(7, i); i-= FFMIN(7, i);
for(; i<mb->maxiter; i++){
zr= mb->zyklus[i][0]; zr= mb->zyklus[i][0];
zi= mb->zyklus[i][1]; zi= mb->zyklus[i][1];
for(; i<mb->maxiter; i++){
double t;
if(zr*zr + zi*zi > mb->bailout){ if(zr*zr + zi*zi > mb->bailout){
switch(mb->outer){ switch(mb->outer){
case ITERATION_COUNT: zr = i - (SQR(zr-cr)+SQR(zi-ci) > SQR(mb->bailout)); break; case ITERATION_COUNT: zr = i; break;
case NORMALIZED_ITERATION_COUNT: zr= i + log2(log(mb->bailout) / log(zr*zr + zi*zi)); break; case NORMALIZED_ITERATION_COUNT: zr= i + log2(log(mb->bailout) / log(zr*zr + zi*zi)); break;
} }
c= lrintf((sin(zr)+1)*127) + lrintf((sin(zr/1.234)+1)*127)*256*256 + lrintf((sin(zr/100)+1)*127)*256; c= lrintf((sin(zr)+1)*127) + lrintf((sin(zr/1.234)+1)*127)*256*256 + lrintf((sin(zr/100)+1)*127)*256;
break; break;
} }
Z_Z2_C_ZYKLUS(t, zi, zr, zi, 0) }
i++; break;
Z_Z2_C_ZYKLUS(zr, zi, t, zi, 1) }
} }
if(!c){ if(!c){
if(mb->inner==PERIOD){ if(mb->inner==PERIOD){
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment