1-d B-B Spline Polynomial and Hilbert Scan for Graylevel Image Coding - Bezier and Splines in Image Processing and Machine Vision - page 59

y[j] =x1[i];
for (i=1; i < p; i++)
x1[i]=y[i];
/*——————seed filling——————-*/
for (i=1; i < p; i++)
x3[i]=x2[i];
/*——————find last copy—————-*/
for (i=1; i < p; i++) {

x4[i]=x2[i] -1;
if (x4[i] < 1)
x4[i]=x4[i]+4;
for (i=1; i < p; i++)

{

x4[i]=x4[i] + 2;
if (x4[i] > 4)
x4[i]=x4[i] - 4;
j=0;
for (i=p-1; i > 0; i-) {

++j;
y[j]=x4[i];
for (i=1; i < p; i++)
x4[i]=y[i];
/*—————-substitution——————-*/
x1[p]=1;
x2[p]=2;
x3[p]=3;
printf(”H-scan for level l = %d is: ”,l);
for (i=1; i < =p; i++)
printf(”%d”,x1[i]);
for (i=1; i < =p; i++)
printf(”%d”,x2[i]);
for (i=1; i < =p; i++)
printf(”%d”,x3[i]);
for (i=1; i < p; i++)
printf(”%d”,x4[i]);
/* —————-seed for the higher level——-*/
for (i=1; i < =p; i++)
y[i]=x1[i];
j=p;
for (i=1; i < = p ; i++)

{

++j;
y[j]=x2[i];