-
Notifications
You must be signed in to change notification settings - Fork 0
/
SimpGPU.cpp
1231 lines (1024 loc) · 34.7 KB
/
SimpGPU.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 "SimpGPU.h"
#include "kernel.cuh"
#include <algorithm>
#include <cmath>
//TIME
long time_collapse = 0;
long time_simplify = 0;
long time_sorting = 0;
long time_updating_queue = 0;
long time_init_device = 0;
//get position from header array
//Size of each structure on arrays
const int HEADER_SIZE = 3;
const int FACE_SIZE = 3;
const int VERTEX_SIZE = 3;
const int FACE_DATA_BATCH_SIZE = 50;
const int EDGE_DATA_BATCH_SIZE = 50;
const int QUADRIC_SIZE = 16; //Quadric for a vertex is a 4x4 matrix
const int EDGE_SIZE = 2;
//UGRID
const int CELL_HEADER_SIZE = 2;
//NO.
int n_edges = 0;
int n_faces=0, n_vertices=0;
//ACCESS Vertex
#define getFaceVertexId(face,vertex) h_faces[FACE_SIZE*face+vertex]
#define getFaceHeaderPos(vertex) h_vert_face_header[HEADER_SIZE*vertex]
#define getFaceCurrSize(vertex) h_vert_face_header[HEADER_SIZE*vertex+1]
#define faceIncreaseSize(vertex) h_vert_face_header[HEADER_SIZE*vertex+1]++
#define faceDecreaseSize(vertex) h_vert_face_header[HEADER_SIZE*vertex+1]--
#define getFaceId(vid,p) h_vert_face_data[getFaceHeaderPos(vid)+p]
#define getX(vid) h_vertices[VERTEX_SIZE*vid]
#define getY(vid) h_vertices[VERTEX_SIZE*vid+1]
#define getZ(vid) h_vertices[VERTEX_SIZE*vid+2]
//ACCESS TO EDGES
#define getEdgeVertexId(edge,vid) h_edges[EDGE_SIZE*edge+vid] //Get vertex id (0 or 1) of edge
#define getEdgeFromHeaderPos(vid) h_vert_edge_from_header[HEADER_SIZE*vid]
#define getEdgeFromCurrSize(vid) h_vert_edge_from_header[HEADER_SIZE*vid+1]
#define edgeFromIncreaseSize(vid) assert(h_vert_edge_from_header[HEADER_SIZE*vid+1] < EDGE_DATA_BATCH_SIZE); h_vert_edge_from_header[HEADER_SIZE*vid+1]++
#define edgeFromDecreaseSize(vid) h_vert_edge_from_header[HEADER_SIZE*vid+1]--
#define getEdgeFromDataId(vid,p) h_vert_edge_from_data[getEdgeFromHeaderPos(vid)+p]
//edge_to
#define edgeToIncreaseSize(vid) assert(h_vert_edge_from_header[HEADER_SIZE*vid+1] < EDGE_DATA_BATCH_SIZE); h_vert_edge_to_header[HEADER_SIZE*vid+1]++
#define edgeToDecreaseSize(vid) h_vert_edge_to_header[HEADER_SIZE*vid+1]--
#define getEdgeToHeaderPos(vid) h_vert_edge_to_header[HEADER_SIZE*vid]
#define getEdgeToCurrSize(vid) h_vert_edge_to_header[HEADER_SIZE*vid+1]
#define getEdgeToDataId(vid,p) h_vert_edge_to_data[getEdgeToHeaderPos(vid)+p]
//Access
#define getPlacementX(vid1,vid2) (getX(vid1)+getX(vid2))/2
#define getPlacementY(vid1,vid2) (getY(vid1)+getY(vid2))/2
#define getPlacementZ(vid1,vid2) (getZ(vid1)+getZ(vid2))/2
//UNIFORM GRID
#define getCellHeaderPos(cell) h_cell_header[CELL_HEADER_SIZE*cell]
#define getCellHeaderSize(cell) h_cell_header[CELL_HEADER_SIZE*cell+1]
#define increaseCellSize(cell) h_cell_header[CELL_HEADER_SIZE*cell+1]++
#define getCellVertexId(cell,p) h_cell_vertices[cell*n_vertices+p]
//#define getHeapHead(cell) cell*(n_edges+1)
//HOST MEMBERS
//VERTICES
double *h_vertices; //Every 3 positions of this vector is a Vertex (x,y,z)
bool *h_vertex_removed;
double *h_quadrics; //Quadrics for vertex i
//FACES
int *h_faces; // Every 3 positions of this vector is a face (p0,p1,p2)
int *h_vert_face_header; //[DATA_POSITION,DATA_SIZE,CONTINUES_TO]
int *h_vert_face_data; //[FACE_ID,...,FACE_ID]
bool *h_face_removed;
//EDGES
int *h_edges; //Every 2 positions is a half-edge [vfrom,vto]
double *h_edge_cost; //Cost of edge i
int *h_edge_queue; //Queue of edges sorted by cost
int *h_vert_edge_from_header; //[EDGE_DATA_POSITION,EDGE_DATA_SIZE,CONTINUES_TO]
int *h_vert_edge_from_data; //[EDGE_ID, ..., EDGE_ID]
int *h_vert_edge_to_header;
int *h_vert_edge_to_data;
bool *h_edge_removed; //bool
//UNIFORM GRID
int n_cells;
//VERTEX
int *h_cell_data; //contains id of vertices inside it
int *h_cell_header; //Cell header containing initial position and size in h_cell vector
int *h_vertex_in_cell;
int *h_initial_vertices; //Number of initial vertices in each cell
int *h_cell_vertices;
int *h_cell_vertices_size;
struct elem {
int id;
double cost;
};
//EDGE
int *h_cell_heap; //Heap of edges
int *h_cell_heap_size; //Size of heap
elem *h_cell_heap_data;
int *h_cell_heap_header;
vector<vector<int> > edge_in_cell;
const int HEAP_HEADER_SIZE = 3;
const int HEAP_SIZE_VERTEX_RATIO = 8;
#define getHeapHead(cell) h_cell_heap_header[HEAP_HEADER_SIZE*(cell)]
#define getCellHeapSize(cell) h_cell_heap_header[HEAP_HEADER_SIZE*(cell)+1]
#define getCellMaxHeapSize(cell) h_cell_heap_header[HEAP_HEADER_SIZE*(cell)+2]
//UNIFORM GRID DIM and OFFSET
double dim[3];
double offset[3];
int grid_res;
//END OF HOST MEMBERS
//DEVICE MEMBERS
//DEVICE MEMBERS
//VERTICES
double* d_vertices; //Every 3 positions of this vector is a Vertex (x,y,z)
bool* d_vertex_removed;
double* d_quadrics; //Quadrics for vertex i
//FACES
int* d_faces; // Every 3 positions of this vector is a face (p0,p1,p2)
int* d_vert_face_header; //[DATA_POSITION,DATA_SIZE,CONTINUES_TO]
int* d_vert_face_data; //[FACE_ID,...,FACE_ID]
bool* d_face_removed;
//EDGES
int* d_edges; //Every 2 positions is a half-edge [vfrom,vto]
double* d_edge_cost; //Cost of edge i
int* d_edge_queue; //Queue of edges sorted by cost
int* d_vert_edge_from_header; //[EDGE_DATA_POSITION,EDGE_DATA_SIZE,CONTINUES_TO]
int* d_vert_edge_from_data; //[EDGE_ID, ..., EDGE_ID]
int* d_vert_edge_to_header;
int* d_vert_edge_to_data;
bool* d_edge_removed; //bool
//UNIFORM GRID
int d_n_cells;
int d_n_faces;
int d_n_edges;
int d_n_vertices;
//VERTEX
int* d_cell_data; //contains id of vertices inside it
int* d_cell_header; //Cell header containing initial position and size in h_cell vector
int* d_vertex_in_cell;
int* d_initial_vertices; //Number of initial vertices in each cell
int* d_cell_vertices;
int* d_cell_vertices_size;
//EDGE
int* d_cell_heap; //Heap of edges
int* d_cell_heap_size; //Size of heap
double d_dim[3];
double d_offset[3];
int d_grid_res;
//END OF DEVICE MEMBERS
//FUNCTIONS
void printTimes();
SimpGPU::SimpGPU(Surface* so)
{
s = so;
}
//Edge comparison function
//Edge queue is sorted so that the least cost is in the last position
bool compareEdges(int left, int right)
{
return h_edge_cost[left] > h_edge_cost[right];
}
bool compare(const elem &left,const elem &right)
{
return left.cost < right.cost;
}
//=====HEAP FUNCTIONS ======
//Move node up
void percUp(int i, elem* heap)
{
while(i/2 > 0)
{
if(compare(heap[i], heap[i/2]))
{
elem aux = heap[i];
heap[i] = heap[i/2];
heap[i/2] = aux;
}
i/=2;
}
}
//Insert element e into heap of size n
void insert(elem e, elem* heap, int& n)
{
// cout << "Elem id: " << e.id << endl;
heap[n+1] = e;
n++;
percUp(n, heap);
// for(int i = 0; i < n+1 && i < 10; i++) {
// //cout << "(" << heap[i].id << ","<< heap[i].cost << ") ";
// cout << "(" << heap[i].id << ") ";
// }
// cout << endl;
}
//Find child of least cost
int minChild(int i, elem* heap, int n)
{
//Does not have right child
if (i * 2 + 1 > n) return i*2;
else{
if(compare(heap[2*i],heap[2*i+1])) return 2*i;
else return 2*i+1;
}
}
//Move node down the heap
void percDown(int i, elem* heap, int n)
{
while(i*2 <= n)
{
int mc = minChild(i, heap, n);
if(compare(heap[mc],heap[i]))
{
elem tmp = heap[mc];
heap[mc] = heap[i];
heap[i] = tmp;
}
i = mc;
}
}
//Pop element of least value
elem pop(elem* heap, int& n)
{
elem ret = heap[1];
heap[1] = heap[n];
n--;
percDown(1, heap, n);
return ret;
}
//Turn vector into heap or update heap
void heapify(elem* vec, int n)
{
int i = n/2;
while( i > 0)
{
percDown(i,vec,n);
i--;
}
}
//===END OF HEAP===
bool isEntirelyInCell(int eid)
{
//Return if both endpoints are withing the same cell
return h_vertex_in_cell[getEdgeVertexId(eid,0)] == h_vertex_in_cell[getEdgeVertexId(eid,1)];
}
bool isCrownInCell(int vid)
{
//Test edges leaving (from) vid to see if their endpoints also lie within vid's cell
for(int i = 0 ; i < getEdgeFromCurrSize(vid); ++i)
{
//Check edge i from vid
int eid = getEdgeFromDataId(vid,i);
int endp = getEdgeVertexId(eid,1);
if(h_vertex_in_cell[endp] != h_vertex_in_cell[vid])
return false;
}
//Test edges arriving (to) vid
for(int i = 0 ; i < getEdgeToCurrSize(vid); ++i)
{
int eid = getEdgeToDataId(vid,i);
int endp = getEdgeVertexId(eid,0);
if(h_vertex_in_cell[endp] != h_vertex_in_cell[vid])
return false;
}
return true;
}
//============QEM================
void quadricAdd(double* a, double* b)
{
for(int i = 0; i < 4; ++i)
{
for(int j = 0; j < 4; ++j)
{
a[4*i+j] += b[4*i+j];
}
}
}
void quadricCopy(double* a, double* b)
{
for(int i = 0; i < 4; ++i)
{
for(int j = 0; j < 4; ++j)
{
a[4*i+j] = b[4*i+j];
}
}
}
//================================================
double getCost(int eid)
{
double tempQ[16] = {0}; //Temporary placement quadric
quadricCopy(tempQ,h_quadrics+(QUADRIC_SIZE*getEdgeVertexId(eid,0)));
quadricAdd(tempQ,h_quadrics+(QUADRIC_SIZE*getEdgeVertexId(eid,1)));
double tempV[4];//TEmporary vertex placement
tempV[0] = getPlacementX(getEdgeVertexId(eid,0), getEdgeVertexId(eid,1));
tempV[1] = getPlacementY(getEdgeVertexId(eid,0), getEdgeVertexId(eid,1));
tempV[2] = getPlacementZ(getEdgeVertexId(eid,0), getEdgeVertexId(eid,1));
tempV[3] = 1;
//calculate error (vQvT)
double vQ[4] = {0};
double cost = 0;
for(int k = 0; k < 4; ++k)
{
for( int l = 0; l < 4; l++)
{
vQ[k] += tempV[l]*tempQ[4*k+l];
}
}
for(int i = 0; i < 4; ++i)
{
cost += vQ[i]*tempV[i];
}
return cost;
}
//Initialize uniform grid
void SimpGPU::initUniformGrid()
{
timespec tu, tu0, tu1;
gettime(tu0);
n_cells = grid_res*grid_res*grid_res;
cerr << "No. of cells: " << n_cells << endl;
//Update offset and dim
offset[0] = s->bbox.minx;
offset[1] = s->bbox.miny;
offset[2] = s->bbox.minz;
dim[0] = s->bbox.getXLen()/grid_res;
dim[1] = s->bbox.getYLen()/grid_res;
dim[2] = s->bbox.getZLen()/grid_res;
for(int i = 0; i < n_cells; ++i)
{
h_initial_vertices[i] = 0;
//h_cell_queue_size[i] = 0;
h_cell_vertices_size[i] = 0;
getHeapHead(i) = 0;
getCellHeapSize(i) = 0;
}
//Compute gridcell for each vertex
//h_vertex_in_cell stores the cell in which vertex i is located
for(int i = 0; i < n_vertices; ++i)
{
if(h_vertex_removed[i])
{
//cerr << "-->>>> TRUE\n";
continue;
}
int cx = (getX(i) - offset[0])/dim[0];
cx -= cx/grid_res;
int cy = (getY(i) - offset[1])/dim[1];
cy -= cy/grid_res;
long long cz = (getZ(i) - offset[2])/dim[2];
cz -= cz/grid_res;
int cpos = cx + grid_res*cy + grid_res*grid_res*cz;
//Add vertex to cell
h_vertex_in_cell[i] = cpos;
h_initial_vertices[cpos]++;
//add vertex i to cell cpos
h_cell_vertices[cpos*n_vertices+h_cell_vertices_size[cpos]] = i;
h_cell_vertices_size[cpos]++;
}
//Now we compute edge queues for each cell
//An edge will be added to queue iff it is entirely in cell and both endpoints have crown entirely in the same cell
edge_in_cell.clear();
for(int i = 0; i < n_cells;++i)
{
// vector<int> vec_temp;//DEBUG
//set estimate size of heap cell
//cerr << "Cell " << i << ":\n";
getCellHeapSize(i) = 0;
getCellMaxHeapSize(i) = HEAP_SIZE_VERTEX_RATIO*h_initial_vertices[i];
if(i!=0) {
getHeapHead(i) = getHeapHead(i-1)+getCellMaxHeapSize(i-1)+1;
} else
getHeapHead(i) = 0;
//cerr << "Head: " << getHeapHead(i) << " - MaxSize: " << getCellMaxHeapSize(i) << endl;
//getHeapHead(i) = (i==0 ? 0: getHeapHead(i-1)+getCellMaxHeapSize(i-1)+1);
//cerr << "Cell " << i << endl;
//For every vertex in the cell, we get its edge
for(int j = 0; j < h_cell_vertices_size[i]; ++j)
{
//For every edge of vertex j, we check if its eligible to go into queue
for(int k = 0; k < getEdgeFromCurrSize(getCellVertexId(i,j)); ++k)
{
int eid = getEdgeFromDataId(getCellVertexId(i,j),k);
//cerr << "edge " << eid << " in " << i << " - edges: " << endl;
if(isEntirelyInCell(eid) && isCrownInCell(getEdgeVertexId(eid,0)) && isCrownInCell(getEdgeVertexId(eid,1)))
{
//cerr << "Eid: " << eid << " " << endl;
//cout << "" << h_cell_heap_data+getHeapHead(i) << " ";
elem temp = {eid,h_edge_cost[eid]};
insert(temp, h_cell_heap_data+getHeapHead(i), getCellHeapSize(i));
// vec_temp.push_back(eid);
}
}
}
// edge_in_cell.push_back(vec_temp);
}
//CUDA
//Felippe
// cerr << "aki" << endl;
// int num = 0;
// for(vector<vector<int> >::iterator it = edge_in_cell.begin(); it < edge_in_cell.end();++it){
// std::sort(it->begin(),it->end(),compareEdges);
// cerr << "Cell " << num << endl;
// for(vector<int>::iterator it2 = it->begin(); it2 < it->end(); it2++) {
// cerr << "(" << *it2 << ","<< h_edge_cost[*it2] << ") " << endl;
// }
// cerr << endl;
// num++;
// }
// cerr << "aki2" << endl;
int* h_array = new int[100];
int* d_a;
cerr << "************ ";
for(int i = 0 ; i < 100; ++i)
{
h_array[i] = i;
//cerr << h_array[i] << " ";
}
cerr << endl;
//allocate(h_array, d_a);
// for(int i = 0; i < 100; ++i)
// {
// cerr << h_array[i] << " ";
// }
// cerr << endl;
// for(int i = 0; i < n_cells; i++) {
// cerr << "Cell " << i << " - HeapHead: " << getHeapHead(i) << " - HeapSize: " << getCellHeapSize(i) << " - MaxSize: " << getCellMaxHeapSize(i) << endl;
// }
gettime(tu1);
tu = diff(tu0,tu1);
cerr << "Time to initialize uniform grid: " << getMilliseconds(tu) << endl;
}
void removeVertex(int vid)
{
h_vertex_removed[vid] = true;
}
void removeEdge(int eid)
{
int v1 = getEdgeVertexId(eid,0);
int v2 = getEdgeVertexId(eid,1);
//Remove from
for(int i = 0 ; i < getEdgeFromCurrSize(v1); ++i)
{
if(h_vert_edge_from_data[getEdgeFromHeaderPos(v1)+i] == eid)
{
h_vert_edge_from_data[getEdgeFromHeaderPos(v1)+i] = h_vert_edge_from_data[getEdgeFromHeaderPos(v1)+getEdgeFromCurrSize(v1)-1];
edgeFromDecreaseSize(v1);
break;
}
}
//Remove to
for(int i = 0; i < getEdgeToCurrSize(v2);++i)
{
//cerr << "searching... ";
//cerr << getEdgeToDataId(v2,i);
if(h_vert_edge_to_data[getEdgeToHeaderPos(v2)+i] == eid)
{
//cerr <<"Found\n";
h_vert_edge_to_data[getEdgeToHeaderPos(v2)+i] = h_vert_edge_to_data[getEdgeToHeaderPos(v2)+getEdgeToCurrSize(v2)-1];
edgeToDecreaseSize(v2);
break;
}
}
//cerr << "edge " << eid << " removed\n";
h_edge_removed[eid] = true;
}
void collapse(int eid)
{
int v1 = getEdgeVertexId(eid,0);
int v2 = getEdgeVertexId(eid,1);
//cerr << "*********Collapsing " << eid << ": "<< v1 << " -> " << v2 << " = " << h_edge_cost[eid] << endl;
if(h_vertex_removed[v1])
{
cerr << "***WARNING v1 removed.\n";
cin.get();
}
else if (h_vertex_removed[v2])
{
cerr <<"***WARNING v2 removed.\n";
cin.get();
}
else if( v1 == v2)
{
cerr << "*!*!*!*!\n";
}
for(int i = 0; i < getFaceCurrSize(v1); ++i)
{
bool removeFace = false;
int face_it = getFaceId(v1,i);
if(getFaceVertexId(face_it,0) == v2 || getFaceVertexId(face_it,1)==v2 || getFaceVertexId(face_it,2) == v2)
{
//cerr << face_it << " <" << getFaceVertexId(face_it,0) << " " << getFaceVertexId(face_it,1) << " " << getFaceVertexId(face_it,2) << ">\n";
//cerr << "remove\n";
//REMOVEFACE()
//Remove this face since it shares v1 and v2
//Warning: check if it is already removed?
h_face_removed[face_it] = true;
i--;
//Remove face from its vertices lists
for(int j = 0 ; j < 3; ++j)
{
int vid = getFaceVertexId(face_it,j);
for(int k = 0; k < getFaceCurrSize(vid);++k)
{
if(getFaceId(vid,k) == face_it){
//cerr << getFaceId(getFaceVertexId(face_it,j),k) << " ";
h_vert_face_data[vid*FACE_DATA_BATCH_SIZE+k] = h_vert_face_data[vid*FACE_DATA_BATCH_SIZE+getFaceCurrSize(vid)-1];
faceDecreaseSize(vid);
}
}
}
//END OF REMOVEFACE()
}
else
{
//cerr <<"Update\n";
//This face won't be removed, but modified
//Find pointer to v1 and replace for v2
if(h_faces[FACE_SIZE*face_it] == v1) h_faces[FACE_SIZE*face_it] = v2;
else if (h_faces[FACE_SIZE*face_it+1] == v1) h_faces[FACE_SIZE*face_it+1] = v2;
else if (h_faces[FACE_SIZE*face_it+2] == v1) h_faces[FACE_SIZE*face_it+2] = v2;
}
}
//Copy list of faces from v1 to v2
for(int i = 0; i < getFaceCurrSize(v1); ++i)
{
//Add face to v2's list
h_vert_face_data[v2*FACE_DATA_BATCH_SIZE+getFaceCurrSize(v2)] = getFaceId(v1,i);
faceIncreaseSize(v2);
}
h_vertices[VERTEX_SIZE*v2] = getPlacementX(v1,v2);
h_vertices[VERTEX_SIZE*v2+1] = getPlacementY(v1,v2);
h_vertices[VERTEX_SIZE*v2+2] = getPlacementZ(v1,v2);
//REMOVEEDGE STARTS
//Update edges from v1
removeEdge(eid);
//Remove DOUBLE EDGES
//Edges of which destiny already exists in v2
for(int i = 0; i < getEdgeFromCurrSize(v1); ++i)
{
//cerr <<"loop " << i << " " << getEdgeFromCurrSize(v1) << " " << getEdgeFromCurrSize(v2) << endl;
int eit = h_vert_edge_from_data[getEdgeFromHeaderPos(v1)+i];
if(v2 == getEdgeVertexId(eit,1)) //Remove edge v2 -> v2 (would be)
{
//cerr <<"removing";
removeEdge(eit);
i--;
continue;
}
bool edge_exists = false;
for(int j = 0; j < getEdgeFromCurrSize(v2); ++j)
{
int eit2 = h_vert_edge_from_data[getEdgeFromHeaderPos(v2)+j];
//cerr << "edge " << eit << " " << getEdgeVertexId(eit,1) << endl;
//cerr << "edge2 " << eit2 << " " << getEdgeVertexId(eit2,1) << endl;
if(getEdgeVertexId(eit,1) == getEdgeVertexId(eit2,1))
{
//cerr <<"Removing " << eit << endl;
edge_exists = true;
removeEdge(eit);
//j--;
i--;
break;
}
}
//else append it to v2's list
if(!edge_exists){
h_edges[EDGE_SIZE*eit] = v2;
h_vert_edge_from_data[v2*EDGE_DATA_BATCH_SIZE+getEdgeFromCurrSize(v2)] = getEdgeFromDataId(v1,i);
edgeFromIncreaseSize(v2);
}
}
//Edges of which source already exists in v2
for(int i = 0; i < getEdgeToCurrSize(v1); ++i)
{
int eit = h_vert_edge_to_data[getEdgeToHeaderPos(v1)+i];
if(v2 == getEdgeVertexId(eit,0)) //This would create edge v2->v2
{
removeEdge(eit);
i--;
continue;
}
bool edge_exists = false;
for(int j = 0; j < getEdgeToCurrSize(v2); ++j)
{
int eit2 = h_vert_edge_to_data[getEdgeToHeaderPos(v2)+j];
//cerr << "eid2- " << eit2 << " is " << h_edges[eit2*EDGE_SIZE] << " - " << h_edges[eit2*EDGE_SIZE+1] << endl;
if(getEdgeVertexId(eit,0) == getEdgeVertexId(eit2,0))
{
edge_exists = true;
removeEdge(eit);
//j--;
i--;
break;
}
}
if(!edge_exists)
{
h_vert_edge_to_data[v2*EDGE_DATA_BATCH_SIZE+getEdgeToCurrSize(v2)] = h_vert_edge_to_data[v1*EDGE_DATA_BATCH_SIZE+i];
h_edges[EDGE_SIZE*getEdgeToDataId(v1,i)+1] = v2;
edgeToIncreaseSize(v2);
}
}
//REMOVEEDGE ENDS
//REMOVE VERTEX
//h_vertex_removed[v1] = true;
removeVertex(v1);
//cerr << "Finished collapse\n";
}
void updateEdgeCosts(int vid)
{
//cerr <<"Updating costs for vid " << vid << endl;
for(int i = 0 ; i < getEdgeFromCurrSize(vid); ++i)
{
int eid = getEdgeFromDataId(vid,i);
if(isEntirelyInCell(eid) && isCrownInCell(getEdgeVertexId(eid,0)) && isCrownInCell(getEdgeVertexId(eid,1)))
{
h_edge_cost[eid] = getCost(eid);
}
}
for(int i = 0; i < getEdgeToCurrSize(vid); ++i)
{
int eid = getEdgeToDataId(vid,i);
//cerr << "Updating eid " << eid << " " << h_edges[eid*EDGE_SIZE] << "-" << h_edges[eid*EDGE_SIZE+1] << " = " << h_edge_cost[eid] << " ";
if(isEntirelyInCell(eid) && isCrownInCell(getEdgeVertexId(eid,0)) && isCrownInCell(getEdgeVertexId(eid,1)))
{
h_edge_cost[eid] = getCost(eid);
}
//cerr << " = " << h_edge_cost[eid] << endl;
}
//std::sort(h_cell_queue.data()+(h_vertex_in_cell[vid]*n_cells),h_cell_queue.data()+(h_vertex_in_cell[vid]*n_cells+h_cell_queue_size[vid]),compareEdges);
}
void updateQueue(int cell)
{
timespec ts, ts0, ts1;
gettime(ts0);
//cerr << "Heapify\n";
//heapify(h_cell_heap+getHeapHead(cell), h_cell_heap_size[cell]);
//std::sort(h_cell_queue.data()+(cell*n_edges),h_cell_queue.data()+(cell*n_edges+h_cell_queue_size[cell]),compareEdges);
gettime(ts1);
ts = diff(ts0,ts1);
time_sorting+=getNanoseconds(ts);
}
void updateHeap(int vid,int cell) {
timespec ts, ts0, ts1;
gettime(ts0);
//cerr <<"Updating costs for vid " << vid << endl;
elem temp;
for(int i = 0 ; i < getEdgeFromCurrSize(vid); ++i)
{
int eid = getEdgeFromDataId(vid,i);
if(isEntirelyInCell(eid) && isCrownInCell(getEdgeVertexId(eid,0)) && isCrownInCell(getEdgeVertexId(eid,1)))
{
temp.id = eid;
temp.cost = h_edge_cost[eid];
insert(temp,h_cell_heap_data+getHeapHead(cell), getCellHeapSize(cell));
//h_edge_cost[eid] = getCost(eid);
}
}
for(int i = 0; i < getEdgeToCurrSize(vid); ++i)
{
int eid = getEdgeToDataId(vid,i);
//cerr << "Updating eid " << eid << " " << h_edges[eid*EDGE_SIZE] << "-" << h_edges[eid*EDGE_SIZE+1] << " = " << h_edge_cost[eid] << " ";
if(isEntirelyInCell(eid) && isCrownInCell(getEdgeVertexId(eid,0)) && isCrownInCell(getEdgeVertexId(eid,1)))
{
temp.id = eid;
temp.cost = h_edge_cost[eid];
insert(temp,h_cell_heap_data+getHeapHead(cell), getCellHeapSize(cell));
//h_edge_cost[eid] = getCost(eid);
}
//cerr << " = " << h_edge_cost[eid] << endl;
}
gettime(ts1);
ts = diff(ts0,ts1);
time_sorting+=getNanoseconds(ts);
//std::sort(h_cell_queue.data()+(h_vertex_in_cell[vid]*n_cells),h_cell_queue.data()+(h_vertex_in_cell[vid]*n_cells+h_cell_queue_size[vid]),compareEdges);
}
void SimpGPU::simplify(int goal, int gridres=1)
{
grid_res = gridres;
cerr << "Initializing Data Structures...\n";
initDataStructures();
cerr << "Computing initial quadrics...\n";
initQuadrics();
cerr << "Computing edges...\n";
initEdges();
int dropHeap = 0;
int vertices_removed = 0;
cerr << "Target vertex count: " << n_vertices - goal << endl;
//STILL NEED TO_EDGES
timespec ts, ts0, ts1;
gettime(ts0);
n_cells = gridres*gridres*gridres;
h_vertex_in_cell = new int[n_vertices];
h_initial_vertices = new int[n_cells];
h_cell_vertices_size = new int[n_cells];
h_cell_vertices = new int[n_cells*n_vertices];
h_cell_heap_data = new elem [HEAP_SIZE_VERTEX_RATIO*n_vertices];
h_cell_heap_header = new int [HEADER_SIZE*n_cells];
timespec tdev, tdev0, tdev1;
gettime(tdev0);
initDeviceEnvironment(hostArgumentList, environmentArgumentList);
gettime(tdev1);
tdev = diff(tdev0,tdev1);
time_init_device += getNanoseconds(tdev);
while(vertices_removed < goal)
{
cerr << "Initializing Uniform Grid...\n";
initUniformGrid();
cerr << greentty << "Grid: " << grid_res << deftty << endl;
//Simplify each cell
for(int i = 0; i < n_cells; ++i)
{
int vr = 0;
if(getCellHeapSize(i) == 0) continue; //Cell is empty, move to next one
// cout << "Cell " << i << endl;
while(vr < h_initial_vertices[i]/grid_res && vertices_removed < goal && getCellHeapSize(i)>0)
{
elem edge = pop(h_cell_heap_data+getHeapHead(i), getCellHeapSize(i));
if(h_edge_removed[edge.id]){
// for(vector<int>::iterator it = edge_in_cell[i].begin(); it < edge_in_cell[i].end();it++) {
// if(*it == edge.id) {
// edge_in_cell[i].erase(it);
// }
// }
continue;
}
if(edge.cost != h_edge_cost[edge.id]) { dropHeap++; continue;}
/*Felippe
std::sort(edge_in_cell[i].begin(),edge_in_cell[i].end(),compareEdges);
while(h_edge_removed[edge_in_cell[i].back()]) {
edge_in_cell[i].pop_back();
}
cout << "Lesser cost edge: " << edge_in_cell[i].back() << endl;
if(h_edge_removed[edge_in_cell[i].back()])
cout << "Lesser Cost Edge already removed!!!!!!!!!!!!!!!" << endl;
cout << "Heap top: " << edge.id << endl;
if(h_edge_removed[edge.id])
cout << "Heap Top Edge already removed!!!!!!!!!!!!!!!" << endl;
cout << "Elem Cost: " << edge.cost << " - Current Cost: " << h_edge_cost[edge.id] << endl;
if(edge_in_cell[i].back() != edge.id) {
if( h_edge_cost[edge_in_cell[i].back()] != edge.cost)
cout << "Houston!! We have a problem" << endl;
for(int it = edge_in_cell[i].size()-1; it >= 0;it--)
if(edge_in_cell[i][it] == edge.id) {
cout << "Edge found at posstion: " << it << " WTF??" << endl;
cout << "Costs: Top Queue(" << h_edge_cost[edge_in_cell[i].back()] << ") - Top Heap Current(" << h_edge_cost[edge.id] << ")" <<endl;
}
}
*/
//cerr << "eid " << eid << endl;
//int queue_it = h_cell_queue_size[i]-1;
//cerr << "cell " << i << " queue_it " << queue_it << endl;
//Last position should contain the least cost edge
//int eid = h_cell_queue[i*n_edges+queue_it];
//h_cell_queue_size[i]--;
// int edgetop = -1; //pop(h_cell_queue.data()+getHeapHead(i), h_cell_heap_size[i]);
// while(edgetop<0 && h_cell_heap_size[i] > 0)
// {
// edgetop = pop(h_cell_heap.data()+getHeapHead(i), h_cell_heap_size[i]);
// if(h_edge_removed[edgetop])
// {
// edgetop = -1;
// }
// }
//
// cerr << "queue " << eid << " - " << h_edge_cost[eid] << endl;
// cerr << "heap " << edgetop << " - " << h_edge_cost[edgetop] << endl;
// if(h_edge_cost[eid] - h_edge_cost[edgetop] != 0) cerr << "***>>> Diff cost\n";
//cin.get();
timespec t, t0, t1;
gettime(t0);
collapse(edge.id);
gettime(t1);
// cout << "Removed " << edge.id << endl;
// cout << "----------------------------------------------------------" << endl;
// edge_in_cell[i].pop_back();
t = diff(t0,t1);
time_collapse+=getNanoseconds(t);
quadricAdd(h_quadrics+(h_edges[edge.id*EDGE_SIZE+1]*QUADRIC_SIZE), h_quadrics+(h_edges[edge.id*EDGE_SIZE]*QUADRIC_SIZE));
vr++;
vertices_removed++;
updateEdgeCosts(getEdgeVertexId(edge.id,1));
gettime(t0);
//updateQueue(i);
updateHeap(getEdgeVertexId(edge.id,1),i);
gettime(t1);
t = diff(t0,t1);
time_updating_queue+=getNanoseconds(t);
}
}
if(grid_res>=2) grid_res/=2;
}
gettime(ts1);
ts = diff(ts0,ts1);
time_simplify+=getNanoseconds(ts);
printTimes();
cerr << "Edges dropped: " << dropHeap << endl;
updateSurface();
}
void SimpGPU::initDataStructures()
{
n_faces = s->m_faces.size();
n_vertices = s->m_points.size();
h_faces = new int[FACE_SIZE*n_faces];
h_face_removed = new bool[n_faces];
h_vertices = new double[VERTEX_SIZE*n_vertices];
h_vertex_removed = new bool[n_vertices];
h_quadrics = new double[16*n_vertices];
h_vert_face_header = new int[HEADER_SIZE*n_vertices];
h_vert_face_data = new int[FACE_DATA_BATCH_SIZE*n_vertices];
//TODO:Read surface in this format.
for(int i = 0; i < s->m_points.size(); ++i)
{
h_vertices[3*i] = s->m_points[i]->x;
h_vertices[3*i+1] = s->m_points[i]->y;
h_vertices[3*i+2] = s->m_points[i]->z;
h_vertex_removed[i] = false;
}
for(int i = 0 ; i < s->m_faces.size(); ++i)
{
h_faces[3*i] = s->m_faces[i]->points[0]->id;
h_faces[3*i+1] = s->m_faces[i]->points[1]->id;
h_faces[3*i+2] = s->m_faces[i]->points[2]->id;
h_face_removed[i] = false;
}
timespec tinit, tinit0, tinit1;
gettime(tinit0);
//TODO: Create vert_face on device.
int max_size = 0;
for(int i = 0; i < n_vertices; ++i)
{
int vfaces=0;
h_vert_face_header[HEADER_SIZE*i] = i*FACE_DATA_BATCH_SIZE;