X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=mash.cc;h=da376b5b5ed41f697581fd3cf742f96867b6e8aa;hb=a91daa533e1bd919ddcbc4a4ca82dff8705194c3;hp=6eafd6ce8d2f919fa07cbabd8b2d14517589ad3d;hpb=a64a278f99ec7cac490217370ccd8b59a7bef33d;p=universe.git diff --git a/mash.cc b/mash.cc index 6eafd6c..da376b5 100644 --- a/mash.cc +++ b/mash.cc @@ -1,4 +1,3 @@ -// -*- compile-command:"g++ -lX11 -Wall -g -O3 -o mash misc.o universe.o polygon.o mash.cc -L/usr/X11R6/lib/"; -*- #include #include @@ -15,7 +14,7 @@ using namespace std; #include "universe.h" int main(int argc, char **argv) { - int nb_heur = 100; + int nb_heur = 50; int w = 1000, h = 1000; Universe universe(nb_heur + 1, w, h); @@ -35,38 +34,97 @@ int main(int argc, char **argv) { ys[k] = scalar_t(h)/2 + radius * sin(-alpha); } Polygon *p; - p = new Polygon(1.0, 0.5, 0.5, 0.5, xs, ys, nb); + p = new Polygon(1.0, 0.0, 0.0, 0.0, xs, ys, nb); p->set_position(scalar_t(w/2), scalar_t(h) * 0.75, 0); p->set_speed(0, 0, 0); universe.initialize(p); universe.add_polygon(p); } - scalar_t xs[] = { -30, 30, 30, -30 }; - scalar_t ys[] = { -10, -10, 10, 10 }; - Polygon *blocks[nb_heur]; - for(int h = 0; h < nb_heur; h++) { - blocks[h] = new Polygon(1.0, 1.0, 1.0, 0.0, xs, ys, 4); + for(int i = 0; i < nb_heur; i++) { + + int nb_max_edges = 10; + int xt[nb_max_edges * nb_max_edges], yt[nb_max_edges * nb_max_edges]; + int used[nb_max_edges * nb_max_edges]; + int fail, x, y, n; + do { + fail = 0; + for(int k = 0; k < nb_max_edges * nb_max_edges; k++) { + used[k] = 0; + } + x = 0; y = 0; n = 0; + while(!used[x + nb_max_edges * y]) { + used[x + nb_max_edges * y] = 1; + xt[n] = x; yt[n] = y; + n++; + switch(int(drand48() * 4)) { + case 0: x++; break; + case 1: x--; break; + case 2: y++; break; + case 3: y--; break; + default: abort(); + } + if(x < 0) x = 0; + else if(x >= nb_max_edges) x = nb_max_edges-1; + if(y < 0) y = 0; + else if(y >= nb_max_edges) y = nb_max_edges-1; + } + fail = (n < 10) || (x != 0) || (y != 0); + } while(fail); + + scalar_t xs[nb_max_edges], ys[nb_max_edges]; + int nb_edges = 0; + for(int l = 0; l < n; l++) { + int pl = (l + n - 1)%n, nl = (l + 1)%n; + if(xt[nl] - xt[l] != xt[l] - xt[pl] || yt[nl] - yt[l] != yt[l] - yt[pl]) { + xs[nb_edges] = scalar_t(xt[l]) * 25; + ys[nb_edges] = scalar_t(yt[l]) * 25; + nb_edges++; + } + } + + cout << "n = " << n << " nb_edges = " << nb_edges << endl; + + scalar_t red, green, blue; + do { + red = scalar_t(16 * int(drand48() * 16))/255.0; + green = scalar_t(16 * int(drand48() * 16))/255.0; + blue = scalar_t(16 * int(drand48() * 16))/255.0; + } while((red > 0.1 && green > 0.1 && blue > 0.1) || + (red < 0.9 && green < 0.9 && blue < 0.9)); + blocks[i] = new Polygon(1.0, red, green, blue, xs, ys, nb_edges); do { - blocks[h]->set_position(drand48() * w, drand48() * h/10, M_PI * drand48()); - blocks[h]->set_speed(0, 0, 0); - } while(universe.collide(blocks[h])); - universe.initialize(blocks[h]); - universe.add_polygon(blocks[h]); + blocks[i]->set_position(drand48() * w * 0.9 + w * 0.05, drand48() * 3 * h / 4 + h/8, M_PI * drand48()); + blocks[i]->set_speed(0, 0, 0); + // universe.initialize(blocks[i]); + for(int j = 0; j < i + 1; j++) { + universe.initialize(blocks[j]); + } + } while(universe.collide(blocks[i])); + universe.add_polygon(blocks[i]); + cout << "added " << i+1 << " blocks." << endl; } - scalar_t dt = 0.01; + scalar_t dt = 0.1; - for(int n = 0; n < 1000; n++) { - for(int h = 0; h < nb_heur; h++) { - blocks[h]->apply_force(dt, blocks[h]->_center_x, blocks[h]->_center_y, 0, 10); + for(int n = 0; n < 100000; n++) { + for(int i = 0; i < nb_heur; i++) { + blocks[i]->apply_force(dt, blocks[i]->_center_x, blocks[i]->_center_y, 0, 0.25); } universe.update(dt); + if(n%1000 == 0) { + char buffer[1024]; + sprintf(buffer, "/tmp/mash_%06d.fig", n); + XFigTracer tracer(buffer); + universe.print_xfig(&tracer); + cout << "Wrote " << buffer << endl; + } } - ofstream os("/tmp/mash.fig"); - universe.print_fig(os); + XFigTracer tracer("/tmp/mash.fig"); + universe.print_xfig(&tracer); + exit(0); }