Fibonacci word fractal in C

/* Arithmos: deep-fibonacci-word-fractal
 * Compile: cc -std=c11 -O2 deep-fibonacci-word-fractal.c -lm -o deep-fibonacci-word-fractal
 * Run:     ./deep-fibonacci-word-fractal
 * Output:  deep-fibonacci-word-fractal.svg (open this file in a browser)
 * Optional output path: ./deep-fibonacci-word-fractal my-image.svg
 * Edit the constants in draw() to explore another case.
 */
#include <math.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

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,"<path d=\"M%.3f %.3f L%.3f %.3f\" fill=\"none\" stroke=\"%s\" stroke-opacity=\"%.3f\" stroke-width=\"%.3f\"/>\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,"<circle cx=\"%.3f\" cy=\"%.3f\" r=\"%.3f\" fill=\"%s\" fill-opacity=\"%.3f\"/>\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,"<circle cx=\"%.3f\" cy=\"%.3f\" r=\"%.3f\" fill=\"none\" stroke=\"%s\" stroke-opacity=\"%.3f\" stroke-width=\"%.3f\"/>\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,"<rect x=\"%.3f\" y=\"%.3f\" width=\"%.3f\" height=\"%.3f\" fill=\"%s\" fill-opacity=\"%.3f\"/>\n",x,y,w,h,color,alpha);
}
static inline void nt_text(double x,double y,const char *text) {
    fprintf(nt_out,"<text x=\"%.3f\" y=\"%.3f\" fill=\"#ededf3\" font-family=\"monospace\" font-size=\"16\">",x,y);
    for (;*text;text++) {
        if (*text=='&') fputs("&amp;",nt_out);
        else if (*text=='<') fputs("&lt;",nt_out);
        else if (*text=='>') fputs("&gt;",nt_out);
        else fputc(*text,nt_out);
    }
    fputs("</text>\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;}

/* Fibonacci word: 0->01, 1->0. Draw BEFORE each parity-dependent turn.
   Edit N; Fibonacci lengths such as 4181, 6765, 10946 give useful stages. */
static void draw(void) {
    enum { N=6765 };
    unsigned char *word=malloc(N), *next=malloc(N);
    int *px=malloc((N+1)*sizeof *px), *py=malloc((N+1)*sizeof *py);
    if (!word||!next||!px||!py) {
        free(word);free(next);free(px);free(py);
        nt_text(50,80,"Not enough memory for this segment count.");return;
    }
    word[0]=0;int len=1;
    while(len<N) {
        int m=0;
        for(int i=0;i<len&&m<N;++i) {
            next[m++]=0;if(word[i]==0&&m<N)next[m++]=1;
        }
        unsigned char *swap=word;word=next;next=swap;len=m;
    }
    const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
    int heading=0,xmin=0,xmax=0,ymin=0,ymax=0;px[0]=py[0]=0;
    for(int i=0;i<N;++i) {
        px[i+1]=px[i]+dx[heading];py[i+1]=py[i]+dy[heading];
        if(px[i+1]<xmin)xmin=px[i+1];if(px[i+1]>xmax)xmax=px[i+1];
        if(py[i+1]<ymin)ymin=py[i+1];if(py[i+1]>ymax)ymax=py[i+1];
        /* Positions are ONE-based: even zero turns left, odd zero right. */
        if(word[i]==0)heading=(heading+((i+1)%2==0?1:3))%4;
    }
    double scale=fmin(900/fmax(1,xmax-xmin),580/fmax(1,ymax-ymin));
    for(int i=0;i<N;++i)
        nt_line(500+(px[i]-(xmin+xmax)/2.0)*scale,340-(py[i]-(ymin+ymax)/2.0)*scale,
                500+(px[i+1]-(xmin+xmax)/2.0)*scale,340-(py[i+1]-(ymin+ymax)/2.0)*scale,
                i/(double)N,.92,.95);
    nt_text(50,675,"Each digit draws one exact unit step; zero then turns according to position parity.");
    free(word);free(next);free(px);free(py);
}

int main(int argc, char **argv) {
    if (argc > 2) {
        fprintf(stderr, "Usage: %s [OUTPUT.svg]\n", argv[0]);
        return EXIT_FAILURE;
    }
    const char *filename = argc == 2 ? argv[1] : "deep-fibonacci-word-fractal.svg";
    nt_out = fopen(filename, "wb");
    if (!nt_out) { perror(filename); return EXIT_FAILURE; }
    fputs("<svg xmlns=\"http://www.w3.org/2000/svg\" width=\"1000\" height=\"700\" viewBox=\"0 0 1000 700\">\n"
          "<rect width=\"1000\" height=\"700\" fill=\"#171721\"/>\n", nt_out);
    draw();
    fputs("</svg>\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;
}