2 * Copyright (C) 2009-2010 Andy Spencer <andy753421@gmail.com>
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.
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.
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/>.
30 * - Optimize for memory consumption
31 * - Profile for computation speed
32 * - Target polygon count/detail
35 /* For GPQueue comparators */
36 static gint tri_cmp(RoamTriangle *a, RoamTriangle *b, gpointer data)
38 if (a->error < b->error) return 1;
39 else if (a->error > b->error) return -1;
42 static gint dia_cmp(RoamDiamond *a, RoamDiamond *b, gpointer data)
44 if (a->error < b->error) return -1;
45 else if (a->error > b->error) return 1;
53 RoamPoint *roam_point_new(gdouble lat, gdouble lon, gdouble elev)
55 RoamPoint *self = g_new0(RoamPoint, 1);
59 /* For get_intersect */
60 lle2xyz(lat, lon, elev, &self->x, &self->y, &self->z);
63 RoamPoint *roam_point_dup(RoamPoint *self)
65 RoamPoint *new = g_memdup(self, sizeof(RoamPoint));
69 void roam_point_add_triangle(RoamPoint *self, RoamTriangle *triangle)
71 for (int i = 0; i < 3; i++) {
72 self->norm[i] *= self->tris;
73 self->norm[i] += triangle->norm[i];
76 for (int i = 0; i < 3; i++)
77 self->norm[i] /= self->tris;
79 void roam_point_remove_triangle(RoamPoint *self, RoamTriangle *triangle)
81 for (int i = 0; i < 3; i++) {
82 self->norm[i] *= self->tris;
83 self->norm[i] -= triangle->norm[i];
87 for (int i = 0; i < 3; i++)
88 self->norm[i] /= self->tris;
90 void roam_point_update_height(RoamPoint *self)
92 if (self->height_func) {
93 gdouble elev = self->height_func(
94 self->lat, self->lon, self->height_data);
95 lle2xyz(self->lat, self->lon, elev,
96 &self->x, &self->y, &self->z);
99 void roam_point_update_projection(RoamPoint *self, RoamSphere *sphere)
101 static int count = 0;
102 static int version = 0;
103 if (version != sphere->view->version) {
104 g_debug("Projected %d points", count);
106 version = sphere->view->version;
109 if (self->pversion != sphere->view->version) {
110 /* Cache projection */
111 gluProject(self->x, self->y, self->z,
112 sphere->view->model, sphere->view->proj, sphere->view->view,
113 &self->px, &self->py, &self->pz);
114 self->pversion = sphere->view->version;
122 RoamTriangle *roam_triangle_new(RoamPoint *l, RoamPoint *m, RoamPoint *r)
124 RoamTriangle *self = g_new0(RoamTriangle, 1);
130 self->split = roam_point_new(
132 (ABS(l->lat) == 90 ? r->lon :
133 ABS(r->lat) == 90 ? l->lon :
134 lon_avg(l->lon, r->lon)),
135 (l->elev + r->elev)/2);
136 /* TODO: Move this back to sphere, or actually use the nesting */
137 self->split->height_func = m->height_func;
138 self->split->height_data = m->height_data;
139 roam_point_update_height(self->split);
140 //if ((float)self->split->lat > 44 && (float)self->split->lat < 46)
141 // g_debug("RoamTriangle: new - (l,m,r,split).lats = %7.2f %7.2f %7.2f %7.2f",
142 // l->lat, m->lat, r->lat, self->split->lat);
143 //if ((float)l->lat == (float)r->lat &&
144 // (float)self->split->lat != (float)l->lat)
145 // g_warning("RoamTriangle: new - split.lat=%f != (l=r).lat=%f",
146 // self->split->lat, l->lat);
151 pa[0] = self->p.l->x - self->p.m->x;
152 pa[1] = self->p.l->y - self->p.m->y;
153 pa[2] = self->p.l->z - self->p.m->z;
155 pb[0] = self->p.r->x - self->p.m->x;
156 pb[1] = self->p.r->y - self->p.m->y;
157 pb[2] = self->p.r->z - self->p.m->z;
159 self->norm[0] = pa[1] * pb[2] - pa[2] * pb[1];
160 self->norm[1] = pa[2] * pb[0] - pa[0] * pb[2];
161 self->norm[2] = pa[0] * pb[1] - pa[1] * pb[0];
163 double total = sqrt(self->norm[0] * self->norm[0] +
164 self->norm[1] * self->norm[1] +
165 self->norm[2] * self->norm[2]);
167 self->norm[0] /= total;
168 self->norm[1] /= total;
169 self->norm[2] /= total;
171 /* Store bounding box, for get_intersect */
172 RoamPoint *p[] = {l,m,r};
173 self->edge.n = -90; self->edge.s = 90;
174 self->edge.e = -180; self->edge.w = 180;
175 gboolean maxed = FALSE;
176 for (int i = 0; i < G_N_ELEMENTS(p); i++) {
177 self->edge.n = MAX(self->edge.n, p[i]->lat);
178 self->edge.s = MIN(self->edge.s, p[i]->lat);
179 if (p[i]->lat == 90 || p[i]->lat == -90)
181 if (p[i]->lon == 180) {
185 self->edge.e = MAX(self->edge.e, p[i]->lon);
186 self->edge.w = MIN(self->edge.w, p[i]->lon);
189 if (self->edge.e < 0)
195 //g_message("roam_triangle_new: %p", self);
199 void roam_triangle_free(RoamTriangle *self)
205 void roam_triangle_add(RoamTriangle *self,
206 RoamTriangle *left, RoamTriangle *base, RoamTriangle *right,
213 roam_point_add_triangle(self->p.l, self);
214 roam_point_add_triangle(self->p.m, self);
215 roam_point_add_triangle(self->p.r, self);
218 roam_triangle_update_errors(self, sphere);
220 self->handle = g_pqueue_push(sphere->triangles, self);
223 void roam_triangle_remove(RoamTriangle *self, RoamSphere *sphere)
225 /* Update vertex normals */
226 roam_point_remove_triangle(self->p.l, self);
227 roam_point_remove_triangle(self->p.m, self);
228 roam_point_remove_triangle(self->p.r, self);
230 g_pqueue_remove(sphere->triangles, self->handle);
233 void roam_triangle_sync_neighbors(RoamTriangle *new, RoamTriangle *old, RoamTriangle *neigh)
235 if (neigh->t.l == old) neigh->t.l = new;
236 else if (neigh->t.b == old) neigh->t.b = new;
237 else if (neigh->t.r == old) neigh->t.r = new;
238 else g_assert_not_reached();
241 gboolean roam_point_visible(RoamPoint *self, RoamSphere *sphere)
243 gint *view = sphere->view->view;
244 return self->px > view[0] && self->px < view[2] &&
245 self->py > view[1] && self->py < view[3] &&
246 self->pz > 0 && self->pz < 1;
248 gboolean roam_triangle_visible(RoamTriangle *self, RoamSphere *sphere)
250 /* Do this with a bounding box */
251 return roam_point_visible(self->p.l, sphere) ||
252 roam_point_visible(self->p.m, sphere) ||
253 roam_point_visible(self->p.r, sphere);
256 void roam_triangle_update_errors(RoamTriangle *self, RoamSphere *sphere)
259 roam_point_update_projection(self->p.l, sphere);
260 roam_point_update_projection(self->p.m, sphere);
261 roam_point_update_projection(self->p.r, sphere);
263 /* Not exactly correct, could be out on both sides (middle in) */
264 if (!roam_triangle_visible(self, sphere)) {
267 roam_point_update_projection(self->split, sphere);
268 RoamPoint *l = self->p.l;
269 RoamPoint *m = self->p.m;
270 RoamPoint *r = self->p.r;
271 RoamPoint *split = self->split;
273 /* l-r midpoint projected l-r midpoint */
274 gdouble pxdist = (l->px + r->px)/2 - split->px;
275 gdouble pydist = (l->py + r->py)/2 - split->py;
277 self->error = sqrt(pxdist*pxdist + pydist*pydist);
279 /* Multiply by size of triangle */
280 double size = -( l->px * (m->py - r->py) +
281 m->px * (r->py - l->py) +
282 r->px * (l->py - m->py) ) / 2.0;
284 /* Size < 0 == backface */
286 // self->error *= -1;
291 void roam_triangle_split(RoamTriangle *self, RoamSphere *sphere)
293 //g_message("roam_triangle_split: %p, e=%f\n", self, self->error);
297 if (self != self->t.b->t.b)
298 roam_triangle_split(self->t.b, sphere);
299 if (self != self->t.b->t.b)
300 g_assert_not_reached();
302 RoamTriangle *base = self->t.b;
304 /* Add new triangles */
305 RoamPoint *mid = self->split;
306 RoamTriangle *sl = self->kids[0] = roam_triangle_new(self->p.m, mid, self->p.l); // Self Left
307 RoamTriangle *sr = self->kids[1] = roam_triangle_new(self->p.r, mid, self->p.m); // Self Right
308 RoamTriangle *bl = base->kids[0] = roam_triangle_new(base->p.m, mid, base->p.l); // Base Left
309 RoamTriangle *br = base->kids[1] = roam_triangle_new(base->p.r, mid, base->p.m); // Base Right
311 /* tri,l, base, r, sphere */
312 roam_triangle_add(sl, sr, self->t.l, br, sphere);
313 roam_triangle_add(sr, bl, self->t.r, sl, sphere);
314 roam_triangle_add(bl, br, base->t.l, sr, sphere);
315 roam_triangle_add(br, sl, base->t.r, bl, sphere);
317 roam_triangle_sync_neighbors(sl, self, self->t.l);
318 roam_triangle_sync_neighbors(sr, self, self->t.r);
319 roam_triangle_sync_neighbors(bl, base, base->t.l);
320 roam_triangle_sync_neighbors(br, base, base->t.r);
322 /* Remove old triangles */
323 roam_triangle_remove(self, sphere);
324 roam_triangle_remove(base, sphere);
326 /* Add/Remove diamonds */
327 RoamDiamond *diamond = roam_diamond_new(self, base, sl, sr, bl, br);
328 roam_diamond_update_errors(diamond, sphere);
329 roam_diamond_add(diamond, sphere);
330 roam_diamond_remove(self->parent, sphere);
331 roam_diamond_remove(base->parent, sphere);
334 void roam_triangle_draw(RoamTriangle *self)
336 glBegin(GL_TRIANGLES);
337 glNormal3dv(self->p.r->norm); glVertex3dv((double*)self->p.r);
338 glNormal3dv(self->p.m->norm); glVertex3dv((double*)self->p.m);
339 glNormal3dv(self->p.l->norm); glVertex3dv((double*)self->p.l);
344 void roam_triangle_draw_normal(RoamTriangle *self)
347 (self->p.l->x + self->p.m->x + self->p.r->x)/3.0,
348 (self->p.l->y + self->p.m->y + self->p.r->y)/3.0,
349 (self->p.l->z + self->p.m->z + self->p.r->z)/3.0,
352 center[0]+self->norm[0]*2000000,
353 center[1]+self->norm[1]*2000000,
354 center[2]+self->norm[2]*2000000,
365 RoamDiamond *roam_diamond_new(
366 RoamTriangle *parent0, RoamTriangle *parent1,
367 RoamTriangle *kid0, RoamTriangle *kid1,
368 RoamTriangle *kid2, RoamTriangle *kid3)
370 RoamDiamond *self = g_new0(RoamDiamond, 1);
372 self->kids[0] = kid0;
373 self->kids[1] = kid1;
374 self->kids[2] = kid2;
375 self->kids[3] = kid3;
382 self->parents[0] = parent0;
383 self->parents[1] = parent1;
387 void roam_diamond_add(RoamDiamond *self, RoamSphere *sphere)
390 self->error = MAX(self->parents[0]->error, self->parents[1]->error);
391 self->handle = g_pqueue_push(sphere->diamonds, self);
393 void roam_diamond_remove(RoamDiamond *self, RoamSphere *sphere)
395 if (self && self->active) {
396 self->active = FALSE;
397 g_pqueue_remove(sphere->diamonds, self->handle);
400 void roam_diamond_merge(RoamDiamond *self, RoamSphere *sphere)
402 //g_message("roam_diamond_merge: %p, e=%f\n", self, self->error);
406 /* TODO: pick the best split */
407 RoamTriangle **kids = self->kids;
409 /* Create triangles */
410 RoamTriangle *tri = self->parents[0];
411 RoamTriangle *base = self->parents[1];
413 roam_triangle_add(tri, kids[0]->t.b, base, kids[1]->t.b, sphere);
414 roam_triangle_add(base, kids[2]->t.b, tri, kids[3]->t.b, sphere);
416 roam_triangle_sync_neighbors(tri, kids[0], kids[0]->t.b);
417 roam_triangle_sync_neighbors(tri, kids[1], kids[1]->t.b);
418 roam_triangle_sync_neighbors(base, kids[2], kids[2]->t.b);
419 roam_triangle_sync_neighbors(base, kids[3], kids[3]->t.b);
421 /* Remove triangles */
422 roam_triangle_remove(kids[0], sphere);
423 roam_triangle_remove(kids[1], sphere);
424 roam_triangle_remove(kids[2], sphere);
425 roam_triangle_remove(kids[3], sphere);
428 tri->kids[0] = tri->kids[1] = NULL;
429 base->kids[0] = base->kids[1] = NULL;
431 /* Add/Remove triangles */
432 if (tri->t.l->t.l == tri->t.r->t.r &&
433 tri->t.l->t.l != tri && tri->parent) {
434 roam_diamond_update_errors(tri->parent, sphere);
435 roam_diamond_add(tri->parent, sphere);
438 if (base->t.l->t.l == base->t.r->t.r &&
439 base->t.l->t.l != base && base->parent) {
440 roam_diamond_update_errors(base->parent, sphere);
441 roam_diamond_add(base->parent, sphere);
444 /* Remove and free diamond and child triangles */
445 roam_diamond_remove(self, sphere);
446 g_assert(self->kids[0]->p.m == self->kids[1]->p.m &&
447 self->kids[1]->p.m == self->kids[2]->p.m &&
448 self->kids[2]->p.m == self->kids[3]->p.m);
449 g_assert(self->kids[0]->p.m->tris == 0);
450 roam_triangle_free(self->kids[0]);
451 roam_triangle_free(self->kids[1]);
452 roam_triangle_free(self->kids[2]);
453 roam_triangle_free(self->kids[3]);
456 void roam_diamond_update_errors(RoamDiamond *self, RoamSphere *sphere)
458 roam_triangle_update_errors(self->parents[0], sphere);
459 roam_triangle_update_errors(self->parents[1], sphere);
460 self->error = MAX(self->parents[0]->error, self->parents[1]->error);
466 RoamSphere *roam_sphere_new()
468 RoamSphere *self = g_new0(RoamSphere, 1);
470 self->triangles = g_pqueue_new((GCompareDataFunc)tri_cmp, NULL);
471 self->diamonds = g_pqueue_new((GCompareDataFunc)dia_cmp, NULL);
473 RoamPoint *vertexes[] = {
474 roam_point_new( 90, 0, 0), // 0 (North)
475 roam_point_new(-90, 0, 0), // 1 (South)
476 roam_point_new( 0, 0, 0), // 2 (Europe/Africa)
477 roam_point_new( 0, 90, 0), // 3 (Asia,East)
478 roam_point_new( 0, 180, 0), // 4 (Pacific)
479 roam_point_new( 0, -90, 0), // 5 (Americas,West)
481 int _triangles[][2][3] = {
482 /*lv mv rv ln, bn, rn */
483 {{2,0,3}, {3, 4, 1}}, // 0
484 {{3,0,4}, {0, 5, 2}}, // 1
485 {{4,0,5}, {1, 6, 3}}, // 2
486 {{5,0,2}, {2, 7, 0}}, // 3
487 {{3,1,2}, {5, 0, 7}}, // 4
488 {{4,1,3}, {6, 1, 4}}, // 5
489 {{5,1,4}, {7, 2, 5}}, // 6
490 {{2,1,5}, {4, 3, 6}}, // 7
493 for (int i = 0; i < 6; i++)
494 roam_point_update_height(vertexes[i]);
495 for (int i = 0; i < 8; i++)
496 self->roots[i] = roam_triangle_new(
497 vertexes[_triangles[i][0][0]],
498 vertexes[_triangles[i][0][1]],
499 vertexes[_triangles[i][0][2]]);
500 for (int i = 0; i < 8; i++)
501 roam_triangle_add(self->roots[i],
502 self->roots[_triangles[i][1][0]],
503 self->roots[_triangles[i][1][1]],
504 self->roots[_triangles[i][1][2]],
506 for (int i = 0; i < 8; i++)
507 g_debug("RoamSphere: new - %p edge=%f,%f,%f,%f", self->roots[i],
508 self->roots[i]->edge.n,
509 self->roots[i]->edge.s,
510 self->roots[i]->edge.e,
511 self->roots[i]->edge.w);
515 void roam_sphere_update_view(RoamSphere *self)
518 self->view = g_new0(RoamView, 1);
519 glGetDoublev (GL_MODELVIEW_MATRIX, self->view->model);
520 glGetDoublev (GL_PROJECTION_MATRIX, self->view->proj);
521 glGetIntegerv(GL_VIEWPORT, self->view->view);
522 self->view->version++;
524 void roam_sphere_update_errors(RoamSphere *self)
526 g_debug("RoamSphere: update_errors - polys=%d", self->polys);
527 GPtrArray *tris = g_pqueue_get_array(self->triangles);
528 GPtrArray *dias = g_pqueue_get_array(self->diamonds);
530 roam_sphere_update_view(self);
532 for (int i = 0; i < tris->len; i++) {
533 RoamTriangle *tri = tris->pdata[i];
534 roam_triangle_update_errors(tri, self);
535 g_pqueue_priority_changed(self->triangles, tri->handle);
538 for (int i = 0; i < dias->len; i++) {
539 RoamDiamond *dia = dias->pdata[i];
540 roam_diamond_update_errors(dia, self);
541 g_pqueue_priority_changed(self->diamonds, dia->handle);
544 g_ptr_array_free(tris, TRUE);
545 g_ptr_array_free(dias, TRUE);
548 void roam_sphere_split_one(RoamSphere *self)
550 RoamTriangle *to_split = g_pqueue_peek(self->triangles);
551 if (!to_split) return;
552 roam_triangle_split(to_split, self);
554 void roam_sphere_merge_one(RoamSphere *self)
556 RoamDiamond *to_merge = g_pqueue_peek(self->diamonds);
557 if (!to_merge) return;
558 roam_diamond_merge(to_merge, self);
560 gint roam_sphere_split_merge(RoamSphere *self)
562 gint iters = 0, max_iters = 500;
563 //gint target = 4000;
570 if (target - self->polys > 100) {
571 //g_debug("RoamSphere: split_merge - Splitting %d - %d > 100", target, self->polys);
572 while (self->polys < target && iters++ < max_iters)
573 roam_sphere_split_one(self);
576 if (self->polys - target > 100) {
577 //g_debug("RoamSphere: split_merge - Merging %d - %d > 100", self->polys, target);
578 while (self->polys > target && iters++ < max_iters)
579 roam_sphere_merge_one(self);
582 while (((RoamTriangle*)g_pqueue_peek(self->triangles))->error >
583 ((RoamDiamond *)g_pqueue_peek(self->diamonds ))->error &&
584 iters++ < max_iters) {
585 //g_debug("RoamSphere: split_merge - Fixing 1 %f > %f && %d < %d",
586 // ((RoamTriangle*)g_pqueue_peek(self->triangles))->error,
587 // ((RoamDiamond *)g_pqueue_peek(self->diamonds ))->error,
588 // iters-1, max_iters);
589 roam_sphere_merge_one(self);
590 roam_sphere_split_one(self);
595 void roam_sphere_draw(RoamSphere *self)
597 g_debug("RoamSphere: draw");
598 g_pqueue_foreach(self->triangles, (GFunc)roam_triangle_draw, NULL);
600 void roam_sphere_draw_normals(RoamSphere *self)
602 g_debug("RoamSphere: draw_normal");
603 g_pqueue_foreach(self->triangles, (GFunc)roam_triangle_draw_normal, NULL);
605 static GList *_roam_sphere_get_leaves(RoamTriangle *tri, GList *list, gboolean all)
607 if (tri->kids[0] && tri->kids[1]) {
608 if (all) list = g_list_prepend(list, tri);
609 list = _roam_sphere_get_leaves(tri->kids[0], list, all);
610 list = _roam_sphere_get_leaves(tri->kids[1], list, all);
613 return g_list_prepend(list, tri);
616 static GList *_roam_sphere_get_intersect_rec(RoamTriangle *tri, GList *list,
617 gboolean all, gdouble n, gdouble s, gdouble e, gdouble w)
619 gdouble tn = tri->edge.n;
620 gdouble ts = tri->edge.s;
621 gdouble te = tri->edge.e;
622 gdouble tw = tri->edge.w;
624 gboolean debug = FALSE &&
625 n==90 && s==45 && e==-90 && w==-180 &&
629 g_message("t=%p: %f < %f || %f > %f || %f < %f || %f > %f",
630 tri, tn, s, ts, n, te, w, tw, e);
631 if (tn < s || ts > n || te < w || tw > e) {
633 if (debug) g_message("no intersect");
635 } else if (tn <= n && ts >= s && te <= e && tw >= w) {
636 /* Triangle is completely contained */
637 if (debug) g_message("contained");
638 if (all) list = g_list_prepend(list, tri);
639 return _roam_sphere_get_leaves(tri, list, all);
640 } else if (tri->kids[0] && tri->kids[1]) {
641 /* Paritial intersect with children */
642 if (debug) g_message("edge w/ child");
643 if (all) list = g_list_prepend(list, tri);
644 list = _roam_sphere_get_intersect_rec(tri->kids[0], list, all, n, s, e, w);
645 list = _roam_sphere_get_intersect_rec(tri->kids[1], list, all, n, s, e, w);
648 /* This triangle is an edge case */
649 if (debug) g_message("edge");
650 return g_list_prepend(list, tri);
653 /* Warning: This grabs pointers to triangles which can be changed by other
654 * calls, e.g. split_merge. If you use this, you need to do some locking to
655 * prevent the returned list from becomming stale. */
656 GList *roam_sphere_get_intersect(RoamSphere *self, gboolean all,
657 gdouble n, gdouble s, gdouble e, gdouble w)
659 /* I think this is correct..
660 * i_cost = cost for triangle-rectagnle intersect test
661 * time = n_tiles * 2*tris_per_tile * i_cost
662 * time = 30 * 2*333 * i_cost = 20000 * i_cost */
664 for (int i = 0; i < G_N_ELEMENTS(self->roots); i++)
665 list = _roam_sphere_get_intersect_rec(self->roots[i],
666 list, all, n, s, e, w);
669 void roam_sphere_free_tri(RoamTriangle *tri)
671 if (--tri->p.l->tris == 0) g_free(tri->p.l);
672 if (--tri->p.m->tris == 0) g_free(tri->p.m);
673 if (--tri->p.r->tris == 0) g_free(tri->p.r);
674 roam_triangle_free(tri);
676 void roam_sphere_free(RoamSphere *self)
678 /* Slow method, but it should work */
679 while (self->polys > 8)
680 roam_sphere_merge_one(self);
681 /* TODO: free points */
682 g_pqueue_foreach(self->triangles, (GFunc)roam_sphere_free_tri, NULL);
683 g_pqueue_free(self->triangles);
684 g_pqueue_free(self->diamonds);