#include "mgraph.h"
-/* filled in by characterise_input: */
-static int shift, oldxbits, oldybits, oldx, oldy, oldsz, inc;
+#define OXBITS (XBITS-1)
+#define OX (1<<OXBITS)
+#define OY (Y/2 + 1)
+#define ON (OX*OY)
+#define INC 2
/* filled in by read_input: */
static struct Vertices all;
+static int computed_count[N];
+
+static void note_computed(int v, int k) {
+ assert(computed_count[v] == k);
+ computed_count[v]++;
+}
static void characterise_input(void) {
struct stat stab;
r= fstat(0,&stab); if (r) diee("fstat input to find length");
- if (!stab.st_size || stab.st_size % sizeof(double) ||
+ if (!stab.st_size || stab.st_size % (sizeof(double)*D3) ||
stab.st_size > INT_MAX)
- fail("input file is not reasonable whole number of doubles\n");
-
- oldsz= stab.st_size / sizeof(double);
- for (shift=1;
- shift > XBITS+1 && shift > YBITS+1;
- shift++) {
- oldxbits= XBITS-1;
- oldybits= YBITS-1;
- oldx= 1<<oldxbits;
- oldy= (1<<oldybits)-1;
- if (oldx*oldy == oldsz) goto found;
- }
- fail("input file size cannot be interpolated to target file size\n");
+ fail("input file is not reasonable whole number of vertices\n");
- found:
- inc= 1<<shift;
+ fprintf(stderr,"XBITS=%d XY=%d*%d=%d\n", XBITS, X,Y,N);
+ fprintf(stderr,"OXBITS=%d OXY=%d*%d=%d\n", OXBITS, OX,OY,ON);
+ fprintf(stderr,"sizeof(double)=%d st_size=%lu\n",
+ (int)sizeof(double), (unsigned long)stab.st_size);
+
+ if (stab.st_size != (ON*sizeof(double)*D3))
+ fail("input file wrong size\n");
}
static void read_input(void) {
- int x,y;
+ int x,y, ox,oy, v,ov;
- for (y=0; y<Y; y+=inc)
- for (x=0; x<X; x+=inc) {
+ for (oy=0; oy<OY; oy++) {
+ y= oy*2;
+ fprintf(stderr, "y=%2d>%2d", oy,y);
+ for (ox=0; ox<OX; ox++) {
+ x= ox*2 + (oy&1);
+ if (x>=X) { y= (Y-1)-y; x-=X; }
errno= 0;
- if (fread(all.a[(y << YSHIFT) | x], sizeof(double), D3, stdin) != D3)
- diee("read input");
+ ov= (oy << OXBITS) | ox;
+ v= (y << YSHIFT) | x;
+ fprintf(stderr, " 0%02o->0x%02x", ov, v);
+ if (fread(all.a[v], sizeof(double), D3, stdin) != D3)
+ diee("\nread input");
+ computed_count[v]= -1;
}
+ fputc('\n',stderr);
+ }
}
/* We use GSL's interpolation functions. Each xa array is simple
*
*/
-#define NEXTV (v= EDGE_END2(v,direction))
+typedef struct {
+ int v, e;
+} Traverse;
+
+static void traverse_next(Traverse *t) {
+ int v2;
+
+ if (t->v<0)
+ return;
+
+ v2= EDGE_END2(t->v, t->e);
+ if (v2>=0) {
+ int e2= edge_reverse(t->v, t->e);
+ assert(EDGE_END2(v2,e2) == t->v);
+ t->e= (e2+3) % V6;
+ }
+ t->v= v2;
+}
+
+static void interpolate(void) {
+ /* four points P Q R S, although P and S may be missing
+ * interpolate in QR finding M. */
+ int xq,yq,eqr, vp,vq,vm,vr,vs, k;
+ double pqtarg[D3], srtarg[D3];
+
+ for (eqr=1; eqr!=4; eqr+=5, eqr%=V6) { /* each old edge exactly once */
+ fprintf(stderr,"eqr=%d\n",eqr);
+ for (yq=0; yq<Y; yq+=INC) {
+ fprintf(stderr," yq=%2d ",yq);
+ for (xq=((yq>>1)&1); xq<X; xq+=INC) {
+ vq= yq << YSHIFT | xq;
+ Traverse trav; trav.v=vq; trav.e=eqr;
+
+ traverse_next(&trav);
+ vm= trav.v;
+ if (vm<0) continue;
+
+ traverse_next(&trav);
+ vr= trav.v;
+ assert(vr>=0);
+
+ traverse_next(&trav);
+ traverse_next(&trav);
+ vs= trav.v;
+
+ trav.v= vq; trav.e= EDGE_OPPOSITE(eqr);
+ traverse_next(&trav);
+ traverse_next(&trav);
+ vp= trav.v;
+
+ fprintf(stderr," 0x%02x-##-%02x-!%02x!-%02x-##-%02x",
+ vp&0xff,vq,vm,vr,vs&0xff);
+
+ if (vp>=0)
+ K pqtarg[k]= all.a[vq][k]*2 - all.a[vp][k];
+ else
+ K pqtarg[k]= all.a[vr][k];
+
+ if (vs>=0)
+ K srtarg[k]= all.a[vr][k]*2 - all.a[vs][k];
+ else
+ K srtarg[k]= all.a[vq][k];
+
+ K {
+ all.a[vm][k]= 0.5 * (all.a[vq][k] + all.a[vr][k]);
+// pqtarg[k]= 0.5 * (pqtarg[k] + all.a[vm][k]);
+// srtarg[k]= 0.5 * (srtarg[k] + all.a[vm][k]);
+// all.a[vm][k]= 0.5 * (pqtarg[k] + srtarg[k]);
+ note_computed(vm,k);
+ }
+ }
+ fputc('\n',stderr);
+ }
+ }
+}
+
+#if 0
static void interpolate_line(int startvertex,
int direction /* edge number */,
- int norig) {
- double xa[norig+1], ya[D3][norig+1], n;
+ int nmax) {
+ double xa[nmax], ya[D3][nmax];
const gsl_interp_type *it;
gsl_interp *interp;
gsl_interp_accel *accel;
- int i, v, k;
+ int i, k, nold, nnew;
+ Traverse traverse;
- for (i=0, v=startvertex;
+#define STARTV (traverse.v=startvertex, traverse.e=direction)
+#define NEXTV (traverse_next(&traverse), fprintf(stderr,"-%02x",traverse.v))
+
+ fprintf(stderr,"interpolate_line 0x%02x,%d nmax=%d ",
+ startvertex,direction,nmax);
+
+ for (i=0, STARTV;
;
- i++, NEXTV, assert(v>=0), NEXTV) {
- if (v<0)
- break;
- assert(i <= norig);
+ ) {
+ assert(traverse.v>=0);
+ assert(i < nmax);
xa[i]= i;
- K ya[k][i]= all.a[v][k];
- if (v==startvertex)
- break;
+ K ya[k][i]= all.a[traverse.v][k];
+ fputc('*',stderr);
+ if (i && traverse.v==startvertex) { fputc('@',stderr); break; }
+ i++;
+ NEXTV;
+ if (traverse.v<0) break;
+ NEXTV;
}
- n= i;
- it= v>=0 ? gsl_interp_cspline_periodic : gsl_interp_cspline;
+ if (traverse.v>=0) {
+ it= gsl_interp_akima_periodic;
+ nold= i+1;
+ nnew= i;
+ } else {
+ it= gsl_interp_akima;
+ nold= i;
+ nnew= i-1;
+ }
+
+ fprintf(stderr," n=%d->%d loop=0x%02x", nold,nnew,traverse.v);
K {
- interp= gsl_interp_alloc(it,n); if (!interp) diee("gsl_interp_alloc");
+ fprintf(stderr,"\n k=%d ", k);
+
+ interp= gsl_interp_alloc(it,nold); if (!interp) diee("gsl_interp_alloc");
accel= gsl_interp_accel_alloc(); if(!accel) diee("gsl_interp_accel_alloc");
- GA( gsl_interp_init(interp,xa,ya[k],n) );
+ GA( gsl_interp_init(interp,xa,ya[k],nold) );
- for (i=0, v=startvertex;
- i<n-1;
+ for (i=0, STARTV;
+ i<nnew;
i++, NEXTV) {
- assert(v>=0); NEXTV; assert(v>=0);
- GA( gsl_interp_eval_e(interp,xa,ya[k], i+0.5, accel, &all.a[v][k]) );
+ assert(traverse.v>=0); NEXTV; assert(traverse.v>=0);
+ fputc('#',stderr);
+ GA( gsl_interp_eval_e(interp,xa,ya[k], i+0.5, accel,
+ &all.a[traverse.v][k]) );
+ note_computed(traverse.v, k);
}
gsl_interp_accel_free(accel);
gsl_interp_free(interp);
}
+ fprintf(stderr," done\n");
}
static void interpolate(void) {
int x,y;
- if (shift!=1) fail("only interpolation by factor of 2 supported\n");
-
- for (y=0; y<Y; y+=inc) {
- interpolate_line(y<<YSHIFT, 0, oldx);
+ for (y=0; y<(Y+1)/2; y+=INC) {
+ interpolate_line(y<<YSHIFT, 0, OX*2+1);
}
- for (x=0; x<X; x+=inc) {
- interpolate_line(x, 5, oldy);
- interpolate_line(x, 4, oldy);
+ for (x=0; x<X; x+=INC) {
+ interpolate_line( x, 5, OY);
+ interpolate_line((Y-1)<<YSHIFT | x, 1, OY);
}
}
+#endif
static void write_output(void) {
+ int x, y, v, c, bad=0;
+ for (y=0; y<Y; y++) {
+ fprintf(stderr,"checking y=%d ", y);
+ for (x=0; x<X; x++) {
+ v= y<<YSHIFT | x;
+ fprintf(stderr," %02x",v);
+ c= computed_count[v];
+ if (c==D3) fputc('#',stderr);
+ else if (c==-1) fputc('*',stderr);
+ else { fprintf(stderr,"!%d",c); bad++; }
+ }
+ fputc('\n',stderr);
+ }
+ assert(!bad);
if (fwrite(all.a,sizeof(all.a),1,stdout) != 1) diee("fwrite");
+ fprintf(stderr,"interpolated\n");
}
int main(int argc, const char **argv) {
~ian / moebius2.git / blobdiff