-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCTree.cpp
2127 lines (1737 loc) · 60.1 KB
/
CTree.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 "CTree.h"
extern int g_currLevel;
extern int g_maxLevel;
extern bool g_bShowLeaves;
extern double g_thickness;
extern float NodeSpanValue; //0.1-0.3
extern char g_optimizationFile[];
extern FILE *fobj;
extern int lastIndex;
/*需要控制的地方：加载树文件 ， 遍历求半径 ， 绘制树枝。*/
#define DELETESPAN 0.2
/*同时加载两个树的结构*/
CTree::CTree()
{
srand(time(NULL));
m_nTreeList = 0;
m_nLeafList = 0;
m_nColorTreeList=0;
}
bool CTree::LoadTree(char *fileName)
{
int i, j, id, maxLevel;
double scale;
char leafFileName[512];
CBranch *NewBranch;
CBranch *NewBranchColor;
queue<int> outTree;
int oBackValue=0;
int iBackValue=0;
int pos=0;
int count=0;
int *SearchArray;
int newPos;
ifstream inFile(fileName);
ofstream outFile(g_optimizationFile);
if(inFile==NULL) return false ;
inFile>>leafFileName;
cout<<leafFileName<<endl;
LoadLeaf(leafFileName);
inFile>>scale;
inFile>>m_branchClr.x>>m_branchClr.y>>m_branchClr.z;
inFile>>m_num;//分支数目
cout<<"Number of branches:"<<m_num<<endl;
// m_nodes = new CBranch[m_num];
// m_nodes.resize(m_num);
//采用push_front的形式插入元素；
//预分配空间，方便后面的操作
for(i=0; i<m_num; i++)
{
NewBranch = new CBranch();
m_nodes.push_back(NewBranch);
NewBranchColor = new CBranch();
m_nodesColor.push_back(NewBranchColor);
}
for(i=0; i<m_num; i++)
{
inFile>>id>>m_nodes[i]->level; //
m_nodesColor[i]->level = m_nodes[i]->level;
if(i==0)
{
m_nodes[i]->pid=-1;
m_nodesColor[i]->pid=-1;
maxLevel=m_nodes[i]->level;
}
else
{
if(m_nodes[i]->level > maxLevel) //这里就是在更新的时候，少许的读取数据
maxLevel = m_nodes[i]->level;
}
inFile>>m_nodes[i]->cnum;
m_nodesColor[i]->cnum = m_nodes[i]->cnum;
m_cnum.push_back(m_nodes[i]->cnum);
m_nodes[i]->cid = new int [m_nodes[i]->cnum];
m_nodesColor[i]->cid = new int [m_nodesColor[i]->cnum] ;
for(j=0; j<m_nodes[i]->cnum; j++)
{
inFile >>m_nodes[i]->cid[j];
m_nodesColor[i]->cid[j] = m_nodes[i]->cid[j];
m_nodes[m_nodes[i]->cid[j]]->pid=i;
m_nodesColor[m_nodesColor[i]->cid[j]]->pid = i;
}
inFile>>m_nodes[i]->vs.x>>m_nodes[i]->vs.y>>m_nodes[i]->vs.z;
inFile>>m_nodes[i]->ve.x>>m_nodes[i]->ve.y>>m_nodes[i]->ve.z;
inFile>>m_nodes[i]->ds;
m_nodesColor[i]->vs = m_nodes[i]->vs;
m_nodesColor[i]->ve = m_nodes[i]->ve;
m_nodesColor[i]->ds = m_nodes[i]->ds; //
m_nodes[i]->vs = m_nodes[i]->vs*scale;
m_nodes[i]->ve = m_nodes[i]->ve*scale;
m_nodes[i]->ds = m_nodes[i]->ds*scale;
m_nodesColor[i]->vs = m_nodes[i]->vs*scale;
m_nodesColor[i]->ve = m_nodes[i]->ve*scale;
m_nodesColor[i]->ds = m_nodes[i]->ds*scale;
if(m_nodes[i]->cnum==0)
g_thickness = m_nodes[i]->ds;
//设置未被删除的flag
m_nodes[i]->flag=true;
m_nodesColor[i]->flag= true;
} //finish read
////////////////////////////////////建立父亲孩子关系；
inFile.close();
g_maxLevel = maxLevel; //maintain a maxLevel of tree;
cout<<"number of Levels: "<<g_maxLevel<<endl;
g_currLevel = g_maxLevel;
AdjustBranches(); //calculate radii
//保存一次数据 -----就是把m_nodes 中的数据拷贝到m_nodesColor中
for(i=0; i<m_num; i++)
{
m_nodesColor[i]->de = m_nodes[i]->de;
}
/////
inFile.close();
//树的数据已经全部建立了，下面就是创建列表了，绘制树的结构
RemoveIrregularBranch();
MarkBranch();
// processBranchWithAngle();
// oBackValue= optimization();
// iBackValue =interSectTionOptimization(); //优化的代码要在创建树的列表前面被执行
//
// CreateTreeList();
// CreateColorTreeList();
/*把经过处理的文件重新写入到文件中 --- 采用的方法是：先重新索引，在重新确定位置，最后写入到文件中*/
for(i=0; i<m_num; i++)
if(m_nodes[i]->flag == false)
{
count++;
}
cout<<"begin outFile"<<endl;
outFile<<leafFileName<<endl;
outFile<<scale<<endl;
outFile<<m_branchClr.x<<" "<<m_branchClr.y<<" "<<m_branchClr.z<<endl;
outFile<<m_num-count<<endl;
SearchArray=new int [m_num-count]; //这里的内存分配可能存在问题
count=0;
for(i=0; i<m_num; i++)
if(m_nodes[i]->flag == true)
{
SearchArray[count] = i;
count++;
}
//一遍遍历，一遍索引，一遍写入文件
for(i=0; i<m_num; i++)
{
if(m_nodes[i]->flag==true)
{
for(j=0; j<m_nodes[i]->cnum; j++)
{
newPos = binarySearch(SearchArray,m_nodes[i]->cid[j],0,count-1);
if(newPos==-2)
{
cout<<"error1"<<endl;
exit(1);
}
m_nodes[i]->cid[j]=newPos;
}
//写文件 -- pos是新的位置
outFile<<pos<<" "<<m_nodes[i]->level<<" ";
if(m_nodes[i]->cnum!= m_cnum[i])
{
cout<<"error2"<<endl;
exit(0);
}
outFile<<m_nodes[i]->cnum<<" ";
for(j=0; j<m_nodes[i]->cnum; j++)
{
outFile<<m_nodes[i]->cid[j]<<" ";
}
outFile<<m_nodes[i]->vs.x<<" "<<m_nodes[i]->vs.y<<" "<<m_nodes[i]->vs.z<<" ";
outFile<<m_nodes[i]->ve.x<<" "<<m_nodes[i]->ve.y<<" "<<m_nodes[i]->ve.z<<" ";
outFile<<m_nodes[i]->ds<<endl;
pos++;
}
}//end of for
// g_thickness=0.02;
ReLoadTree(g_optimizationFile); //重新加载一棵树
// CalculateRadii(*m_nodes[0]);
// AdjustBranches();
CreateLeafList(); //创建叶子的时候，跟树的数据结构一点关系都没有 叶子的列表应该在前面 其实在loadLeaf后就可以
CreateColorTreeList();
CreateTreeList();
return true ;
}
//递归的二岔搜索
int CTree::binarySearch(int *searchData , int value,int low , int high)
{
int middle;
if(low>high)
return -2;
middle = (low+high)/2;
if(value==searchData[middle])
return middle;
if(value<searchData[middle]) // former
{
binarySearch(searchData,value,low, middle-1);
}
else //later
{
binarySearch(searchData,value,middle+1, high);
}
}
//仅仅是更新数据
void CTree::ReLoadTree(char * fileName)
{
int i, j, id, maxLevel;
double scale;
char leafFileName[512];
CBranch *NewBranch;
ifstream inFile(fileName);
if(inFile==NULL) return ;
inFile>>leafFileName;
cout<<leafFileName<<endl;
inFile>>scale;
inFile>>m_branchClr.x>>m_branchClr.y>>m_branchClr.z;
inFile>>m_num;//分支数目
m_cnum.clear();
for(i=0; i<m_num; i++)
{
NewBranch = new CBranch();
m_nodes.push_back(NewBranch);
}
for(i=0; i<m_num; i++)
{
inFile>>id>>m_nodes[i]->level; //
if(i==0)
{
m_nodes[i]->pid=-1;
maxLevel=m_nodes[i]->level;
}
else
{
if(m_nodes[i]->level > maxLevel) //这里就是在更新的时候，少许的读取数据
maxLevel = m_nodes[i]->level;
}
inFile>>m_nodes[i]->cnum;
m_cnum.push_back(m_nodes[i]->cnum);
m_nodes[i]->cid = new int [m_nodes[i]->cnum];
for(j=0; j<m_nodes[i]->cnum; j++)
{
inFile >>m_nodes[i]->cid[j];
m_nodes[m_nodes[i]->cid[j]]->pid=i;
}
inFile>>m_nodes[i]->vs.x>>m_nodes[i]->vs.y>>m_nodes[i]->vs.z;
inFile>>m_nodes[i]->ve.x>>m_nodes[i]->ve.y>>m_nodes[i]->ve.z;
inFile>>m_nodes[i]->ds;
m_nodes[i]->vs = m_nodes[i]->vs*scale;
m_nodes[i]->ve = m_nodes[i]->ve*scale;
m_nodes[i]->ds = m_nodes[i]->ds*scale;
if(m_nodes[i]->cnum==0)
g_thickness = m_nodes[i]->ds;
//设置未被删除的flag , 新添加的树枝是未被删除的。
m_nodes[i]->flag=true;
} //finish read
////////////////////////////////////建立父亲孩子关系；
g_maxLevel = maxLevel; //maintain a maxLevel of tree;
g_currLevel = g_maxLevel;
inFile.close();
AdjustBranches();
}
bool CTree::LoadLeaf(char *modelFileName)
{
ifstream inFile;
int i, idx;
int nVeinVNum, nVerticesNum, nTrianglesNum;
double dia;
CVector3D ver, v1, v2, v3;
double texX, texY;
int a, b, c;
double scale;
inFile.open(modelFileName);
if(!inFile) return false;
inFile >> m_petioleClr.x >> m_petioleClr.y >> m_petioleClr.z;
inFile >> m_leafClr.x >> m_leafClr.y >> m_leafClr.z;
inFile >> scale;
inFile >> nVeinVNum >> nVerticesNum >> nTrianglesNum;
m_leafVein.resize(nVeinVNum);
m_leafVeinDia.resize(nVeinVNum);
m_leafLaminae.resize(nVerticesNum);
m_leafTexcoord.resize(2*nVerticesNum);
m_leafTri.resize(3*nTrianglesNum);
m_leafNorm.resize(nTrianglesNum);
for(i=0; i<nVeinVNum; i++)
{
inFile >> idx >> ver.x >> ver.y >> ver.z >> dia;
m_leafVein[i] = ver*scale;
m_leafVeinDia[i] = dia*scale;
}
for(i=0; i<nVerticesNum; i++)
{
inFile >> idx >> ver.x >> ver.y >> ver.z >>texX >> texY;
m_leafLaminae[i] = ver*scale;
m_leafTexcoord[2*i] = texX; //按序存储数据
m_leafTexcoord[2*i+1] = texY;
}
for(i=0; i<nTrianglesNum; i++)
{
inFile >> idx >> a >> b >> c;
m_leafTri[3*i] = a;
m_leafTri[3*i+1] = b;
m_leafTri[3*i+2] = c;
v1 = m_leafLaminae[b] - m_leafLaminae[a];
v2 = m_leafLaminae[c] - m_leafLaminae[a];
v3 = v1.Outer(v2); //Outer是求内积，就是计算方向向量
m_leafNorm[i] = v3.Normal();
if(m_leafNorm[i].y<0)
m_leafNorm[i] = m_leafNorm[i]*(-1);
}
inFile.close();
return true;
}
//计算每一根树枝的末端半径 de
void CTree::AdjustBranches()
{
int i , j, k;
double maxDia = 0.0 ;
for(i=0; i<m_num; i++)
{
maxDia=0.0;
if(m_nodes[i]->flag == false) continue;
for(j=0; j<m_nodes[i]->cnum; j++)
{
k= m_nodes[i]->cid[j];
if(m_nodes[k]->ds>maxDia)
maxDia = m_nodes[k]->ds;
}
if(m_nodes[i]->cnum==0)
m_nodes[i]->de=m_nodes[i]->ds;
else
m_nodes[i]->de=maxDia; //其实，adjustBranch函数的目的就是为了求的每一个分支的终止半径，因为起始半径ds 是从文件中读取的
}
}
void CTree::CreateLeafList()
{
cout<<"---createleaflist\n";
if(m_nLeafList!=0)
{
glDeleteLists(m_nLeafList,1);
m_nLeafList=0;
}
m_nLeafList = glGenLists(1);
glNewList(m_nLeafList,GL_COMPILE); //绘制列表，主要就是如何绘制叶子
DrawLeaf();
glEndList();
}
void CTree::DrawLeaf()
{
cout<<"---drawleaf\n";
CVector3D v1 , v2 , v3;
int i , tnum , a, b,c;
int * leafIndexSet;
tnum = m_leafTri.size()/3;
glEnable(GL_LIGHTING);
glColor3f(m_petioleClr.x, m_petioleClr.y, m_petioleClr.z);
//glColor3f( 0.5, 0.5,0.5);
DrawPetiole();
glColor3f(m_leafClr.x, m_leafClr.y, m_leafClr.z);
glBegin(GL_TRIANGLES);
for (i=0; i<tnum; i++)
{
a = m_leafTri[3*i];
b = m_leafTri[3*i+1];
c = m_leafTri[3*i+2];
glNormal3f(m_leafNorm[i].x, m_leafNorm[i].y, m_leafNorm[i].z); //面的法线
glTexCoord2d(m_leafTexcoord[2*a],m_leafTexcoord[2*a+1]);
glVertex3d(m_leafLaminae[a].x, m_leafLaminae[a].y, m_leafLaminae[a].z);
glTexCoord2d(m_leafTexcoord[2*b], m_leafTexcoord[2*b+1]);
glVertex3d(m_leafLaminae[b].x, m_leafLaminae[b].y, m_leafLaminae[b].z);
glTexCoord2d(m_leafTexcoord[2*c], m_leafTexcoord[2*c+1]);
glVertex3d(m_leafLaminae[c].x, m_leafLaminae[c].y, m_leafLaminae[c].z);
}
glEnd();
}
void CTree::DrawPetiole()
{
//cout<<"----draw petiole\n";
const int SLICE_NUM=3;
int i,j,num;
CVector3D vDirStart , vDirEnd , InitM , N ,B ,vTmp;
CVector3D posStart[SLICE_NUM];
CVector3D posEnd[SLICE_NUM];
CVector3D normStart[SLICE_NUM];
CVector3D normEnd[SLICE_NUM];
num = m_leafVein.size();
for(i=0; i<(num-1); i++)
{
if(i==0)
vDirStart=m_leafVein[i+1]-m_leafVein[i];
else
vDirStart = vDirEnd;
if(i==(num-2))
vDirEnd=m_leafVein[i+1] - m_leafVein[i];
else
vDirEnd = m_leafVein[i+2] - m_leafVein[i+1];
if(i==0)
{
if(vDirStart.x*vDirStart.y*vDirStart.z!=0)
{
double d=sqrt(vDirStart.y*vDirStart.y+vDirStart.z*vDirStart.z);
InitM.Set(0,vDirStart.z/d,-vDirStart.y/d);
}
else
{
if(vDirStart.x==0) InitM.Set(1,0,0);
else if(vDirStart.y==0) InitM.Set(0,1,0);
else InitM.Set(0,0,1);
}
N = InitM.Outer(vDirStart);
N.Normal();
B=vDirStart.Outer(N);
B.Normal();
for(j=0; j<SLICE_NUM; j++)
{
normStart[j] = N*cos(2*M_PI*j/(double)SLICE_NUM);
vTmp=B*sin(2*M_PI*j/(double)SLICE_NUM);
normStart[j] = normStart[j] + vTmp;
posStart[j] = normStart[j]*0.5*m_leafVeinDia[i] + m_leafVein[i];
posStart[j] = posStart[j];
}
}
else
{
for(j=0; j<SLICE_NUM; j++)
{
normStart[j]= normEnd[j];
posStart[j] = posEnd[j];
}
}
N = B.Outer(vDirEnd);
N.Normalize();
B = vDirEnd.Outer(N);
B.Normalize();
for(j=0; j<SLICE_NUM; j++)
{
normEnd[j]= N*cos(2* M_PI*j/(double)SLICE_NUM);
vTmp = B*sin(2* M_PI*j/(double)SLICE_NUM);
normEnd[j] = normEnd[j] + vTmp;
posEnd[j] = normEnd[j]*0.5*m_leafVeinDia[i+1] + m_leafVein[i+1];
posEnd[j] = posEnd[j];
}
glBegin(GL_QUAD_STRIP);
for(j=0; j<SLICE_NUM; j++)
{
glNormal3d(normEnd[j].x,normEnd[j].y,normEnd[j].z);
glVertex3d(posEnd[j].x,posEnd[j].y,posEnd[j].z);
glNormal3d(normStart[j].x,normStart[j].y,normStart[j].z);
glVertex3d(posStart[j].x,posStart[j].y,posStart[j].z);
}
glNormal3d(normEnd[0].x,normEnd[0].y,normEnd[0].z);
glVertex3d(posEnd[0].x,posEnd[0].y,posEnd[0].z);
glNormal3d(normStart[0].x,normStart[0].y,normStart[0].z);
glVertex3d(posStart[0].x,posStart[0].y,posStart[0].z);
glEnd();
}
}
void CTree::CreateColorTreeList()
{
int pos , i;
queue<int> q;
if(m_nColorTreeList!=0)
{
glDeleteLists(m_nColorTreeList,1);
m_nColorTreeList=0;
}
m_nColorTreeList = glGenLists(1);
glNewList(m_nColorTreeList,GL_COMPILE);
DrawColorBranches();
if(g_bShowLeaves)
{
q.push(0);
while(!q.empty())
{
pos=q.front(); //取队首元素
q.pop(); //删除元素
ArrangeWhorledLeaves(m_nodesColor[pos]->vs, m_nodesColor[pos]->ve);
for(i=0; i<LEAF_NUM; i++)
{
glPushMatrix();
glMultMatrixd(m_leafmat[i].glMatrix());
glCallList(m_nLeafList); //一根树枝就是绘制一次树叶文件，文件一共有5片叶子,绘制的时候在首位添加两片叶子
glPopMatrix();
}
for(i=0; i<m_nodesColor[pos]->cnum; i++) //被标记为false的都已经不在完全图中了，所以通过遍历不可能遍历到标记为false的树枝
// if(m_nodes[m_nodes[pos]->cid[i]]->flag==true) //枝没有被删除，才处理，否则就不用了。
q.push(m_nodesColor[pos]->cid[i]);
}
}
glEndList();
}
void CTree::DrawColorBranches()
{
int i , pos;
queue<int> q ;
queue<int> deleteBranch;
int number=0;
glEnable(GL_LIGHTING);
glEnable(GL_BLEND);
glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);
glColor4f(m_branchClr.x, m_branchClr.y, m_branchClr.z,1.0f);
m_nodesColor[0]->Np=false;
q.push(0);
while (!q.empty())
{
pos = q.front();
q.pop();
if(m_nodesColor[pos]->flag==true)
{
glColor4f(m_branchClr.x, m_branchClr.y, m_branchClr.z,1.0f);
ColorGeneralizedCylinder(*m_nodesColor[pos]); // Q 1 color branch Np all is false
number++;
}
else
{
glColor4f(1.0f,0.0f,0.0f,1.0f);
ColorGeneralizedCylinder(*m_nodesColor[pos]);
}
for(i=0; i<m_nodesColor[pos]->cnum; i++) //只要打破孩子链表，就可以完成删除孩子节点的工作——因为是一个连通图，通过一个广度优先算法就能遍历完成
q.push(m_nodesColor[pos]->cid[i]); //通过孩子链表维持孩子关系的，利用了树的连通性来进行广度优先遍历算法
}
//分开两次绘制 对于需要删除的边，用红色绘制
/*
glColor4f(1.0f,0.0f,0.0f,1.0f);
while (!deleteBranch.empty())
{
pos = deleteBranch.front();
deleteBranch.pop();
DrawGeneralizedCylinder(*m_nodesColor[pos]);
number++;
}
*/
cout<<"color branch Draw over :"<<number<<endl;
}
void CTree::ColorGeneralizedCylinder(CBranch &branch)
{
const int SLICE_NUM = 12 ;
int j;
double d;
CVector3D vDirStart , vDirEnd , InitM , N , B ,vTmp; //与绘制叶脉的代码几乎相同
CVector3D posStart[SLICE_NUM];
CVector3D posEnd[SLICE_NUM];
CVector3D normStart[SLICE_NUM];
CVector3D normEnd[SLICE_NUM];
double maxRadii=0.0;
int maxPos;
if(branch.Np==false) // note that vstart and vend is tangent
{
vDirStart = branch.vs - branch.ve; //分支的方向向量
vDirEnd = vDirStart;
if (vDirStart.x*vDirStart.y*vDirStart.z!=0) // 不与x，y，z重合
{
d=sqrt(vDirStart.y*vDirStart.y+vDirStart.z*vDirStart.z);
InitM.Set(0,vDirStart.z/d,-vDirStart.y/d);
}
else
{
if(vDirStart.x==0)
InitM.Set(1,0,0);
else if(vDirStart.y==0)
InitM.Set(0,1,0);
else
InitM.Set(0,0,1);
}
N = InitM.Outer(vDirStart); //求解叉积
N.Normalize();
B = vDirStart.Outer(N); //为什么不垂直呢？
B.Normalize();
}
else
{
vDirStart = m_nodesColor[branch.pid]->Tn;
vDirEnd = branch.vs - branch.ve;
// InitM = m_nodes[branch.pid]->Bn;
N = m_nodesColor[branch.pid]->Nn;
B = m_nodesColor[branch.pid]->Bn;
}
// cout<<B.x<<" "<<B.y<<" "<<B.z<<endl;
for(j=0; j<SLICE_NUM; j++)
{
normStart[j]= N*cos(2*M_PI*j/(double)SLICE_NUM);
vTmp = B*sin(2*M_PI*j/(double)SLICE_NUM);
normStart[j] = normStart[j] + vTmp;
posStart[j] = normStart[j]*0.5*branch.ds + branch.vs; // 只跟树的半径和起点有关系
}
N = B.Outer(vDirEnd);
N.Normalize();
B = vDirEnd.Outer(N);
B.Normalize();
for(j=0; j<SLICE_NUM; j++)
{
normEnd[j] = N*cos(2*M_PI*j/(double)SLICE_NUM);
vTmp = B*sin(2*M_PI*j/(double)SLICE_NUM);
normEnd[j] = normEnd[j] + vTmp;
posEnd[j] = normEnd[j]*0.5*branch.de + branch.ve;
}
glBegin(GL_QUAD_STRIP);
for(j=0; j<SLICE_NUM; j++) //这个循环写的很好
{
glNormal3f(normEnd[j].x,normEnd[j].y,normEnd[j].z); // 看上去时候似乎是要求解每一个点的法向
glTexCoord2d(j/(double)SLICE_NUM, 1.0);
glVertex3f(posEnd[j].x, posEnd[j].y, posEnd[j].z);
glNormal3f(normStart[j].x,normStart[j].y,normStart[j].z);
glTexCoord2d(j/(double)SLICE_NUM, 0.0);
glVertex3f(posStart[j].x, posStart[j].y, posStart[j].z);
}
glNormal3f(normEnd[0].x,normEnd[0].y,normEnd[0].z);
glTexCoord2d(1.0, 1.0);
glVertex3f(posEnd[0].x, posEnd[0].y, posEnd[0].z);
glNormal3f(normStart[0].x,normStart[0].y,normStart[0].z);
glTexCoord2d(1.0, 0.0);
glVertex3f(posStart[0].x, posStart[0].y, posStart[0].z);
glEnd();
//确定下一个主dominant
for(j=0;j<branch.cnum;j++)
{
if(m_nodesColor[branch.cid[j]]->ds > maxRadii)
{
maxRadii = m_nodesColor[branch.cid[j]]->ds;
maxPos = branch.cid[j];
}
}
for(j=0;j<branch.cnum ;j++) //
{
if(branch.cid[j]==maxPos)
m_nodesColor[branch.cid[j]]->Np = true;
else
m_nodesColor[branch.cid[j]]->Np = false;
}
//保留De的参考框架, 由于传递的是引用。
branch.Bn = B;
branch.Tn = vDirEnd;
branch.Nn = N;
}
void CTree::CreateTreeList()
{
cout<<"----createtreelist\n";
int pos , i;
queue<int> q;
CMatrix3D mat;
int j=0;
double w;
int tnum = m_leafTri.size()/3;
int a,b,c;
CVector3D temp01,temp02;
if(m_nTreeList!=0)
{
glDeleteLists(m_nTreeList,1);
m_nTreeList=0;
}
m_nTreeList = glGenLists(1);
glNewList(m_nTreeList,GL_COMPILE);
DrawBranches();
if(g_bShowLeaves)
{
q.push(0);
while(!q.empty())
{
pos=q.front(); //取队首元素
q.pop(); //删除元素
if(m_nodes[pos]->cnum==0)
{
ArrangeWhorledLeaves(m_nodes[pos]->vs, m_nodes[pos]->ve); //计算matrix , 一次性计算8片叶子的矩阵
for(i=0; i<LEAF_NUM; i++) //一根树枝八片树叶
{
glPushMatrix();
mat = m_leafmat[i].glMatrix();
glMultMatrixd(m_leafmat[i].glMatrix()); // Matrix3D中，数据按照行储存，但是矩阵要就数据按照列存储 CMatrix3D 是
glCallList(m_nLeafList);
glPopMatrix();
}
}
for(i=0; i<m_nodes[pos]->cnum; i++) //被标记为false的都已经不在完全图中了，所以通过遍历不可能遍历到标记为false的树枝
// if(m_nodes[m_nodes[pos]->cid[i]]->flag==true) //枝没有被删除，才处理，否则就不用了。
q.push(m_nodes[pos]->cid[i]);
}
}
glEndList();
}
void CTree::DrawBranches()
{
cout<<"----drawbranch\n";
int i , pos;
queue<int> q ;
queue<int> deleteBranch;
int count = 0;
int endId;
glEnable(GL_LIGHTING);
// glEnable(GL_BLEND);
// glDisable(GL_DEPTH_TEST); // 关闭深度测试
// glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA); //GL_ONE_MINUS_SRC_ALPHA
glColor4f(m_branchClr.x, m_branchClr.y, m_branchClr.z,1.0f);
//glColor4f(0.5, 0.5,0.5,1.0f);
// glColor4f(1.0f,1.0f, 1.0f,0.6f);
q.push(0); //根树枝永远在数组的开头，一般也是按照顺序来的。
while (!q.empty())
{
pos = q.front();
q.pop();
DrawGeneralizedCylinder(*m_nodes[pos]);
count++;
for(i=0; i<m_nodes[pos]->cnum; i++) //只要打破孩子链表，就可以完成删除孩子节点的工作——因为是一个连通图，通过一个广度优先算法就能遍历完成
q.push(m_nodes[pos]->cid[i]); //通过孩子链表维持孩子关系的，利用了树的连通性来进行广度优先遍历算法
}
cout<<m_num<<"::"<<count<<"::"<<m_nodes.size();
// outFile.close();
cout<<"finish drawBranch"<<endl;
//glDisable(GL_BLEND);
//glEnable(GL_DEPTH_TEST);
}
void CTree::DrawGeneralizedCylinder(CBranch &branch)
{
const int SLICE_NUM = 12 ;
int j;
double d;
CVector3D vDirStart , vDirEnd , InitM , N , B ,vTmp; //与绘制叶脉的代码几乎相同
CVector3D posStart[SLICE_NUM];
CVector3D posEnd[SLICE_NUM];
CVector3D normStart[SLICE_NUM];
CVector3D normEnd[SLICE_NUM];
double maxRadii=0.0;
int maxPos;
//// index part
int startIndex[12];
int endIndex[12];
int i,k;
int firstIndex;
// int *backEndIndex;
// CVector3D textureStart[SLICE_NUM] , textureEnd[SLICE_NUM];
if(branch.Np==false) // note that vstart and vend is tangent
{
vDirStart = branch.vs - branch.ve; //分支的方向向量
vDirEnd = vDirStart;
if (vDirStart.x*vDirStart.y*vDirStart.z!=0) // 不与x，y，z重合
{
d=sqrt(vDirStart.y*vDirStart.y+vDirStart.z*vDirStart.z);
InitM.Set(0,vDirStart.z/d,-vDirStart.y/d);
}
else
{
if(vDirStart.x==0)
InitM.Set(1,0,0);
else if(vDirStart.y==0)
InitM.Set(0,1,0);
else
InitM.Set(0,0,1);
}
N = InitM.Outer(vDirStart); //求解叉积
N.Normalize();
B = vDirStart.Outer(N); //为什么不垂直呢？
B.Normalize();
}
else
{
vDirStart = m_nodes[branch.pid]->Tn;
vDirEnd = branch.vs - branch.ve;
// InitM = m_nodes[branch.pid]->Bn;
N = m_nodes[branch.pid]->Nn;
B = m_nodes[branch.pid]->Bn;
}
// cout<<B.x<<" "<<B.y<<" "<<B.z<<endl;
for(j=0; j<SLICE_NUM; j++)
{
normStart[j]= N*cos(2*M_PI*j/(double)SLICE_NUM);
vTmp = B*sin(2*M_PI*j/(double)SLICE_NUM);
normStart[j] = normStart[j] + vTmp;
posStart[j] = normStart[j]*0.5*branch.ds + branch.vs; // 只跟树的半径和起点有关系
}
N = B.Outer(vDirEnd);
N.Normalize();
B = vDirEnd.Outer(N);
B.Normalize();
for(j=0; j<SLICE_NUM; j++)
{
normEnd[j] = N*cos(2*M_PI*j/(double)SLICE_NUM);
vTmp = B*sin(2*M_PI*j/(double)SLICE_NUM);
normEnd[j] = normEnd[j] + vTmp;
posEnd[j] = normEnd[j]*0.5*branch.de + branch.ve;
}
glBegin(GL_QUAD_STRIP);
for(j=0; j<SLICE_NUM; j++) //这个循环写的很好
{
glNormal3f(normEnd[j].x,normEnd[j].y,normEnd[j].z); // 看上去时候似乎是要求解每一个点的法向
glTexCoord2d(j/(double)SLICE_NUM, 1.0); //再次计算咯
glVertex3f(posEnd[j].x, posEnd[j].y, posEnd[j].z);
/*endIndex[j]= lastIndex+1;
lastIndex++;*/
glNormal3f(normStart[j].x,normStart[j].y,normStart[j].z);
glTexCoord2d(j/(double)SLICE_NUM, 0.0);
glVertex3f(posStart[j].x, posStart[j].y, posStart[j].z);
/* startIndex[j] = lastIndex+1;
lastIndex++;*/
}
glNormal3f(normEnd[0].x,normEnd[0].y,normEnd[0].z);
glTexCoord2d(1.0, 1.0);
glVertex3f(posEnd[0].x, posEnd[0].y, posEnd[0].z);
glNormal3f(normStart[0].x,normStart[0].y,normStart[0].z);
glTexCoord2d(1.0, 0.0);
glVertex3f(posStart[0].x, posStart[0].y, posStart[0].z);
glEnd();
//确定下一个主dominant
for(j=0; j<branch.cnum; j++)
{
if(m_nodes[branch.cid[j]]->ds > maxRadii)
{
maxRadii = m_nodes[branch.cid[j]]->ds;
maxPos = branch.cid[j];
}
}
for(j=0; j<branch.cnum ; j++)
{
if(branch.cid[j]==maxPos)
m_nodes[branch.cid[j]]->Np = true;
else
m_nodes[branch.cid[j]]->Np = false;
}
//保留De的参考框架, 由于传递的是引用。
branch.Bn = B;
branch.Tn = vDirEnd;
branch.Nn = N;
// index process and write process
// backEndIndex = new int [12]; //最后再拷贝
/*
if(lastIndex==0) // note :可以让各种法线，顶点的坐标一样一样的。
{
firstIndex = 1;
lastIndex = 2;
startIndex[0] = firstIndex;
endIndex[0] = lastIndex;
firstIndex = lastIndex +1;
lastIndex = firstIndex +1;
for(i=1;i<SLICE_NUM;i++)
{
endIndex[i] = firstIndex;
startIndex[i]= lastIndex;