File:Target set for internal ray 0.ogv

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search
Original file(Ogg Theora video file, length 6.0 s, 1,000 × 1,000 pixels, 597 kbps)

Summary[edit]

Description
English: Filled Julia set and target set around fixed point for c along internal ray 0 of main cardioid of Mandelbrot set
Date
Source Own work
Author Adam majewski

Licensing[edit]

I, the copyright holder of this work, hereby publish it under the following license:
w:en:Creative Commons

attribution share alike

This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license.
You are free:
  • to share – to copy, distribute and transmit the work
  • to remix – to adapt the work
Under the following conditions:
  • attribution – You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
  • share alike – If you alter, transform, or build upon this work, you may distribute the resulting work only under the same or similar license to this one.

Compare with[edit]

C source code[edit]

/*
 
  c console program
  -----------------------------------------
  1.ppm file code is  based on the code of Claudio Rocchini
  http://en.wikipedia.org/wiki/Image:Color_complex_plot.jpg
  create 24 bit color graphic file ,  portable pixmap file = PPM 
  see http://en.wikipedia.org/wiki/Portable_pixmap
  to see the file use external application ( graphic viewer)
  I think that creating graphic can't be simpler
  ---------------------------
  2. first it creates data array which is used to store rgb color values of pixels,
  fills tha array with data and after that writes the data from array to pgm file.
  It alows free ( non sequential) acces to "pixels"
 
  -------------------------------------------
  Adam Majewski   fraktal.republika.pl 
 
  Sobel filter 
  Gh = sum of six values ( 3 values of matrix are equal to 0 ). Each value is = pixel_color * filter_coefficients 
 
 
  gcc ilsv.c -lm -Wall -o2
  gcc ilsv.c -lm -Wall -march=native
  time ./a.out
 
 
 
*/
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <complex.h>
#include <string.h>
 
/* iXmax/iYmax = 1 */
unsigned int iXmax = 1000; /* height of image in pixels */
unsigned int iYmax = 1000;
unsigned int iLength; 
/* fc(z) = z*z + c */
#define denominator 1 /* denominator of internal angle */
double CxMin = 0.000;
double CxMax =  0.25; /* C = Cx + Cy*i */
double Cx;
double stepCx;
double Cy =  0.0;
double AR = 0.2;  /* PixelWidth*1.5   radius of circle around attractor ZA = target set for attracting points */

//#define alfa (1-sqrt(1-4*Cx))/2 /* attracting or parabolic fixed point z = alfa */
//#define beta (1+sqrt(1-4*Cx))/2 /* repelling or parabolic fixed point z = beta */

/* color */
unsigned char color[]={0,247,181,255}; /* shades of gray used in image */
//unsigned char iExterior = 247;
//unsigned char iInterior = 255;
//unsigned char iPetal = 181;
//unsigned char iBoundary = 0;

const unsigned int MaxColorComponentValue=255; /* color component is coded from 0 to 255 ;  it is 8 bit color file */



 

 
 
/* find attractor ZA  using forward iteration of critical point Z = 0  */
/* if period is >1 gives one point from attracting cycle */
double complex GiveAttractor(double _Cx, double _Cy, double ER2, int _IterationMax)
{
  int Iteration;
  double Zx, Zy; /* z = zx+zy*i */
  double Zx2, Zy2; /* Zx2=Zx*Zx;  Zy2=Zy*Zy  */
  /* -- find attractor ZA  using forward iteration of critical point Z = 0  */
  Zx=0.0;
  Zy=0.0;
  Zx2=Zx*Zx;
  Zy2=Zy*Zy;
  for (Iteration=0;Iteration<_IterationMax && ((Zx2+Zy2)<ER2);Iteration++)
    {
      Zy=2*Zx*Zy + _Cy;
      Zx=Zx2-Zy2 + _Cx;
      Zx2=Zx*Zx;
      Zy2=Zy*Zy;
    };
  return Zx+Zy*I;
}
 



