summaryrefslogtreecommitdiff
path: root/Matgen
diff options
context:
space:
mode:
Diffstat (limited to 'Matgen')
-rw-r--r--Matgen/dither-distance.c99
-rw-r--r--Matgen/quickaspect.c179
-rw-r--r--Matgen/quickdistance.c165
3 files changed, 0 insertions, 443 deletions
diff --git a/Matgen/dither-distance.c b/Matgen/dither-distance.c
deleted file mode 100644
index 346840c..0000000
--- a/Matgen/dither-distance.c
+++ /dev/null
@@ -1,99 +0,0 @@
-/* Dither matrix generation */
-/* This program is written 2000 by Thomas Tonino. */
-/* It is placed in the public domain. */
-#include <stdio.h>
-#include <stdlib.h>
-#include <math.h>
-#include <time.h>
-
-#define HSIZE 73
-#define VSIZE 73
-#define HSIZE2 (HSIZE/2)
-#define VSIZE2 (VSIZE/2)
-#define TRUE 1
-#define FALSE 0
-/* X1, Y1, etc are initial bits to be set in the matrix. Choose well!! */
-#define X1 2
-#define Y1 1
-#define X2 48
-#define Y2 24
-#define X3 24
-#define Y3 49
-
-int main(void)
-{
-int x, y, xd, yd, i, j, bitcount, largehole, largetotal, result[HSIZE*VSIZE];
-float distance, thishole, maximum, total;
-int initial[HSIZE*VSIZE];
-
-/* Set up array with zeroes and a number of 'ones' */
-bitcount=0;
-for ( x=0; x<HSIZE; ++x )
- for ( y=0; y<VSIZE; ++y )
- {
- initial[x+y*HSIZE]=FALSE;
- result[x+y*HSIZE]=0;
- }
-
-initial[X1+Y1*HSIZE]=TRUE;
-result[X1+Y1*HSIZE]=bitcount++;
-initial[X2+Y2*HSIZE]=TRUE;
-result[X2+Y2*HSIZE]=bitcount++;
-initial[X3+Y3*HSIZE]=TRUE;
-result[X3+Y3*HSIZE]=bitcount++;
-
-while (bitcount < VSIZE*HSIZE)
- {
- maximum=0;
-/* Start looking for the largest hole */
- for ( i=0; i<HSIZE; ++i )
- for ( j=0; j<VSIZE; ++j )
- {
- total=0;
-/* check only if it is a hole right now */
- if (initial[i+j*HSIZE]==FALSE)
- {
- for ( x=0; x<HSIZE; ++x )
- for ( y=0; y<VSIZE; ++y )
-/* scan all positions, find distance, munge and add */
- if (initial[x+y*HSIZE]==TRUE)
- {
- xd = abs(x - i);
- yd = abs(y - j);
- if (xd > HSIZE2)
- xd = HSIZE - xd;
- if (yd > VSIZE2)
- yd = VSIZE - yd;
- distance = sqrt(xd*xd+yd*yd);
- total+=(1-1/distance);
- }
- if (total > maximum)
- {
-/* it is the largest so far */
- largetotal = i+j*HSIZE;
- maximum = total;
- }
- }
- }
-/* put a "1" in the largest hole */
- initial[largetotal] = TRUE;
- result[largetotal]=bitcount++;
-
-/* print the result so far */
- for ( i=0; i<HSIZE; ++i )
- {
- for ( j=0; j<VSIZE; ++j )
- if (initial[i+j*HSIZE])
- printf("@");
- else
- printf("-");
-
- printf("\n");
- }
- }
-/* print result */
-printf("\n\n");
-for (j=0; j<HSIZE*VSIZE; ++j)
- printf("%d, ",result[j]);
-printf("\n\n");
-}
diff --git a/Matgen/quickaspect.c b/Matgen/quickaspect.c
deleted file mode 100644
index 4fdcbbf..0000000
--- a/Matgen/quickaspect.c
+++ /dev/null
@@ -1,179 +0,0 @@
-/* This code is public domain. */
-/* Written by Thomas Tonino, year 2000 */
-#include <stdio.h>
-#include <stdlib.h>
-#include <math.h>
-#include <time.h>
-
-#define TRUE 1
-#define FALSE 0
-
-
-
-/*
-/* 257x257 matrix designed to be shifted 128 pixels right or down
- */
-#if 0
-#define HSIZE 257
-#define VSIZE 257
-#define ASPECT 1
-#define HSIZE2 (HSIZE/2)
-#define VSIZE2 (VSIZE/2)
-#define X1 0
-#define Y1 0
-#define X2 194
-#define Y2 65
-#define X3 96
-#define Y3 160
-#define X4 145
-#define Y4 209
-#endif
-
-
-
-/*
-/* 73x36 test matrix designed to be shifted 1/3 right or down
- */
-#if 1
-#define HSIZE 73
-#define VSIZE 36
-#define ASPECT 2
-#define HSIZE2 (HSIZE/2)
-#define VSIZE2 (VSIZE/2)
-#define X1 0
-#define Y1 0
-#define X2 37
-#define Y2 18
-#define X3 67
-#define Y3 21
-#define X4 18
-#define Y4 15
-#endif
-
-
-
-/*
-/* 367x179 matrix designed to be shifted 1/3 right or down
- */
-#if 0
-#define HSIZE 367
-#define VSIZE 179
-#define ASPECT 2
-#define HSIZE2 (HSIZE/2)
-#define VSIZE2 (VSIZE/2)
-#define X1 0
-#define Y1 0
-#define X2 184
-#define Y2 90
-#define X3 336
-#define Y3 104
-#define X4 92
-#define Y4 75
-#endif
-
-int main(void)
-{
-int bitcount, x, y, initial[HSIZE*VSIZE], result[HSIZE*VSIZE], hsearch, tmp, vsearch;
-int i, j, xp, yp, largetotal;
-double distance, total, maximum;
-srand48(time(NULL));
-bitcount=0;
-for ( x=0; x<HSIZE; ++x )
- for ( y=0; y<VSIZE; ++y )
- {
- initial[x+y*HSIZE]=FALSE;
- result[x+y*HSIZE]=0;
- }
-
-initial[X1+Y1*HSIZE]=TRUE;
-result[X1+Y1*HSIZE]=bitcount++;
-/* initial[X2+Y2*HSIZE]=TRUE;
-result[X2+Y2*HSIZE]=bitcount++;
-initial[X3+Y3*HSIZE]=TRUE;
-result[X3+Y3*HSIZE]=bitcount++;
-initial[X4+Y4*HSIZE]=TRUE;
-result[X4+Y4*HSIZE]=bitcount++; */
-
-while (bitcount < VSIZE*HSIZE)
- {
-/* 6 seems to give good results for multimplier, but smaller values are faster */
- hsearch=3*sqrt(VSIZE*HSIZE)/sqrt(bitcount);
- tmp=3*sqrt(VSIZE*HSIZE)/sqrt((VSIZE*HSIZE+1)-bitcount);
- if (tmp > hsearch)
- hsearch=tmp;
- vsearch=hsearch;
- if ( hsearch > HSIZE2 )
- hsearch = HSIZE2;
- if ( vsearch > VSIZE2 )
- vsearch = VSIZE2;
- maximum=0;
-/* Start looking for the largest hole */
- for ( i=0; i<HSIZE; ++i )
- for ( j=0; j<VSIZE; ++j )
- {
- total=0;
-/* check only if it is a hole right now */
- if (initial[i+j*HSIZE]==FALSE)
- {
- for ( x=-hsearch; x<hsearch; ++x )
- for ( y=-vsearch; y<vsearch; ++y )
-/* scan all positions, in distance v/hsearch from (i.j), munge and add */
- {
- xp = x + i;
- yp = y + j;
- if (xp >= HSIZE)
- xp = xp - HSIZE;
- if (xp < 0)
- xp = xp + HSIZE;
- if (yp >= VSIZE)
- yp = yp - VSIZE;
- if (yp < 0)
- yp = yp + VSIZE;
- if (initial[(xp+yp*HSIZE)]==TRUE)
- {
- distance = (x*x+y*y*ASPECT*ASPECT);
- total+=(1-1/distance);
- }
- else
- total+=1;
- }
-// The below value seems slightly noisy in darker tones, try adding less noise
- total += drand48()/(hsearch);
- if (total > maximum)
- {
-/* it is the largest so far */
- largetotal = i+j*HSIZE;
- maximum = total;
- }
- }
- }
-/* put a "1" in the largest hole */
- initial[largetotal] = TRUE;
- result[largetotal]=bitcount++;
-
-/* print the result so far */
- if ( bitcount % 3 == 0 )
- {
-// printf("%d of %d, scanning a %d size block\n",bitcount,VSIZE*HSIZE,hsearch);
- for ( i=0; i<HSIZE; ++i )
- {
- for ( j=0; j<VSIZE; ++j )
- if (initial[i+j*HSIZE])
- printf("@");
- else
- printf("-");
- for ( j=0; j<VSIZE; ++j )
- if (initial[i+j*HSIZE])
- printf("@");
- else
- printf("-");
- printf("\n");
- }
- }
- }
-/* print result */
-printf("\n\n");
-for (j=0; j<HSIZE*VSIZE; ++j)
- printf("%d, ",result[j]);
-printf("\n\n");
-}
diff --git a/Matgen/quickdistance.c b/Matgen/quickdistance.c
deleted file mode 100644
index 3923f9b..0000000
--- a/Matgen/quickdistance.c
+++ /dev/null
@@ -1,165 +0,0 @@
-/* This program is written 2000 by Thomas Tonino. */
-/* It is placed in the public domain. */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <math.h>
-#include <time.h>
-
-#define TRUE 1
-#define FALSE 0
-
-/* 199 size matrix designed to be re-used shifted 100 pixels
- * shifted right or down
- */
-#if 0
-#define HSIZE 199
-#define VSIZE 199
-#define HSIZE2 (HSIZE/2)
-#define VSIZE2 (VSIZE/2)
-#define X1 0
-#define Y1 0
-#define X2 150
-#define Y2 50
-#define X3 75
-#define Y3 124
-#define X4 112
-#define Y4 162
-#endif
-
-/* Another 199 size matrix designed to be re-used shifted 100 pixels
- * shifted right or down - should not interfere with the one above.
- */
-#if 0
-#define HSIZE 199
-#define VSIZE 199
-#define HSIZE2 (HSIZE/2)
-#define VSIZE2 (VSIZE/2)
-#define X1 38
-#define Y1 38
-#define X2 88
-#define Y2 188
-#define X3 162
-#define Y3 113
-#define X4 1
-#define Y4 150
-#endif
-
-/*
-/* 257x257 matrix designed to be shifted 128 pixels right or down
- */
-#if 1
-#define HSIZE 257
-#define VSIZE 257
-#define HSIZE2 (HSIZE/2)
-#define VSIZE2 (VSIZE/2)
-#define X1 0
-#define Y1 0
-#define X2 194
-#define Y2 65
-#define X3 96
-#define Y3 160
-#define X4 145
-#define Y4 209
-#endif
-int main(void)
-{
-int bitcount, x, y, initial[HSIZE*VSIZE], result[HSIZE*VSIZE], hsearch, tmp, vsearch;
-int i, j, xp, yp, largetotal;
-double distance, total, maximum;
-srand48(time(NULL));
-bitcount=0;
-for ( x=0; x<HSIZE; ++x )
- for ( y=0; y<VSIZE; ++y )
- {
- initial[x+y*HSIZE]=FALSE;
- result[x+y*HSIZE]=0;
- }
-
-initial[X1+Y1*HSIZE]=TRUE;
-result[X1+Y1*HSIZE]=bitcount++;
-initial[X2+Y2*HSIZE]=TRUE;
-result[X2+Y2*HSIZE]=bitcount++;
-initial[X3+Y3*HSIZE]=TRUE;
-result[X3+Y3*HSIZE]=bitcount++;
-initial[X4+Y4*HSIZE]=TRUE;
-result[X4+Y4*HSIZE]=bitcount++;
-
-while (bitcount < VSIZE*HSIZE)
- {
-/* 6 seems to give good results for multimplier, but smaller values are faster */
- hsearch=3*sqrt(VSIZE*HSIZE)/sqrt(bitcount);
- tmp=3*sqrt(VSIZE*HSIZE)/sqrt((VSIZE*HSIZE+1)-bitcount);
- if (tmp > hsearch)
- hsearch=tmp;
- vsearch=hsearch;
- if ( hsearch > HSIZE2 )
- hsearch = HSIZE2;
- if ( vsearch > VSIZE2 )
- vsearch = VSIZE2;
- maximum=0;
-/* Start looking for the largest hole */
- for ( i=0; i<HSIZE; ++i )
- for ( j=0; j<VSIZE; ++j )
- {
- total=0;
-/* check only if it is a hole right now */
- if (initial[i+j*HSIZE]==FALSE)
- {
- for ( x=-hsearch; x<hsearch; ++x )
- for ( y=-vsearch; y<vsearch; ++y )
-/* scan all positions, in distance v/hsearch from (i.j), munge and add */
- {
- xp = x + i;
- yp = y + j;
- if (xp >= HSIZE)
- xp = xp - HSIZE;
- if (xp < 0)
- xp = xp + HSIZE;
- if (yp >= VSIZE)
- yp = yp - VSIZE;
- if (yp < 0)
- yp = yp + VSIZE;
- if (initial[(xp+yp*HSIZE)]==TRUE)
- {
- distance = (x*x+y*y);
- total+=(1-1/distance);
- }
- else
- total+=1;
- }
-// The below value seems slightly noisy in darker tones, try adding less noise
- total += drand48()/(hsearch);
- if (total > maximum)
- {
-/* it is the largest so far */
- largetotal = i+j*HSIZE;
- maximum = total;
- }
- }
- }
-/* put a "1" in the largest hole */
- initial[largetotal] = TRUE;
- result[largetotal]=bitcount++;
-
-/* print the result so far */
- if ( bitcount % 100 == 0 )
- {
- printf("%d of %d, scanning a %d size block\n",bitcount,VSIZE*HSIZE,hsearch);
- for ( i=0; i<HSIZE; ++i )
- {
- for ( j=0; j<VSIZE; ++j )
- if (initial[i+j*HSIZE])
- printf("@");
- else
- printf("-");
- printf("\n");
- }
- }
- }
-/* print result */
-printf("\n\n");
-for (j=0; j<HSIZE*VSIZE; ++j)
- printf("%d, ",result[j]);
-printf("\n\n");
-}
generated by cgit v1.2.3 (git 2.25.1) at 2024-06-28 15:38:12 +0000