Pileus Git - grits/blob - src/roam.c

   1 /*
   2  * Copyright (C) 2009 Andy Spencer <spenceal@rose-hulman.edu>
   3  *
   4  * This program is free software: you can redistribute it and/or modify
   5  * it under the terms of the GNU General Public License as published by
   6  * the Free Software Foundation, either version 3 of the License, or
   7  * (at your option) any later version.
   8  *
   9  * This program is distributed in the hope that it will be useful,
  10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12  * GNU General Public License for more details.
  13  *
  14  * You should have received a copy of the GNU General Public License
  15  * along with this program.  If not, see <http://www.gnu.org/licenses/>.
  16  */
  17
  18 #include <glib.h>
  19 #include <math.h>
  20 #include <string.h>
  21 #include "gpqueue.h"
  22 #include <GL/gl.h>
  23 #include <GL/glu.h>
  24
  25 #include "gis-world.h"
  26
  27 #include "roam.h"
  28
  29
  30 /**
  31  * TODO:
  32  *   - Optimize for memory consumption
  33  *   - Profile for computation speed
  34  *   - Target polygon count/detail
  35  */
  36
  37 /* Misc */
  38 RoamView *roam_view_new()
  39 {
  40         return g_new0(RoamView, 1);
  41 }
  42 void roam_view_update(RoamView *view)
  43 {
  44         glGetDoublev (GL_MODELVIEW_MATRIX,  view->model);
  45         glGetDoublev (GL_PROJECTION_MATRIX, view->proj);
  46         glGetIntegerv(GL_VIEWPORT,          view->view);
  47         view->version++;
  48 }
  49
  50 /* For GPQueue comparators */
  51 static gint tri_cmp(RoamTriangle *a, RoamTriangle *b, gpointer data)
  52 {
  53         if      (a->error < b->error) return  1;
  54         else if (a->error > b->error) return -1;
  55         else                          return  0;
  56 }
  57 static gint dia_cmp(RoamDiamond *a, RoamDiamond *b, gpointer data)
  58 {
  59         if      (a->error < b->error) return -1;
  60         else if (a->error > b->error) return  1;
  61         else                          return  0;
  62 }
  63
  64 /*************
  65  * RoamPoint *
  66  *************/
  67 RoamPoint *roam_point_new(gdouble x, gdouble y, gdouble z)
  68 {
  69         RoamPoint *self = g_new0(RoamPoint, 1);
  70         self->x = x;
  71         self->y = y;
  72         self->z = z;
  73         /* For get_intersect */
  74         xyz2ll(x, y, z, &self->lat, &self->lon);
  75         return self;
  76 }
  77 RoamPoint *roam_point_dup(RoamPoint *self)
  78 {
  79         RoamPoint *new = g_memdup(self, sizeof(RoamPoint));
  80         new->tris = 0;
  81         return new;
  82 }
  83 void roam_point_add_triangle(RoamPoint *self, RoamTriangle *triangle)
  84 {
  85         for (int i = 0; i < 3; i++) {
  86                 self->norm[i] *= self->tris;
  87                 self->norm[i] += triangle->norm[i];
  88         }
  89         self->tris++;
  90         for (int i = 0; i < 3; i++)
  91                 self->norm[i] /= self->tris;
  92 }
  93 void roam_point_remove_triangle(RoamPoint *self, RoamTriangle *triangle)
  94 {
  95         for (int i = 0; i < 3; i++) {
  96                 self->norm[i] *= self->tris;
  97                 self->norm[i] -= triangle->norm[i];
  98         }
  99         self->tris--;
 100         if (self->tris)
 101                 for (int i = 0; i < 3; i++)
 102                         self->norm[i] /= self->tris;
 103 }
 104 void roam_point_update_height(RoamPoint *self)
 105 {
 106         if (self->height_func) {
 107                 gdouble elev = self->height_func(
 108                                 self->lat, self->lon, self->height_data);
 109                 lle2xyz(self->lat, self->lon, elev,
 110                                 &self->x, &self->y, &self->z);
 111         } else {
 112                 gdouble dist = sqrt(self->x * self->x +
 113                                     self->y * self->y +
 114                                     self->z * self->z);
 115                 self->x = self->x/dist * EARTH_R;
 116                 self->y = self->y/dist * EARTH_R;
 117                 self->z = self->z/dist * EARTH_R;
 118         }
 119 }
 120 void roam_point_update_projection(RoamPoint *self, RoamSphere *sphere)
 121 {
 122         static int count   = 0;
 123         static int version = 0;
 124         if (version != sphere->view->version) {
 125                 g_debug("Projected %d points", count);
 126                 count   = 0;
 127                 version = sphere->view->version;
 128         }
 129
 130         if (self->pversion != sphere->view->version) {
 131                 /* Cache projection */
 132                 gluProject(self->x, self->y, self->z,
 133                         sphere->view->model, sphere->view->proj, sphere->view->view,
 134                         &self->px, &self->py, &self->pz);
 135                 self->pversion = sphere->view->version;
 136                 count++;
 137         }
 138 }
 139
 140 /****************
 141  * RoamTriangle *
 142  ****************/
 143 RoamTriangle *roam_triangle_new(RoamPoint *l, RoamPoint *m, RoamPoint *r)
 144 {
 145         RoamTriangle *self = g_new0(RoamTriangle, 1);
 146
 147         self->error = 0;
 148         self->p.l = l;
 149         self->p.m = m;
 150         self->p.r = r;
 151         self->split = roam_point_new(
 152                 (l->x + r->x)/2,
 153                 (l->y + r->y)/2,
 154                 (l->z + r->z)/2);
 155         /* TODO: Move this back to sphere, or actually use the nesting */
 156         self->split->height_func = m->height_func;
 157         self->split->height_data = m->height_data;
 158         roam_point_update_height(self->split);
 159         //if ((float)self->split->lat > 44 && (float)self->split->lat < 46)
 160         //      g_debug("RoamTriangle: new - (l,m,r,split).lats = %7.2f %7.2f %7.2f %7.2f",
 161         //                      l->lat, m->lat, r->lat, self->split->lat);
 162         //if ((float)l->lat == (float)r->lat &&
 163         //    (float)self->split->lat != (float)l->lat)
 164         //      g_warning("RoamTriangle: new - split.lat=%f != (l=r).lat=%f",
 165         //              self->split->lat, l->lat);
 166
 167         /* Update normal */
 168         double pa[3];
 169         double pb[3];
 170         pa[0] = self->p.l->x - self->p.m->x;
 171         pa[1] = self->p.l->y - self->p.m->y;
 172         pa[2] = self->p.l->z - self->p.m->z;
 173
 174         pb[0] = self->p.r->x - self->p.m->x;
 175         pb[1] = self->p.r->y - self->p.m->y;
 176         pb[2] = self->p.r->z - self->p.m->z;
 177
 178         self->norm[0] = pa[1] * pb[2] - pa[2] * pb[1];
 179         self->norm[1] = pa[2] * pb[0] - pa[0] * pb[2];
 180         self->norm[2] = pa[0] * pb[1] - pa[1] * pb[0];
 181
 182         double total = sqrt(self->norm[0] * self->norm[0] +
 183                             self->norm[1] * self->norm[1] +
 184                             self->norm[2] * self->norm[2]);
 185
 186         self->norm[0] /= total;
 187         self->norm[1] /= total;
 188         self->norm[2] /= total;
 189
 190         /* Store bounding box, for get_intersect */
 191         RoamPoint *m1 = roam_point_new((l->x+m->x)/2, (l->y+m->y)/2, (l->z+m->z)/2);
 192         RoamPoint *m2 = roam_point_new((m->x+r->x)/2, (m->y+r->y)/2, (m->z+r->z)/2);
 193         RoamPoint *m3 = roam_point_new((r->x+l->x)/2, (r->y+l->y)/2, (r->z+l->z)/2);
 194         RoamPoint *p[] = {l,m,r,m1,m2,m3};
 195         self->edge.n =  -90; self->edge.s =  90;
 196         self->edge.e = -180; self->edge.w = 180;
 197         gboolean maxed = FALSE;
 198         for (int i = 0; i < G_N_ELEMENTS(p); i++) {
 199                 self->edge.n = MAX(self->edge.n, p[i]->lat);
 200                 self->edge.s = MIN(self->edge.s, p[i]->lat);
 201                 if (p[i]->lat == 90 || p[i]->lat == -90)
 202                         continue;
 203                 if (p[i]->lon == 180) {
 204                         maxed = TRUE;
 205                         continue;
 206                 }
 207                 self->edge.e = MAX(self->edge.e, p[i]->lon);
 208                 self->edge.w = MIN(self->edge.w, p[i]->lon);
 209         }
 210         if (maxed) {
 211                 if (self->edge.e < 0)
 212                         self->edge.w = -180;
 213                 else
 214                         self->edge.e =  180;
 215         }
 216         g_free(m1);
 217         g_free(m2);
 218         g_free(m3);
 219
 220         //g_message("roam_triangle_new: %p", self);
 221         return self;
 222 }
 223
 224 void roam_triangle_free(RoamTriangle *self)
 225 {
 226         g_free(self->split);
 227         g_free(self);
 228 }
 229
 230 void roam_triangle_add(RoamTriangle *self,
 231                 RoamTriangle *left, RoamTriangle *base, RoamTriangle *right,
 232                 RoamSphere *sphere)
 233 {
 234         self->t.l = left;
 235         self->t.b = base;
 236         self->t.r = right;
 237
 238         roam_point_add_triangle(self->p.l, self);
 239         roam_point_add_triangle(self->p.m, self);
 240         roam_point_add_triangle(self->p.r, self);
 241
 242         if (sphere->view)
 243                 roam_triangle_update_errors(self, sphere);
 244
 245         self->handle = g_pqueue_push(sphere->triangles, self);
 246 }
 247
 248 void roam_triangle_remove(RoamTriangle *self, RoamSphere *sphere)
 249 {
 250         /* Update vertex normals */
 251         roam_point_remove_triangle(self->p.l, self);
 252         roam_point_remove_triangle(self->p.m, self);
 253         roam_point_remove_triangle(self->p.r, self);
 254
 255         g_pqueue_remove(sphere->triangles, self->handle);
 256 }
 257
 258 void roam_triangle_sync_neighbors(RoamTriangle *new, RoamTriangle *old, RoamTriangle *neigh)
 259 {
 260         if      (neigh->t.l == old) neigh->t.l = new;
 261         else if (neigh->t.b == old) neigh->t.b = new;
 262         else if (neigh->t.r == old) neigh->t.r = new;
 263         else g_assert_not_reached();
 264 }
 265
 266 gboolean roam_point_visible(RoamPoint *self, RoamSphere *sphere)
 267 {
 268         gint *view = sphere->view->view;
 269         return self->px > view[0] && self->px < view[2] &&
 270                self->py > view[1] && self->py < view[3] &&
 271                self->pz > 0       && self->pz < 1;
 272 }
 273 gboolean roam_triangle_visible(RoamTriangle *self, RoamSphere *sphere)
 274 {
 275         /* Do this with a bounding box */
 276         return roam_point_visible(self->p.l, sphere) ||
 277                roam_point_visible(self->p.m, sphere) ||
 278                roam_point_visible(self->p.r, sphere);
 279 }
 280
 281 void roam_triangle_update_errors(RoamTriangle *self, RoamSphere *sphere)
 282 {
 283         /* Update points */
 284         roam_point_update_projection(self->p.l, sphere);
 285         roam_point_update_projection(self->p.m, sphere);
 286         roam_point_update_projection(self->p.r, sphere);
 287
 288         /* Not exactly correct, could be out on both sides (middle in) */
 289         if (!roam_triangle_visible(self, sphere)) {
 290                 self->error = -1;
 291         } else {
 292                 roam_point_update_projection(self->split, sphere);
 293                 RoamPoint *l = self->p.l;
 294                 RoamPoint *m = self->p.m;
 295                 RoamPoint *r = self->p.r;
 296                 RoamPoint *split = self->split;
 297
 298                 /*               l-r midpoint        projected l-r midpoint */
 299                 gdouble pxdist = (l->px + r->px)/2 - split->px;
 300                 gdouble pydist = (l->py + r->py)/2 - split->py;
 301
 302                 self->error = sqrt(pxdist*pxdist + pydist*pydist);
 303
 304                 /* Multiply by size of triangle */
 305                 double size = -( l->px * (m->py - r->py) +
 306                                  m->px * (r->py - l->py) +
 307                                  r->px * (l->py - m->py) ) / 2.0;
 308
 309                 /* Size < 0 == backface */
 310                 //if (size < 0)
 311                 //      self->error *= -1;
 312                 self->error *= size;
 313         }
 314 }
 315
 316 void roam_triangle_split(RoamTriangle *self, RoamSphere *sphere)
 317 {
 318         //g_message("roam_triangle_split: %p, e=%f\n", self, self->error);
 319
 320         sphere->polys += 2;
 321
 322         if (self != self->t.b->t.b)
 323                 roam_triangle_split(self->t.b, sphere);
 324
 325         RoamTriangle *base = self->t.b;
 326
 327         /* Add new triangles */
 328         RoamPoint *mid = self->split;
 329         RoamTriangle *sl = self->kids[0] = roam_triangle_new(self->p.m, mid, self->p.l); // Self Left
 330         RoamTriangle *sr = self->kids[1] = roam_triangle_new(self->p.r, mid, self->p.m); // Self Right
 331         RoamTriangle *bl = base->kids[0] = roam_triangle_new(base->p.m, mid, base->p.l); // Base Left
 332         RoamTriangle *br = base->kids[1] = roam_triangle_new(base->p.r, mid, base->p.m); // Base Right
 333
 334         /*                tri,l,  base,      r,  sphere */
 335         roam_triangle_add(sl, sr, self->t.l, br, sphere);
 336         roam_triangle_add(sr, bl, self->t.r, sl, sphere);
 337         roam_triangle_add(bl, br, base->t.l, sr, sphere);
 338         roam_triangle_add(br, sl, base->t.r, bl, sphere);
 339
 340         roam_triangle_sync_neighbors(sl, self, self->t.l);
 341         roam_triangle_sync_neighbors(sr, self, self->t.r);
 342         roam_triangle_sync_neighbors(bl, base, base->t.l);
 343         roam_triangle_sync_neighbors(br, base, base->t.r);
 344
 345         /* Remove old triangles */
 346         roam_triangle_remove(self, sphere);
 347         roam_triangle_remove(base, sphere);
 348
 349         /* Add/Remove diamonds */
 350         RoamDiamond *diamond = roam_diamond_new(self, base, sl, sr, bl, br);
 351         roam_diamond_update_errors(diamond, sphere);
 352         roam_diamond_add(diamond, sphere);
 353         roam_diamond_remove(self->parent, sphere);
 354         roam_diamond_remove(base->parent, sphere);
 355 }
 356
 357 void roam_triangle_draw(RoamTriangle *self)
 358 {
 359         glBegin(GL_TRIANGLES);
 360         glNormal3dv(self->p.r->norm); glVertex3dv((double*)self->p.r);
 361         glNormal3dv(self->p.m->norm); glVertex3dv((double*)self->p.m);
 362         glNormal3dv(self->p.l->norm); glVertex3dv((double*)self->p.l);
 363         glEnd();
 364         return;
 365 }
 366
 367 void roam_triangle_draw_normal(RoamTriangle *self)
 368 {
 369         double center[] = {
 370                 (self->p.l->x + self->p.m->x + self->p.r->x)/3.0,
 371                 (self->p.l->y + self->p.m->y + self->p.r->y)/3.0,
 372                 (self->p.l->z + self->p.m->z + self->p.r->z)/3.0,
 373         };
 374         double end[] = {
 375                 center[0]+self->norm[0]*2000000,
 376                 center[1]+self->norm[1]*2000000,
 377                 center[2]+self->norm[2]*2000000,
 378         };
 379         glBegin(GL_LINES);
 380         glVertex3dv(center);
 381         glVertex3dv(end);
 382         glEnd();
 383 }
 384
 385 /***************
 386  * RoamDiamond *
 387  ***************/
 388 RoamDiamond *roam_diamond_new(
 389                 RoamTriangle *parent0, RoamTriangle *parent1,
 390                 RoamTriangle *kid0, RoamTriangle *kid1,
 391                 RoamTriangle *kid2, RoamTriangle *kid3)
 392 {
 393         RoamDiamond *self = g_new0(RoamDiamond, 1);
 394
 395         self->kids[0] = kid0;
 396         self->kids[1] = kid1;
 397         self->kids[2] = kid2;
 398         self->kids[3] = kid3;
 399
 400         kid0->parent = self;
 401         kid1->parent = self;
 402         kid2->parent = self;
 403         kid3->parent = self;
 404
 405         self->parents[0] = parent0;
 406         self->parents[1] = parent1;
 407
 408         return self;
 409 }
 410 void roam_diamond_add(RoamDiamond *self, RoamSphere *sphere)
 411 {
 412         self->active = TRUE;
 413         self->error  = MAX(self->parents[0]->error, self->parents[1]->error);
 414         self->handle = g_pqueue_push(sphere->diamonds, self);
 415 }
 416 void roam_diamond_remove(RoamDiamond *self, RoamSphere *sphere)
 417 {
 418         if (self && self->active) {
 419                 self->active = FALSE;
 420                 g_pqueue_remove(sphere->diamonds, self->handle);
 421         }
 422 }
 423 void roam_diamond_merge(RoamDiamond *self, RoamSphere *sphere)
 424 {
 425         //g_message("roam_diamond_merge: %p, e=%f\n", self, self->error);
 426
 427         sphere->polys -= 2;
 428
 429         /* TODO: pick the best split */
 430         RoamTriangle **kids = self->kids;
 431
 432         /* Create triangles */
 433         RoamTriangle *tri  = self->parents[0];
 434         RoamTriangle *base = self->parents[1];
 435
 436         roam_triangle_add(tri,  kids[0]->t.b, base, kids[1]->t.b, sphere);
 437         roam_triangle_add(base, kids[2]->t.b, tri,  kids[3]->t.b, sphere);
 438
 439         roam_triangle_sync_neighbors(tri,  kids[0], kids[0]->t.b);
 440         roam_triangle_sync_neighbors(tri,  kids[1], kids[1]->t.b);
 441         roam_triangle_sync_neighbors(base, kids[2], kids[2]->t.b);
 442         roam_triangle_sync_neighbors(base, kids[3], kids[3]->t.b);
 443
 444         /* Remove triangles */
 445         roam_triangle_remove(kids[0], sphere);
 446         roam_triangle_remove(kids[1], sphere);
 447         roam_triangle_remove(kids[2], sphere);
 448         roam_triangle_remove(kids[3], sphere);
 449
 450         /* Clear kids */
 451         tri->kids[0]  = tri->kids[1]  = NULL;
 452         base->kids[0] = base->kids[1] = NULL;
 453
 454         /* Add/Remove triangles */
 455         if (tri->t.l->t.l == tri->t.r->t.r &&
 456             tri->t.l->t.l != tri && tri->parent) {
 457                 roam_diamond_update_errors(tri->parent, sphere);
 458                 roam_diamond_add(tri->parent, sphere);
 459         }
 460
 461         if (base->t.l->t.l == base->t.r->t.r &&
 462             base->t.l->t.l != base && base->parent) {
 463                 roam_diamond_update_errors(base->parent, sphere);
 464                 roam_diamond_add(base->parent, sphere);
 465         }
 466
 467         /* Remove and free diamond and child triangles */
 468         roam_diamond_remove(self, sphere);
 469         g_assert(self->kids[0]->p.m == self->kids[1]->p.m &&
 470                  self->kids[1]->p.m == self->kids[2]->p.m &&
 471                  self->kids[2]->p.m == self->kids[3]->p.m);
 472         g_assert(self->kids[0]->p.m->tris == 0);
 473         roam_triangle_free(self->kids[0]);
 474         roam_triangle_free(self->kids[1]);
 475         roam_triangle_free(self->kids[2]);
 476         roam_triangle_free(self->kids[3]);
 477         g_free(self);
 478 }
 479 void roam_diamond_update_errors(RoamDiamond *self, RoamSphere *sphere)
 480 {
 481         roam_triangle_update_errors(self->parents[0], sphere);
 482         roam_triangle_update_errors(self->parents[1], sphere);
 483         self->error = MAX(self->parents[0]->error, self->parents[1]->error);
 484 }
 485
 486 /**************
 487  * RoamSphere *
 488  **************/
 489 RoamSphere *roam_sphere_new()
 490 {
 491         RoamSphere *self = g_new0(RoamSphere, 1);
 492         self->polys       = 8;
 493         self->triangles   = g_pqueue_new((GCompareDataFunc)tri_cmp, NULL);
 494         self->diamonds    = g_pqueue_new((GCompareDataFunc)dia_cmp, NULL);
 495
 496         RoamPoint *vertexes[] = {
 497                 roam_point_new( 0, 1, 0), // 0
 498                 roam_point_new( 0,-1, 0), // 1
 499                 roam_point_new( 0, 0, 1), // 2
 500                 roam_point_new( 1, 0, 0), // 3
 501                 roam_point_new( 0, 0,-1), // 4
 502                 roam_point_new(-1, 0, 0), // 5
 503         };
 504         int _triangles[][2][3] = {
 505                 /*lv mv rv   ln, bn, rn */
 506                 {{2,0,3}, {3, 4, 1}}, // 0
 507                 {{3,0,4}, {0, 5, 2}}, // 1
 508                 {{4,0,5}, {1, 6, 3}}, // 2
 509                 {{5,0,2}, {2, 7, 0}}, // 3
 510                 {{3,1,2}, {5, 0, 7}}, // 4
 511                 {{4,1,3}, {6, 1, 4}}, // 5
 512                 {{5,1,4}, {7, 2, 5}}, // 6
 513                 {{2,1,5}, {4, 3, 6}}, // 7
 514         };
 515
 516         for (int i = 0; i < 6; i++)
 517                 roam_point_update_height(vertexes[i]);
 518         for (int i = 0; i < 8; i++)
 519                 self->roots[i] = roam_triangle_new(
 520                         vertexes[_triangles[i][0][0]],
 521                         vertexes[_triangles[i][0][1]],
 522                         vertexes[_triangles[i][0][2]]);
 523         for (int i = 0; i < 8; i++)
 524                 roam_triangle_add(self->roots[i],
 525                         self->roots[_triangles[i][1][0]],
 526                         self->roots[_triangles[i][1][1]],
 527                         self->roots[_triangles[i][1][2]],
 528                         self);
 529         for (int i = 0; i < 8; i++)
 530                 g_debug("RoamSphere: new - %p edge=%f,%f,%f,%f", self->roots[i],
 531                                 self->roots[i]->edge.n,
 532                                 self->roots[i]->edge.s,
 533                                 self->roots[i]->edge.e,
 534                                 self->roots[i]->edge.w);
 535
 536         return self;
 537 }
 538 void roam_sphere_update_errors(RoamSphere *self)
 539 {
 540         g_debug("RoamSphere: update_errors - polys=%d", self->polys);
 541         if (!self->view)
 542                 self->view = roam_view_new();
 543         roam_view_update(self->view);
 544
 545         GPtrArray *tris = g_pqueue_get_array(self->triangles);
 546         GPtrArray *dias = g_pqueue_get_array(self->diamonds);
 547
 548         for (int i = 0; i < tris->len; i++) {
 549                 RoamTriangle *tri = tris->pdata[i];
 550                 roam_triangle_update_errors(tri, self);
 551                 g_pqueue_priority_changed(self->triangles, tri->handle);
 552         }
 553
 554         for (int i = 0; i < dias->len; i++) {
 555                 RoamDiamond *dia = dias->pdata[i];
 556                 roam_diamond_update_errors(dia, self);
 557                 g_pqueue_priority_changed(self->diamonds, dia->handle);
 558         }
 559
 560         g_ptr_array_free(tris, TRUE);
 561         g_ptr_array_free(dias, TRUE);
 562 }
 563
 564 void roam_sphere_split_one(RoamSphere *self)
 565 {
 566         RoamTriangle *to_split = g_pqueue_peek(self->triangles);
 567         if (!to_split) return;
 568         roam_triangle_split(to_split, self);
 569 }
 570 void roam_sphere_merge_one(RoamSphere *self)
 571 {
 572         RoamDiamond *to_merge = g_pqueue_peek(self->diamonds);
 573         if (!to_merge) return;
 574         roam_diamond_merge(to_merge, self);
 575 }
 576 gint roam_sphere_split_merge(RoamSphere *self)
 577 {
 578         gint iters = 0, max_iters = 500;
 579         //gint target = 4000;
 580         gint target = 2000;
 581         //gint target = 500;
 582
 583         if (!self->view)
 584                 return 0;
 585
 586         if (target - self->polys > 100) {
 587                 //g_debug("RoamSphere: split_merge - Splitting %d - %d > 100", target, self->polys);
 588                 while (self->polys < target && iters++ < max_iters)
 589                         roam_sphere_split_one(self);
 590         }
 591
 592         if (self->polys - target > 100) {
 593                 //g_debug("RoamSphere: split_merge - Merging %d - %d > 100", self->polys, target);
 594                 while (self->polys > target && iters++ < max_iters)
 595                         roam_sphere_merge_one(self);
 596         }
 597
 598         while (((RoamTriangle*)g_pqueue_peek(self->triangles))->error >
 599                ((RoamDiamond *)g_pqueue_peek(self->diamonds ))->error &&
 600                iters++ < max_iters) {
 601                 //g_debug("RoamSphere: split_merge - Fixing 1 %f > %f && %d < %d",
 602                 //              ((RoamTriangle*)g_pqueue_peek(self->triangles))->error,
 603                 //              ((RoamDiamond *)g_pqueue_peek(self->diamonds ))->error,
 604                 //              iters-1, max_iters);
 605                 roam_sphere_merge_one(self);
 606                 roam_sphere_split_one(self);
 607         }
 608
 609         return iters;
 610 }
 611 void roam_sphere_draw(RoamSphere *self)
 612 {
 613         g_debug("RoamSphere: draw");
 614         g_pqueue_foreach(self->triangles, (GFunc)roam_triangle_draw, NULL);
 615 }
 616 void roam_sphere_draw_normals(RoamSphere *self)
 617 {
 618         g_debug("RoamSphere: draw_normal");
 619         g_pqueue_foreach(self->triangles, (GFunc)roam_triangle_draw_normal, NULL);
 620 }
 621 GList *_roam_sphere_get_leaves(RoamTriangle *tri, GList *list)
 622 {
 623         if (tri->kids[0] && tri->kids[1]) {
 624                 list = _roam_sphere_get_leaves(tri->kids[0], list);
 625                 list = _roam_sphere_get_leaves(tri->kids[1], list);
 626                 return list;
 627         } else {
 628                 return g_list_append(list, tri);
 629         }
 630 }
 631 GList *_roam_sphere_get_intersect_rec(RoamTriangle *tri, GList *list,
 632                 gdouble n, gdouble s, gdouble e, gdouble w)
 633 {
 634         gdouble tn = tri->edge.n;
 635         gdouble ts = tri->edge.s;
 636         gdouble te = tri->edge.e;
 637         gdouble tw = tri->edge.w;
 638
 639         gboolean debug = FALSE  &&
 640                 n==90 && s==45 && e==-90 && w==-180 &&
 641                 ts > 44 && ts < 46;
 642
 643         if (debug)
 644                 g_message("t=%p: %f < %f || %f > %f || %f < %f || %f > %f",
 645                             tri, tn,   s,   ts,   n,   te,   w,   tw,   e);
 646         if (tn < s || ts > n || te < w || tw > e) {
 647                 /* No intersect */
 648                 if (debug) g_message("no intersect");
 649                 return list;
 650         } else if (tn < n && ts > s && te < e && tw > w) {
 651                 /* Triangle is completely contained */
 652                 if (debug) g_message("contained");
 653                 return _roam_sphere_get_leaves(tri, list);
 654         } else if (tri->kids[0] && tri->kids[1]) {
 655                 /* Paritial intersect with children */
 656                 if (debug) g_message("edge w/ child");
 657                 list = _roam_sphere_get_intersect_rec(tri->kids[0], list, n, s, e, w);
 658                 list = _roam_sphere_get_intersect_rec(tri->kids[1], list, n, s, e, w);
 659                 return list;
 660         } else {
 661                 /* This triangle is an edge case */
 662                 if (debug) g_message("edge");
 663                 return g_list_append(list, tri);
 664         }
 665 }
 666 GList *roam_sphere_get_intersect(RoamSphere *self,
 667                 gdouble n, gdouble s, gdouble e, gdouble w)
 668 {
 669         /* I think this is correct..
 670          * i_cost = cost for triangle-rectagnle intersect test
 671          * time = n_tiles * 2*tris_per_tile * i_cost
 672          * time = 30      * 2*333           * i_cost = 20000 * i_cost */
 673         GList *list = NULL;
 674         for (int i = 0; i < G_N_ELEMENTS(self->roots); i++)
 675                 list = _roam_sphere_get_intersect_rec(self->roots[i], list, n, s, e, w);
 676         return list;
 677 }
 678 void roam_sphere_free_tri(RoamTriangle *tri)
 679 {
 680         if (--tri->p.l->tris == 0) g_free(tri->p.l);
 681         if (--tri->p.m->tris == 0) g_free(tri->p.m);
 682         if (--tri->p.r->tris == 0) g_free(tri->p.r);
 683         roam_triangle_free(tri);
 684 }
 685 void roam_sphere_free(RoamSphere *self)
 686 {
 687         /* Slow method, but it should work */
 688         while (self->polys > 8)
 689                 roam_sphere_merge_one(self);
 690         /* TODO: free points */
 691         g_pqueue_foreach(self->triangles, (GFunc)roam_sphere_free_tri, NULL);
 692         g_pqueue_free(self->triangles);
 693         g_pqueue_free(self->diamonds);
 694         g_free(self->view);
 695         g_free(self);
 696 }