/* Arithmos: geo-pisanoTorus * Compile: cc -std=c11 -O2 geo-pisanoTorus.c -lm -o geo-pisanoTorus * Run: ./geo-pisanoTorus * Output: geo-pisanoTorus.svg (open this file in a browser) * Optional output path: ./geo-pisanoTorus my-image.svg * Edit the constants in draw() to explore another case. */ #include #include #include #include #include static FILE *nt_out; #define NT_PI 3.14159265358979323846 /* The small SVG writer keeps this program free of graphics dependencies. * Coordinates are pixels on a 1000 x 700 drawing surface. * t runs from 0 to 1 through mint, blue, rose, and gold. */ static inline void nt_color(double t, char hex[8]) { const double stops[4][3] = { {91,227,201}, {128,146,240}, {218,138,220}, {244,200,127} }; t = fmax(0.0, fmin(1.0,t)) * 3.0; int band = (int)fmin(2.0,floor(t)); double blend = t - band; int r[3]; for (int k=0;k<3;k++) r[k]=(int)lround(stops[band][k]*(1.0-blend)+stops[band+1][k]*blend); snprintf(hex,8,"#%02x%02x%02x",r[0],r[1],r[2]); } static inline void nt_line(double x,double y,double X,double Y,double t,double alpha,double width) { char color[8];nt_color(t,color); fprintf(nt_out,"\n",x,y,X,Y,color,alpha,width); } static inline void nt_dot(double x,double y,double r,double t,double alpha) { char color[8];nt_color(t,color); fprintf(nt_out,"\n",x,y,r,color,alpha); } static inline void nt_circle(double x,double y,double r,double t,double alpha,double width) { char color[8];nt_color(t,color); fprintf(nt_out,"\n",x,y,r,color,alpha,width); } static inline void nt_rect(double x,double y,double w,double h,double t,double alpha) { char color[8];nt_color(t,color); fprintf(nt_out,"\n",x,y,w,h,color,alpha); } static inline void nt_text(double x,double y,const char *text) { fprintf(nt_out,"",x,y); for (;*text;text++) { if (*text=='&') fputs("&",nt_out); else if (*text=='<') fputs("<",nt_out); else if (*text=='>') fputs(">",nt_out); else fputc(*text,nt_out); } fputs("\n",nt_out); } static inline int nt_gcd(int a,int b) {a=abs(a);b=abs(b);while(b){int r=a%b;a=b;b=r;}return a;} static inline int nt_prime(int n) {if(n<2)return 0;for(int d=2;d<=n/d;d++)if(n%d==0)return 0;return 1;} /* Edit MODULUS (2..180). Store Fibonacci PAIRS, stopping at the first repeated seed. */ static void draw(void) { const int MODULUS=97; int cap=6*MODULUS*MODULUS+2,n=1; int *a=malloc((size_t)cap*sizeof(int)),*b=malloc((size_t)cap*sizeof(int)); if(!a||!b){free(a);free(b);return;} a[0]=0;b[0]=1; do {a[n]=b[n-1];b[n]=(a[n-1]+b[n-1])%MODULUS;n++;}while((a[n-1]!=0||b[n-1]!=1)&&n 2) { fprintf(stderr, "Usage: %s [OUTPUT.svg]\n", argv[0]); return EXIT_FAILURE; } const char *filename = argc == 2 ? argv[1] : "geo-pisanoTorus.svg"; nt_out = fopen(filename, "wb"); if (!nt_out) { perror(filename); return EXIT_FAILURE; } fputs("\n" "\n", nt_out); draw(); fputs("\n", nt_out); int failed = ferror(nt_out); if (fclose(nt_out) != 0) failed = 1; if (failed) { fputs("Could not finish writing the image.\n", stderr); return EXIT_FAILURE; } printf("Wrote %s\n", filename); return EXIT_SUCCESS; }