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