forked from pioneerspacesim/pioneer
/
GeoSphere.cpp
1440 lines (1302 loc) · 44.4 KB
/
GeoSphere.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include "libs.h"
#include "GeoSphere.h"
#include "perlin.h"
#include "Pi.h"
#include "RefCounted.h"
#include "graphics/Material.h"
#include "graphics/Renderer.h"
#include "graphics/Frustum.h"
#include "graphics/Graphics.h"
#include "graphics/VertexArray.h"
#include "graphics/gl2/GeoSphereMaterial.h"
#include <deque>
#include <algorithm>
// tri edge lengths
#define GEOPATCH_SUBDIVIDE_AT_CAMDIST 5.0
#define GEOPATCH_MAX_DEPTH 15 + (2*Pi::detail.fracmult) //15
#define GEOSPHERE_USE_THREADING
static const int GEOPATCH_MAX_EDGELEN = 55;
int GeoSphere::s_vtxGenCount = 0;
RefCountedPtr<GeoPatchContext> GeoSphere::s_patchContext;
// must be odd numbers
static const int detail_edgeLen[5] = {
7, 15, 25, 35, 55
};
#define PRINT_VECTOR(_v) printf("%f,%f,%f\n", (_v).x, (_v).y, (_v).z);
#pragma pack(4)
struct VBOVertex
{
float x,y,z;
float nx,ny,nz;
unsigned char col[4];
float padding;
};
#pragma pack()
// for glDrawRangeElements
static int s_loMinIdx[4], s_loMaxIdx[4];
static int s_hiMinIdx[4], s_hiMaxIdx[4];
class GeoPatchContext : public RefCounted {
public:
int edgeLen;
inline int VBO_COUNT_LO_EDGE() const { return 3*(edgeLen/2); }
inline int VBO_COUNT_HI_EDGE() const { return 3*(edgeLen-1); }
inline int VBO_COUNT_MID_IDX() const { return (4*3*(edgeLen-3)) + 2*(edgeLen-3)*(edgeLen-3)*3; }
// ^^ serrated teeth bit ^^^ square inner bit
inline int IDX_VBO_LO_OFFSET(int i) const { return i*sizeof(unsigned short)*3*(edgeLen/2); }
inline int IDX_VBO_HI_OFFSET(int i) const { return (i*sizeof(unsigned short)*VBO_COUNT_HI_EDGE())+IDX_VBO_LO_OFFSET(4); }
inline int IDX_VBO_MAIN_OFFSET() const { return IDX_VBO_HI_OFFSET(4); }
inline int NUMVERTICES() const { return edgeLen*edgeLen; }
double frac;
unsigned short *midIndices;
unsigned short *loEdgeIndices[4];
unsigned short *hiEdgeIndices[4];
GLuint indices_vbo;
VBOVertex *vbotemp;
GeoPatchContext(int _edgeLen) : edgeLen(_edgeLen) {
Init();
}
~GeoPatchContext() {
Cleanup();
}
void Refresh() {
Cleanup();
Init();
}
void Cleanup() {
delete [] midIndices;
for (int i=0; i<4; i++) {
delete [] loEdgeIndices[i];
delete [] hiEdgeIndices[i];
}
if (indices_vbo) {
glDeleteBuffersARB(1, &indices_vbo);
}
delete [] vbotemp;
}
void Init() {
frac = 1.0 / double(edgeLen-1);
vbotemp = new VBOVertex[NUMVERTICES()];
unsigned short *idx;
midIndices = new unsigned short[VBO_COUNT_MID_IDX()];
for (int i=0; i<4; i++) {
loEdgeIndices[i] = new unsigned short[VBO_COUNT_LO_EDGE()];
hiEdgeIndices[i] = new unsigned short[VBO_COUNT_HI_EDGE()];
}
/* also want vtx indices for tris not touching edge of patch */
idx = midIndices;
for (int x=1; x<edgeLen-2; x++) {
for (int y=1; y<edgeLen-2; y++) {
idx[0] = x + edgeLen*y;
idx[1] = x+1 + edgeLen*y;
idx[2] = x + edgeLen*(y+1);
idx+=3;
idx[0] = x+1 + edgeLen*y;
idx[1] = x+1 + edgeLen*(y+1);
idx[2] = x + edgeLen*(y+1);
idx+=3;
}
}
{
for (int x=1; x<edgeLen-3; x+=2) {
// razor teeth near edge 0
idx[0] = x + edgeLen;
idx[1] = x+1;
idx[2] = x+1 + edgeLen;
idx+=3;
idx[0] = x+1;
idx[1] = x+2 + edgeLen;
idx[2] = x+1 + edgeLen;
idx+=3;
}
for (int x=1; x<edgeLen-3; x+=2) {
// near edge 2
idx[0] = x + edgeLen*(edgeLen-2);
idx[1] = x+1 + edgeLen*(edgeLen-2);
idx[2] = x+1 + edgeLen*(edgeLen-1);
idx+=3;
idx[0] = x+1 + edgeLen*(edgeLen-2);
idx[1] = x+2 + edgeLen*(edgeLen-2);
idx[2] = x+1 + edgeLen*(edgeLen-1);
idx+=3;
}
for (int y=1; y<edgeLen-3; y+=2) {
// near edge 1
idx[0] = edgeLen-2 + y*edgeLen;
idx[1] = edgeLen-1 + (y+1)*edgeLen;
idx[2] = edgeLen-2 + (y+1)*edgeLen;
idx+=3;
idx[0] = edgeLen-2 + (y+1)*edgeLen;
idx[1] = edgeLen-1 + (y+1)*edgeLen;
idx[2] = edgeLen-2 + (y+2)*edgeLen;
idx+=3;
}
for (int y=1; y<edgeLen-3; y+=2) {
// near edge 3
idx[0] = 1 + y*edgeLen;
idx[1] = 1 + (y+1)*edgeLen;
idx[2] = (y+1)*edgeLen;
idx+=3;
idx[0] = 1 + (y+1)*edgeLen;
idx[1] = 1 + (y+2)*edgeLen;
idx[2] = (y+1)*edgeLen;
idx+=3;
}
}
// full detail edge triangles
{
idx = hiEdgeIndices[0];
for (int x=0; x<edgeLen-1; x+=2) {
idx[0] = x; idx[1] = x+1; idx[2] = x+1 + edgeLen;
idx+=3;
idx[0] = x+1; idx[1] = x+2; idx[2] = x+1 + edgeLen;
idx+=3;
}
idx = hiEdgeIndices[1];
for (int y=0; y<edgeLen-1; y+=2) {
idx[0] = edgeLen-1 + y*edgeLen;
idx[1] = edgeLen-1 + (y+1)*edgeLen;
idx[2] = edgeLen-2 + (y+1)*edgeLen;
idx+=3;
idx[0] = edgeLen-1 + (y+1)*edgeLen;
idx[1] = edgeLen-1 + (y+2)*edgeLen;
idx[2] = edgeLen-2 + (y+1)*edgeLen;
idx+=3;
}
idx = hiEdgeIndices[2];
for (int x=0; x<edgeLen-1; x+=2) {
idx[0] = x + (edgeLen-1)*edgeLen;
idx[1] = x+1 + (edgeLen-2)*edgeLen;
idx[2] = x+1 + (edgeLen-1)*edgeLen;
idx+=3;
idx[0] = x+1 + (edgeLen-2)*edgeLen;
idx[1] = x+2 + (edgeLen-1)*edgeLen;
idx[2] = x+1 + (edgeLen-1)*edgeLen;
idx+=3;
}
idx = hiEdgeIndices[3];
for (int y=0; y<edgeLen-1; y+=2) {
idx[0] = y*edgeLen;
idx[1] = 1 + (y+1)*edgeLen;
idx[2] = (y+1)*edgeLen;
idx+=3;
idx[0] = (y+1)*edgeLen;
idx[1] = 1 + (y+1)*edgeLen;
idx[2] = (y+2)*edgeLen;
idx+=3;
}
}
// these edge indices are for patches with no
// neighbour of equal or greater detail -- they reduce
// their edge complexity by 1 division
{
idx = loEdgeIndices[0];
for (int x=0; x<edgeLen-2; x+=2) {
idx[0] = x;
idx[1] = x+2;
idx[2] = x+1+edgeLen;
idx += 3;
}
idx = loEdgeIndices[1];
for (int y=0; y<edgeLen-2; y+=2) {
idx[0] = (edgeLen-1) + y*edgeLen;
idx[1] = (edgeLen-1) + (y+2)*edgeLen;
idx[2] = (edgeLen-2) + (y+1)*edgeLen;
idx += 3;
}
idx = loEdgeIndices[2];
for (int x=0; x<edgeLen-2; x+=2) {
idx[0] = x+edgeLen*(edgeLen-1);
idx[2] = x+2+edgeLen*(edgeLen-1);
idx[1] = x+1+edgeLen*(edgeLen-2);
idx += 3;
}
idx = loEdgeIndices[3];
for (int y=0; y<edgeLen-2; y+=2) {
idx[0] = y*edgeLen;
idx[2] = (y+2)*edgeLen;
idx[1] = 1 + (y+1)*edgeLen;
idx += 3;
}
}
// find min/max indices
for (int i=0; i<4; i++) {
s_loMinIdx[i] = s_hiMinIdx[i] = 1<<30;
s_loMaxIdx[i] = s_hiMaxIdx[i] = 0;
for (int j=0; j<3*(edgeLen/2); j++) {
if (loEdgeIndices[i][j] < s_loMinIdx[i]) s_loMinIdx[i] = loEdgeIndices[i][j];
if (loEdgeIndices[i][j] > s_loMaxIdx[i]) s_loMaxIdx[i] = loEdgeIndices[i][j];
}
for (int j=0; j<VBO_COUNT_HI_EDGE(); j++) {
if (hiEdgeIndices[i][j] < s_hiMinIdx[i]) s_hiMinIdx[i] = hiEdgeIndices[i][j];
if (hiEdgeIndices[i][j] > s_hiMaxIdx[i]) s_hiMaxIdx[i] = hiEdgeIndices[i][j];
}
//printf("%d:\nLo %d:%d\nHi: %d:%d\n", i, s_loMinIdx[i], s_loMaxIdx[i], s_hiMinIdx[i], s_hiMaxIdx[i]);
}
glGenBuffersARB(1, &indices_vbo);
glBindBufferARB(GL_ELEMENT_ARRAY_BUFFER, indices_vbo);
glBufferDataARB(GL_ELEMENT_ARRAY_BUFFER, IDX_VBO_MAIN_OFFSET() + sizeof(unsigned short)*VBO_COUNT_MID_IDX(), 0, GL_STATIC_DRAW);
for (int i=0; i<4; i++) {
glBufferSubDataARB(GL_ELEMENT_ARRAY_BUFFER,
IDX_VBO_LO_OFFSET(i),
sizeof(unsigned short)*3*(edgeLen/2),
loEdgeIndices[i]);
}
for (int i=0; i<4; i++) {
glBufferSubDataARB(GL_ELEMENT_ARRAY_BUFFER,
IDX_VBO_HI_OFFSET(i),
sizeof(unsigned short)*VBO_COUNT_HI_EDGE(),
hiEdgeIndices[i]);
}
glBufferSubDataARB(GL_ELEMENT_ARRAY_BUFFER,
IDX_VBO_MAIN_OFFSET(),
sizeof(unsigned short)*VBO_COUNT_MID_IDX(),
midIndices);
glBindBufferARB(GL_ELEMENT_ARRAY_BUFFER, 0);
}
void GetEdge(vector3d *array, int edge, vector3d *ev) {
if (edge == 0) {
for (int x=0; x<edgeLen; x++) ev[x] = array[x];
} else if (edge == 1) {
const int x = edgeLen-1;
for (int y=0; y<edgeLen; y++) ev[y] = array[x + y*edgeLen];
} else if (edge == 2) {
const int y = edgeLen-1;
for (int x=0; x<edgeLen; x++) ev[x] = array[(edgeLen-1)-x + y*edgeLen];
} else {
for (int y=0; y<edgeLen; y++) ev[y] = array[0 + ((edgeLen-1)-y)*edgeLen];
}
}
void SetEdge(vector3d *array, int edge, const vector3d *ev) {
if (edge == 0) {
for (int x=0; x<edgeLen; x++) array[x] = ev[x];
} else if (edge == 1) {
const int x = edgeLen-1;
for (int y=0; y<edgeLen; y++) array[x + y*edgeLen] = ev[y];
} else if (edge == 2) {
const int y = edgeLen-1;
for (int x=0; x<edgeLen; x++) array[(edgeLen-1)-x + y*edgeLen] = ev[x];
} else {
for (int y=0; y<edgeLen; y++) array[0 + ((edgeLen-1)-y)*edgeLen] = ev[y];
}
}
};
class GeoPatch {
public:
RefCountedPtr<GeoPatchContext> ctx;
vector3d v[4];
vector3d *vertices;
vector3d *normals;
vector3d *colors;
GLuint m_vbo;
GeoPatch *kids[4];
GeoPatch *parent;
GeoPatch *edgeFriend[4]; // [0]=v01, [1]=v12, [2]=v20
GeoSphere *geosphere;
double m_roughLength;
vector3d clipCentroid, centroid;
double clipRadius;
int m_depth;
SDL_mutex *m_kidsLock;
bool m_needUpdateVBOs;
double m_distMult;
GeoPatch(const RefCountedPtr<GeoPatchContext> &_ctx, GeoSphere *gs, vector3d v0, vector3d v1, vector3d v2, vector3d v3, int depth) {
memset(this, 0, sizeof(GeoPatch));
ctx = _ctx;
geosphere = gs;
m_kidsLock = SDL_CreateMutex();
v[0] = v0; v[1] = v1; v[2] = v2; v[3] = v3;
//depth -= Pi::detail.fracmult;
m_depth = depth;
clipCentroid = (v0+v1+v2+v3) * 0.25;
clipRadius = 0;
for (int i=0; i<4; i++) {
clipRadius = std::max(clipRadius, (v[i]-clipCentroid).Length());
}
if (geosphere->m_sbody->type < SystemBody::TYPE_PLANET_ASTEROID) {
m_distMult = 10 / Clamp(depth, 1, 10);
} else {
m_distMult = 5 / Clamp(depth, 1, 5);
}
m_roughLength = GEOPATCH_SUBDIVIDE_AT_CAMDIST / pow(2.0, depth) * m_distMult;
m_needUpdateVBOs = false;
normals = new vector3d[ctx->NUMVERTICES()];
vertices = new vector3d[ctx->NUMVERTICES()];
colors = new vector3d[ctx->NUMVERTICES()];
}
~GeoPatch() {
SDL_DestroyMutex(m_kidsLock);
for (int i=0; i<4; i++) {
if (edgeFriend[i]) edgeFriend[i]->NotifyEdgeFriendDeleted(this);
}
for (int i=0; i<4; i++) if (kids[i]) delete kids[i];
delete[] vertices;
delete[] normals;
delete[] colors;
geosphere->AddVBOToDestroy(m_vbo);
}
void UpdateVBOs() {
m_needUpdateVBOs = true;
}
void _UpdateVBOs() {
if (m_needUpdateVBOs) {
if (!m_vbo) glGenBuffersARB(1, &m_vbo);
m_needUpdateVBOs = false;
glBindBufferARB(GL_ARRAY_BUFFER, m_vbo);
glBufferDataARB(GL_ARRAY_BUFFER, sizeof(VBOVertex)*ctx->NUMVERTICES(), 0, GL_DYNAMIC_DRAW);
for (int i=0; i<ctx->NUMVERTICES(); i++)
{
clipRadius = std::max(clipRadius, (vertices[i]-clipCentroid).Length());
VBOVertex *pData = ctx->vbotemp + i;
pData->x = float(vertices[i].x - clipCentroid.x);
pData->y = float(vertices[i].y - clipCentroid.y);
pData->z = float(vertices[i].z - clipCentroid.z);
pData->nx = float(normals[i].x);
pData->ny = float(normals[i].y);
pData->nz = float(normals[i].z);
pData->col[0] = static_cast<unsigned char>(Clamp(colors[i].x*255.0, 0.0, 255.0));
pData->col[1] = static_cast<unsigned char>(Clamp(colors[i].y*255.0, 0.0, 255.0));
pData->col[2] = static_cast<unsigned char>(Clamp(colors[i].z*255.0, 0.0, 255.0));
pData->col[3] = 255;
}
glBufferDataARB(GL_ARRAY_BUFFER, sizeof(VBOVertex)*ctx->NUMVERTICES(), ctx->vbotemp, GL_DYNAMIC_DRAW);
glBindBufferARB(GL_ARRAY_BUFFER, 0);
}
}
/* not quite edge, since we share edge vertices so that would be
* fucking pointless. one position inwards. used to make edge normals
* for adjacent tiles */
void GetEdgeMinusOneVerticesFlipped(int edge, vector3d *ev) {
if (edge == 0) {
for (int x=0; x<ctx->edgeLen; x++) ev[ctx->edgeLen-1-x] = vertices[x + ctx->edgeLen];
} else if (edge == 1) {
const int x = ctx->edgeLen-2;
for (int y=0; y<ctx->edgeLen; y++) ev[ctx->edgeLen-1-y] = vertices[x + y*ctx->edgeLen];
} else if (edge == 2) {
const int y = ctx->edgeLen-2;
for (int x=0; x<ctx->edgeLen; x++) ev[ctx->edgeLen-1-x] = vertices[(ctx->edgeLen-1)-x + y*ctx->edgeLen];
} else {
for (int y=0; y<ctx->edgeLen; y++) ev[ctx->edgeLen-1-y] = vertices[1 + ((ctx->edgeLen-1)-y)*ctx->edgeLen];
}
}
int GetEdgeIdxOf(GeoPatch *e) {
for (int i=0; i<4; i++) {
if (edgeFriend[i] == e) return i;
}
abort();
return -1;
}
void FixEdgeNormals(const int edge, const vector3d *ev) {
int x, y;
switch (edge) {
case 0:
for (x=1; x<ctx->edgeLen-1; x++) {
const vector3d x1 = vertices[x-1];
const vector3d x2 = vertices[x+1];
const vector3d y1 = ev[x];
const vector3d y2 = vertices[x + ctx->edgeLen];
const vector3d norm = (x2-x1).Cross(y2-y1).Normalized();
normals[x] = norm;
// make color
const vector3d p = GetSpherePoint(x*ctx->frac, 0);
const double height = colors[x].x;
colors[x] = geosphere->GetColor(p, height, norm);
}
break;
case 1:
x = ctx->edgeLen-1;
for (y=1; y<ctx->edgeLen-1; y++) {
const vector3d x1 = vertices[(x-1) + y*ctx->edgeLen];
const vector3d x2 = ev[y];
const vector3d y1 = vertices[x + (y-1)*ctx->edgeLen];
const vector3d y2 = vertices[x + (y+1)*ctx->edgeLen];
const vector3d norm = (x2-x1).Cross(y2-y1).Normalized();
normals[x + y*ctx->edgeLen] = norm;
// make color
const vector3d p = GetSpherePoint(x*ctx->frac, y*ctx->frac);
const double height = colors[x + y*ctx->edgeLen].x;
colors[x + y*ctx->edgeLen] = geosphere->GetColor(p, height, norm);
// colors[x+y*ctx->edgeLen] = vector3d(1,0,0);
}
break;
case 2:
y = ctx->edgeLen-1;
for (x=1; x<ctx->edgeLen-1; x++) {
const vector3d x1 = vertices[x-1 + y*ctx->edgeLen];
const vector3d x2 = vertices[x+1 + y*ctx->edgeLen];
const vector3d y1 = vertices[x + (y-1)*ctx->edgeLen];
const vector3d y2 = ev[ctx->edgeLen-1-x];
const vector3d norm = (x2-x1).Cross(y2-y1).Normalized();
normals[x + y*ctx->edgeLen] = norm;
// make color
const vector3d p = GetSpherePoint(x*ctx->frac, y*ctx->frac);
const double height = colors[x + y*ctx->edgeLen].x;
colors[x + y*ctx->edgeLen] = geosphere->GetColor(p, height, norm);
}
break;
case 3:
for (y=1; y<ctx->edgeLen-1; y++) {
const vector3d x1 = ev[ctx->edgeLen-1-y];
const vector3d x2 = vertices[1 + y*ctx->edgeLen];
const vector3d y1 = vertices[(y-1)*ctx->edgeLen];
const vector3d y2 = vertices[(y+1)*ctx->edgeLen];
const vector3d norm = (x2-x1).Cross(y2-y1).Normalized();
normals[y*ctx->edgeLen] = norm;
// make color
const vector3d p = GetSpherePoint(0, y*ctx->frac);
const double height = colors[y*ctx->edgeLen].x;
colors[y*ctx->edgeLen] = geosphere->GetColor(p, height, norm);
// colors[y*ctx->edgeLen] = vector3d(0,1,0);
}
break;
}
}
int GetChildIdx(GeoPatch *child) {
for (int i=0; i<4; i++) {
if (kids[i] == child) return i;
}
abort();
return -1;
}
void FixEdgeFromParentInterpolated(int edge) {
// noticeable artefacts from not doing so...
vector3d ev[GEOPATCH_MAX_EDGELEN];
vector3d en[GEOPATCH_MAX_EDGELEN];
vector3d ec[GEOPATCH_MAX_EDGELEN];
vector3d ev2[GEOPATCH_MAX_EDGELEN];
vector3d en2[GEOPATCH_MAX_EDGELEN];
vector3d ec2[GEOPATCH_MAX_EDGELEN];
ctx->GetEdge(parent->vertices, edge, ev);
ctx->GetEdge(parent->normals, edge, en);
ctx->GetEdge(parent->colors, edge, ec);
int kid_idx = parent->GetChildIdx(this);
if (edge == kid_idx) {
// use first half of edge
for (int i=0; i<=ctx->edgeLen/2; i++) {
ev2[i<<1] = ev[i];
en2[i<<1] = en[i];
ec2[i<<1] = ec[i];
}
} else {
// use 2nd half of edge
for (int i=ctx->edgeLen/2; i<ctx->edgeLen; i++) {
ev2[(i-(ctx->edgeLen/2))<<1] = ev[i];
en2[(i-(ctx->edgeLen/2))<<1] = en[i];
ec2[(i-(ctx->edgeLen/2))<<1] = ec[i];
}
}
// interpolate!!
for (int i=1; i<ctx->edgeLen; i+=2) {
ev2[i] = (ev2[i-1]+ev2[i+1]) * 0.5;
en2[i] = (en2[i-1]+en2[i+1]).Normalized();
ec2[i] = (ec2[i-1]+ec2[i+1]) * 0.5;
}
ctx->SetEdge(this->vertices, edge, ev2);
ctx->SetEdge(this->normals, edge, en2);
ctx->SetEdge(this->colors, edge, ec2);
}
template <int corner>
void MakeCornerNormal(vector3d *ev, vector3d *ev2) {
int p;
vector3d x1,x2,y1,y2;
switch (corner) {
case 0: {
x1 = ev[ctx->edgeLen-1];
x2 = vertices[1];
y1 = ev2[0];
y2 = vertices[ctx->edgeLen];
const vector3d norm = (x2-x1).Cross(y2-y1).Normalized();
normals[0] = norm;
// make color
const vector3d pt = GetSpherePoint(0, 0);
// const double height = colors[0].x;
const double height = geosphere->GetHeight(pt);
colors[0] = geosphere->GetColor(pt, height, norm);
}
break;
case 1: {
p = ctx->edgeLen-1;
x1 = vertices[p-1];
x2 = ev2[0];
y1 = ev[ctx->edgeLen-1];
y2 = vertices[p + ctx->edgeLen];
const vector3d norm = (x2-x1).Cross(y2-y1).Normalized();
normals[p] = norm;
// make color
const vector3d pt = GetSpherePoint(p*ctx->frac, 0);
// const double height = colors[p].x;
const double height = geosphere->GetHeight(pt);
colors[p] = geosphere->GetColor(pt, height, norm);
}
break;
case 2: {
p = ctx->edgeLen-1;
x1 = vertices[(p-1) + p*ctx->edgeLen];
x2 = ev[ctx->edgeLen-1];
y1 = vertices[p + (p-1)*ctx->edgeLen];
y2 = ev2[0];
const vector3d norm = (x2-x1).Cross(y2-y1).Normalized();
normals[p + p*ctx->edgeLen] = norm;
// make color
const vector3d pt = GetSpherePoint(p*ctx->frac, p*ctx->frac);
// const double height = colors[p + p*ctx->edgeLen].x;
const double height = geosphere->GetHeight(pt);
colors[p + p*ctx->edgeLen] = geosphere->GetColor(pt, height, norm);
}
break;
case 3: {
p = ctx->edgeLen-1;
x1 = ev2[0];
x2 = vertices[1 + p*ctx->edgeLen];
y1 = vertices[(p-1)*ctx->edgeLen];
y2 = ev[ctx->edgeLen-1];
const vector3d norm = (x2-x1).Cross(y2-y1).Normalized();
normals[p*ctx->edgeLen] = norm;
// make color
const vector3d pt = GetSpherePoint(0, p*ctx->frac);
// const double height = colors[p*ctx->edgeLen].x;
const double height = geosphere->GetHeight(pt);
colors[p*ctx->edgeLen] = geosphere->GetColor(pt, height, norm);
}
break;
}
}
void FixCornerNormalsByEdge(int edge, vector3d *ev) {
vector3d ev2[GEOPATCH_MAX_EDGELEN];
vector3d x1, x2, y1, y2;
/* XXX All these 'if's have an unfinished else, when a neighbour
* of our size doesn't exist and instead we must look at a bigger tile.
* But let's just leave it for the mo because it is a pain.
* See comment in OnEdgeFriendChanged() */
switch (edge) {
case 0:
if (edgeFriend[3]) {
int we_are = edgeFriend[3]->GetEdgeIdxOf(this);
edgeFriend[3]->GetEdgeMinusOneVerticesFlipped(we_are, ev2);
MakeCornerNormal<0>(ev2, ev);
}
if (edgeFriend[1]) {
int we_are = edgeFriend[1]->GetEdgeIdxOf(this);
edgeFriend[1]->GetEdgeMinusOneVerticesFlipped(we_are, ev2);
MakeCornerNormal<1>(ev, ev2);
}
break;
case 1:
if (edgeFriend[0]) {
int we_are = edgeFriend[0]->GetEdgeIdxOf(this);
edgeFriend[0]->GetEdgeMinusOneVerticesFlipped(we_are, ev2);
MakeCornerNormal<1>(ev2, ev);
}
if (edgeFriend[2]) {
int we_are = edgeFriend[2]->GetEdgeIdxOf(this);
edgeFriend[2]->GetEdgeMinusOneVerticesFlipped(we_are, ev2);
MakeCornerNormal<2>(ev, ev2);
}
break;
case 2:
if (edgeFriend[1]) {
int we_are = edgeFriend[1]->GetEdgeIdxOf(this);
edgeFriend[1]->GetEdgeMinusOneVerticesFlipped(we_are, ev2);
MakeCornerNormal<2>(ev2, ev);
}
if (edgeFriend[3]) {
int we_are = edgeFriend[3]->GetEdgeIdxOf(this);
edgeFriend[3]->GetEdgeMinusOneVerticesFlipped(we_are, ev2);
MakeCornerNormal<3>(ev, ev2);
}
break;
case 3:
if (edgeFriend[2]) {
int we_are = edgeFriend[2]->GetEdgeIdxOf(this);
edgeFriend[2]->GetEdgeMinusOneVerticesFlipped(we_are, ev2);
MakeCornerNormal<3>(ev2, ev);
}
if (edgeFriend[0]) {
int we_are = edgeFriend[0]->GetEdgeIdxOf(this);
edgeFriend[0]->GetEdgeMinusOneVerticesFlipped(we_are, ev2);
MakeCornerNormal<0>(ev, ev2);
}
break;
}
}
void GenerateEdgeNormalsAndColors() {
vector3d ev[4][GEOPATCH_MAX_EDGELEN];
bool doneEdge[4];
memset(doneEdge, 0, sizeof(doneEdge));
for (int i=0; i<4; i++) {
GeoPatch *e = edgeFriend[i];
if (e) {
int we_are = e->GetEdgeIdxOf(this);
e->GetEdgeMinusOneVerticesFlipped(we_are, ev[i]);
} else {
assert(parent->edgeFriend[i]);
doneEdge[i] = true;
// parent has valid edge, so take our
// bit of that, interpolated.
FixEdgeFromParentInterpolated(i);
// XXX needed for corners... probably not
// correct
ctx->GetEdge(vertices, i, ev[i]);
}
}
MakeCornerNormal<0>(ev[3], ev[0]);
MakeCornerNormal<1>(ev[0], ev[1]);
MakeCornerNormal<2>(ev[1], ev[2]);
MakeCornerNormal<3>(ev[2], ev[3]);
for (int i=0; i<4; i++) if(!doneEdge[i]) FixEdgeNormals(i, ev[i]);
}
/* in patch surface coords, [0,1] */
vector3d GetSpherePoint(double x, double y) {
return (v[0] + x*(1.0-y)*(v[1]-v[0]) +
x*y*(v[2]-v[0]) +
(1.0-x)*y*(v[3]-v[0])).Normalized();
}
/** Generates full-detail vertices, and also non-edge normals and
* colors */
void GenerateMesh() {
centroid = clipCentroid.Normalized();
centroid = (1.0 + geosphere->GetHeight(centroid)) * centroid;
vector3d *vts = vertices;
vector3d *col = colors;
double xfrac;
double yfrac = 0;
for (int y=0; y<ctx->edgeLen; y++) {
xfrac = 0;
for (int x=0; x<ctx->edgeLen; x++) {
vector3d p = GetSpherePoint(xfrac, yfrac);
double height = geosphere->GetHeight(p);
*(vts++) = p * (height + 1.0);
// remember this -- we will need it later
(col++)->x = height;
xfrac += ctx->frac;
}
yfrac += ctx->frac;
}
assert(vts == &vertices[ctx->NUMVERTICES()]);
// Generate normals & colors for non-edge vertices since they never change
for (int y=1; y<ctx->edgeLen-1; y++) {
for (int x=1; x<ctx->edgeLen-1; x++) {
// normal
vector3d x1 = vertices[x-1 + y*ctx->edgeLen];
vector3d x2 = vertices[x+1 + y*ctx->edgeLen];
vector3d y1 = vertices[x + (y-1)*ctx->edgeLen];
vector3d y2 = vertices[x + (y+1)*ctx->edgeLen];
vector3d n = (x2-x1).Cross(y2-y1);
normals[x + y*ctx->edgeLen] = n.Normalized();
// color
vector3d p = GetSpherePoint(x*ctx->frac, y*ctx->frac);
vector3d &col_r = colors[x + y*ctx->edgeLen];
const double height = col_r.x;
const vector3d &norm = normals[x + y*ctx->edgeLen];
col_r = geosphere->GetColor(p, height, norm);
}
}
}
void OnEdgeFriendChanged(int edge, GeoPatch *e) {
edgeFriend[edge] = e;
vector3d ev[GEOPATCH_MAX_EDGELEN];
int we_are = e->GetEdgeIdxOf(this);
e->GetEdgeMinusOneVerticesFlipped(we_are, ev);
/* now we have a valid edge, fix the edge vertices */
if (edge == 0) {
for (int x=0; x<ctx->edgeLen; x++) {
vector3d p = GetSpherePoint(x * ctx->frac, 0);
double height = geosphere->GetHeight(p);
vertices[x] = p * (height + 1.0);
// XXX These bounds checks in each edge case are
// only necessary while the "All these 'if's"
// comment in FixCOrnerNormalsByEdge stands
if ((x>0) && (x<ctx->edgeLen-1)) {
colors[x].x = height;
}
}
} else if (edge == 1) {
for (int y=0; y<ctx->edgeLen; y++) {
vector3d p = GetSpherePoint(1.0, y * ctx->frac);
double height = geosphere->GetHeight(p);
int pos = (ctx->edgeLen-1) + y*ctx->edgeLen;
vertices[pos] = p * (height + 1.0);
if ((y>0) && (y<ctx->edgeLen-1)) {
colors[pos].x = height;
}
}
} else if (edge == 2) {
for (int x=0; x<ctx->edgeLen; x++) {
vector3d p = GetSpherePoint(x * ctx->frac, 1.0);
double height = geosphere->GetHeight(p);
int pos = x + (ctx->edgeLen-1)*ctx->edgeLen;
vertices[pos] = p * (height + 1.0);
if ((x>0) && (x<ctx->edgeLen-1)) {
colors[pos].x = height;
}
}
} else {
for (int y=0; y<ctx->edgeLen; y++) {
vector3d p = GetSpherePoint(0, y * ctx->frac);
double height = geosphere->GetHeight(p);
int pos = y * ctx->edgeLen;
vertices[pos] = p * (height + 1.0);
if ((y>0) && (y<ctx->edgeLen-1)) {
colors[pos].x = height;
}
}
}
FixEdgeNormals(edge, ev);
FixCornerNormalsByEdge(edge, ev);
UpdateVBOs();
if (kids[0]) {
if (edge == 0) {
kids[0]->FixEdgeFromParentInterpolated(0);
kids[0]->UpdateVBOs();
kids[1]->FixEdgeFromParentInterpolated(0);
kids[1]->UpdateVBOs();
} else if (edge == 1) {
kids[1]->FixEdgeFromParentInterpolated(1);
kids[1]->UpdateVBOs();
kids[2]->FixEdgeFromParentInterpolated(1);
kids[2]->UpdateVBOs();
} else if (edge == 2) {
kids[2]->FixEdgeFromParentInterpolated(2);
kids[2]->UpdateVBOs();
kids[3]->FixEdgeFromParentInterpolated(2);
kids[3]->UpdateVBOs();
} else {
kids[3]->FixEdgeFromParentInterpolated(3);
kids[3]->UpdateVBOs();
kids[0]->FixEdgeFromParentInterpolated(3);
kids[0]->UpdateVBOs();
}
}
}
void NotifyEdgeFriendSplit(GeoPatch *e) {
int idx = GetEdgeIdxOf(e);
int we_are = e->GetEdgeIdxOf(this);
if (!kids[0]) return;
// match e's new kids to our own... :/
kids[idx]->OnEdgeFriendChanged(idx, e->kids[(we_are+1)%4]);
kids[(idx+1)%4]->OnEdgeFriendChanged(idx, e->kids[we_are]);
}
void NotifyEdgeFriendDeleted(GeoPatch *e) {
int idx = GetEdgeIdxOf(e);
edgeFriend[idx] = 0;
if (!parent) return;
if (parent->edgeFriend[idx]) {
FixEdgeFromParentInterpolated(idx);
UpdateVBOs();
} else {
// XXX TODO XXX
// Bad. not fixing up edges in this case!!!
}
}
GeoPatch *GetEdgeFriendForKid(int kid, int edge) {
GeoPatch *e = edgeFriend[edge];
if (!e) return 0;
//assert (e);// && (e->m_depth >= m_depth));
const int we_are = e->GetEdgeIdxOf(this);
// neighbour patch has not split yet (is at depth of this patch), so kids of this patch do
// not have same detail level neighbours yet
if (edge == kid) return e->kids[(we_are+1)%4];
else return e->kids[we_are];
}
void Render(vector3d &campos, const Graphics::Frustum &frustum) {
PiVerify(SDL_mutexP(m_kidsLock)==0);
if (kids[0]) {
for (int i=0; i<4; i++) kids[i]->Render(campos, frustum);
SDL_mutexV(m_kidsLock);
} else {
SDL_mutexV(m_kidsLock);
_UpdateVBOs();
if (!frustum.TestPoint(clipCentroid, clipRadius))
return;
vector3d relpos = clipCentroid - campos;
glPushMatrix();
glTranslated(relpos.x, relpos.y, relpos.z);
Pi::statSceneTris += 2*(ctx->edgeLen-1)*(ctx->edgeLen-1);
glEnableClientState(GL_VERTEX_ARRAY);
glEnableClientState(GL_NORMAL_ARRAY);
glEnableClientState(GL_COLOR_ARRAY);
glBindBufferARB(GL_ARRAY_BUFFER, m_vbo);
glVertexPointer(3, GL_FLOAT, sizeof(VBOVertex), 0);
glNormalPointer(GL_FLOAT, sizeof(VBOVertex), reinterpret_cast<void *>(3*sizeof(float)));
glColorPointer(4, GL_UNSIGNED_BYTE, sizeof(VBOVertex), reinterpret_cast<void *>(6*sizeof(float)));
glBindBufferARB(GL_ELEMENT_ARRAY_BUFFER, ctx->indices_vbo);
glDrawRangeElements(GL_TRIANGLES, 0, ctx->NUMVERTICES()-1, ctx->VBO_COUNT_MID_IDX(), GL_UNSIGNED_SHORT, reinterpret_cast<void*>(ctx->IDX_VBO_MAIN_OFFSET()));
for (int i=0; i<4; i++) {
if (edgeFriend[i]) {
glDrawRangeElements(GL_TRIANGLES, s_hiMinIdx[i], s_hiMaxIdx[i], ctx->VBO_COUNT_HI_EDGE(), GL_UNSIGNED_SHORT, reinterpret_cast<void*>(ctx->IDX_VBO_HI_OFFSET(i)));
} else {
glDrawRangeElements(GL_TRIANGLES, s_loMinIdx[i], s_loMaxIdx[i], ctx->VBO_COUNT_LO_EDGE(), GL_UNSIGNED_SHORT, reinterpret_cast<void*>(ctx->IDX_VBO_LO_OFFSET(i)));
}
}
glBindBufferARB(GL_ARRAY_BUFFER_ARB, 0);
glBindBufferARB(GL_ELEMENT_ARRAY_BUFFER, 0);
glDisableClientState(GL_VERTEX_ARRAY);
glDisableClientState(GL_NORMAL_ARRAY);
glDisableClientState(GL_COLOR_ARRAY);
glPopMatrix();
}
}
void LODUpdate(vector3d &campos) {
// if we've been asked to abort then get out as quickly as possible
// this function is recursive so we might be very deep. this is about
// as fast as we can go
SDL_mutexP(geosphere->m_abortLock);
bool abort = geosphere->m_abort;
SDL_mutexV(geosphere->m_abortLock);
if (abort)
return;
bool canSplit = true;
for (int i=0; i<4; i++) {
if (!edgeFriend[i]) { canSplit = false; break; }
if (edgeFriend[i] && (edgeFriend[i]->m_depth < m_depth)) {
canSplit = false;
break;
}
}
if (!(canSplit && (m_depth < GEOPATCH_MAX_DEPTH) &&
((campos - centroid).Length() < m_roughLength)))
canSplit = false;
// always split at first level
if (!parent) canSplit = true;
//printf(campos.Length());
bool canMerge = true;
if (canSplit) {
if (!kids[0]) {
vector3d v01, v12, v23, v30, cn;
cn = centroid.Normalized();
v01 = (v[0]+v[1]).Normalized();
v12 = (v[1]+v[2]).Normalized();
v23 = (v[2]+v[3]).Normalized();
v30 = (v[3]+v[0]).Normalized();
GeoPatch *_kids[4];
_kids[0] = new GeoPatch(ctx, geosphere, v[0], v01, cn, v30, m_depth+1);
_kids[1] = new GeoPatch(ctx, geosphere, v01, v[1], v12, cn, m_depth+1);
_kids[2] = new GeoPatch(ctx, geosphere, cn, v12, v[2], v23, m_depth+1);
_kids[3] = new GeoPatch(ctx, geosphere, v30, cn, v23, v[3], m_depth+1);
// hm.. edges. Not right to pass this
// edgeFriend...
_kids[0]->edgeFriend[0] = GetEdgeFriendForKid(0, 0);
_kids[0]->edgeFriend[1] = _kids[1];
_kids[0]->edgeFriend[2] = _kids[3];
_kids[0]->edgeFriend[3] = GetEdgeFriendForKid(0, 3);
_kids[1]->edgeFriend[0] = GetEdgeFriendForKid(1, 0);
_kids[1]->edgeFriend[1] = GetEdgeFriendForKid(1, 1);
_kids[1]->edgeFriend[2] = _kids[2];
_kids[1]->edgeFriend[3] = _kids[0];
_kids[2]->edgeFriend[0] = _kids[1];
_kids[2]->edgeFriend[1] = GetEdgeFriendForKid(2, 1);
_kids[2]->edgeFriend[2] = GetEdgeFriendForKid(2, 2);
_kids[2]->edgeFriend[3] = _kids[3];
_kids[3]->edgeFriend[0] = _kids[0];
_kids[3]->edgeFriend[1] = _kids[2];
_kids[3]->edgeFriend[2] = GetEdgeFriendForKid(3, 2);
_kids[3]->edgeFriend[3] = GetEdgeFriendForKid(3, 3);
_kids[0]->parent = _kids[1]->parent = _kids[2]->parent = _kids[3]->parent = this;
for (int i=0; i<4; i++) _kids[i]->GenerateMesh();
PiVerify(SDL_mutexP(m_kidsLock)==0);
for (int i=0; i<4; i++) kids[i] = _kids[i];
for (int i=0; i<4; i++) edgeFriend[i]->NotifyEdgeFriendSplit(this);
for (int i=0; i<4; i++) {
kids[i]->GenerateEdgeNormalsAndColors();
kids[i]->UpdateVBOs();
}
PiVerify(SDL_mutexV(m_kidsLock)!=-1);
}
for (int i=0; i<4; i++) kids[i]->LODUpdate(campos);
} else {
if (canMerge && kids[0]) {
PiVerify(SDL_mutexP(m_kidsLock)==0);
for (int i=0; i<4; i++) { delete kids[i]; kids[i] = 0; }
PiVerify(SDL_mutexV(m_kidsLock)!=-1);
}
}
}
};
static const int geo_sphere_edge_friends[6][4] = {
{ 3, 4, 1, 2 },
{ 0, 4, 5, 2 },
{ 0, 1, 5, 3 },
{ 0, 2, 5, 4 },
{ 0, 3, 5, 1 },
{ 1, 4, 3, 2 }
};
static std::vector<GeoSphere*> s_allGeospheres;
static std::deque<GeoSphere*> s_geosphereUpdateQueue;
static GeoSphere* s_currentlyUpdatingGeoSphere = 0;
static SDL_mutex *s_geosphereUpdateQueueLock = 0;
static SDL_cond *s_geosphereUpdateQueueCondition = 0; ///< Condition variable for s_geosphereUpdateQueue and s_exitFlag. Allows waking up the thread when useful.
static SDL_Thread *s_updateThread = 0;
static bool s_exitFlag = false;
/* Thread that updates geosphere level of detail thingies */
int GeoSphere::UpdateLODThread(void *data)
{
bool done = false;
while (!done) {