/* check the type of dynamic  */
int WhichSet(double _Zx0, double _Zy0,double C_x, double C_y, int iMax, double ER2, double _AR2, double _ZAx, double _ZAy, double DoublePixelSize )
{ 
  int i;
  double Zx, Zy; /* z = zx+zy*i */
  double Zx2, Zy2; /* Zx2=Zx*Zx;  Zy2=Zy*Zy  */
  double d, dX, dY; /* distance from z to finite attractor z=Alpha  */
  Zx=_Zx0; /* initial value of orbit  */
  Zy=_Zy0;
  Zx2=Zx*Zx;
  Zy2=Zy*Zy;
  // bailout test for escaping points
  for (i=0;i<100 ;i++)
    {
      Zy=2*Zx*Zy + C_y;
      Zx=Zx2-Zy2 +C_x;
      Zx2=Zx*Zx;
      Zy2=Zy*Zy;
      if ((Zx2+Zy2)>ER2) return 1 ; /* true exterior =point escape time to infinity */
     }
  // if not escapes = interior point 
   Zx=_Zx0; /* initial value of orbit  */
   Zy=_Zy0;
   dX=Zx-_ZAx;
   dY=Zy-_ZAy;
   d=dX*dX+dY*dY;
   if (d<= DoublePixelSize) return 0; // mark the attractor
   if (d<_AR2) return 2; // petal which is in interior
  else     return 3; // rest of interior ( or slowly escaping or boundary ) , not petal
}



 
/* gives position of point (iX,iY) in 1D array  ; uses also global variables */
unsigned int f(unsigned int _iX, unsigned int _iY)
{return (_iX + (iYmax-_iY-1)*iXmax );}


// save data array to pgm file 
int SavePGMFile(double Cx, unsigned char data[])
{
FILE * fp;
  char name [10]; /* name of file */
  sprintf(name,"%10.9f", Cx); /*  */
  char *filename =strcat(name,".pgm");
  char *comment="# ";/* comment should start with # */
  /* save image to the pgm file  */      
  fp= fopen(filename,"wb"); /*create new file,give it a name and open it in binary mode  */
  fprintf(fp,"P5\n %s\n %u %u\n %u\n",comment,iXmax,iYmax,MaxColorComponentValue);  /*write header to the file*/
  fwrite(data,iLength,1,fp);  /*write image data bytes to the file in one step */
  printf("File %s saved. \n", filename);
  fclose(fp);
  return 0;
}



 
/* --------------------------------------------------------------------------------------------------------- */
 
int main(){
 
 unsigned int nMax = 15; /* number of steps = number of images */
 unsigned int n;
 stepCx = (CxMax - CxMin)/ nMax;
 
  unsigned int iX,iY, /* indices of 2D virtual array (image) = integer coordinate */
    i; /* index of 1D array  */
    iLength = iXmax*iYmax;/* length of array in bytes = number of bytes = number of pixels of image * number of bytes of color */
  /* world ( double) coordinate = parameter plane*/
  const double dSide = 1.5;
  const double ZxMin=-dSide;
  const double ZxMax=dSide;
  const double ZyMin=-dSide;
  const double ZyMax=dSide;
  double PixelWidth=(ZxMax-ZxMin)/iXmax;
  double PixelHeight=(ZyMax-ZyMin)/iYmax;
  /* */
  double Zx, Zy;    /* Z=Zx+Zy*i   */
 //double alfa; // define alfa (1-sqrt(1-4*Cx))/2 /* attracting or parabolic fixed point z = alfa */
  double complex ZA;  /* atractor ZA = ZAx + ZAy*i */
  /* */
 
  const double EscapeRadius=2.0; /* radius of circle around origin; its complement is a target set for escaping points */
  double ER2=EscapeRadius*EscapeRadius;
  double AR2 = AR*AR; 
 
  const int IterationMax=1000,
            IterationMaxBig= 100000;
    
  /* sobel filter */
  unsigned char G, Gh, Gv; 
  
 
 
  /* dynamic 1D arrays for colors ( shades of gray ) */
  unsigned char *data, *edge;
  data = malloc( iLength * sizeof(unsigned char) );
  edge = malloc( iLength * sizeof(unsigned char) );
  if (data == NULL || edge==NULL)
    {
      fprintf(stderr," Could not allocate memory");
      getchar(); 
      return 1;
    }
  else printf(" memory is OK\n");
 
 
 
  for(n=0;Cx<CxMax;++n)
   {

   Cx = CxMin + n* stepCx;
  // alfa = (1-sqrt(1-4*Cx))/2 ; /* attracting or parabolic fixed point z = alfa */
 
  ZA = GiveAttractor( Cx, Cy, ER2, IterationMaxBig); /* find attractor ZA  using forward iteration of critical point Z = 0  */
 
 
 
 // printf(" fill the data array \n");
  for(iY=0;iY<iYmax;++iY){ 
    Zy=ZyMin + iY*PixelHeight; /*  */
    if (fabs(Zy)<PixelHeight/2) Zy=0.0; /*  */
   //printf(" row %u from %u \n",iY, iYmax); /* info */   
    for(iX=0;iX<iXmax;++iX){ 
      Zx=ZxMin + iX*PixelWidth;
      //eLastIteration = GiveExtLastIteration(Zx, Zy, Cx, Cy, IterationMax, ER2 );
      i= f(iX,iY); /* compute index of 1D array from indices of 2D array */
      data[i]= color[WhichSet(Zx, Zy, Cx, Cy, IterationMax,ER2, AR2, creal(ZA), cimag(ZA), PixelWidth/10.0)];
       
      /*  if (Zx>0 && Zy>0) data[i]=255-data[i];    check the orientation of Z-plane by marking first quadrant */




    }
  }
 
 
 // printf(" find boundaries in data array using  Sobel filter\n");   
 
  for(iY=1;iY<iYmax-1;++iY){ 
    for(iX=1;iX<iXmax-1;++iX){ 
      Gv= data[f(iX-1,iY+1)] + 2*data[f(iX,iY+1)] + data[f(iX-1,iY+1)] - data[f(iX-1,iY-1)] - 2*data[f(iX-1,iY)] - data[f(iX+1,iY-1)];
      Gh= data[f(iX+1,iY+1)] + 2*data[f(iX+1,iY)] + data[f(iX-1,iY-1)] - data[f(iX+1,iY-1)] - 2*data[f(iX-1,iY)] - data[f(iX-1,iY-1)];
      G = sqrt(Gh*Gh + Gv*Gv);
      i= f(iX,iY); /* compute index of 1D array from indices of 2D array */
      if (G==0) {edge[i]=255;} /* background */
      else {edge[i]=0;}  /* boundary */
    }
  }
 
    //printf(" copy boundaries from edge to data array \n");
    for(iY=1;iY<iYmax-1;++iY){ 
     for(iX=1;iX<iXmax-1;++iX)
      {i= f(iX,iY); /* compute index of 1D array from indices of 2D array */
    if (edge[i]==0) data[i]=0;}}
 
 
  /* ---------- file  -------------------------------------*/
  //printf(" save  data array to the file \n");
  SavePGMFile( Cx, data);


  } // for n ....
 
  /* --------------free memory ---------------------*/
  free(data);
  free(edge);
 
 
 
  return 0;
}

Bash source code[edit]

#!/bin/bash
 
# script file for BASH 
# which bash
# save this file as g
# chmod +x g
# ./g

i=0
# for all pgm files in this directory
for file in *.pgm ; do
  # b is name of file without extension
  b=$(basename $file .pgm)
  # change file name to integers and count files
  ((i= i+1))
  # convert from pgm to gif and add text ( level ) using ImageMagic
  convert $file -pointsize 50 -annotate +10+100 $b ${i}.gif
  echo $file
done
 
echo convert all gif files to one video file
# ffmpeg2theora %d.gif --framerate 5 --videoquality 9 -f webm --artist "Adam Majewski" -o o${i}.webm 
ffmpeg2theora %d.gif --framerate 5 --videoquality 9 -f ogv --artist "Adam Majewski" -o o${i}.ogv 


 
echo o${i} OK
# end

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current16:10, 26 February 20126.0 s, 1,000 × 1,000 (437 KB)Adam majewski (talk | contribs)better quolity ( more steps near boundary , between 0.24 and 0.25)
12:15, 25 February 20124.4 s, 1,000 × 1,000 (315 KB)Adam majewski (talk | contribs)
  • You cannot overwrite this file.

File usage on other wikis

The following other wikis use this file:

Transcode status

Update transcode status
FormatBitrateDownloadStatusEncode time
WebM 720P193 kbps
Download file
Completed 16:55, 13 November 20122.0 s
WebM 480P196 kbps
Download file
Completed 15:44, 10 November 20122.0 s
WebM 360P131 kbps
Download file
Completed 13:48, 19 November 20121.0 s
WebM 240P81 kbps
Download file
Completed 00:46, 14 February 20171.0 s
WebM 160P50 kbps
Download file
Completed 10:21, 14 February 20171.0 s

Metadata