gl_network.h
12.5 KB
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
#ifndef STIM_GL_NETWORK
#define STIM_GL_NETWORK
#include <stim/biomodels/network.h>
#include <stim/visualization/aaboundingbox.h>
namespace stim{
template <typename T>
class gl_network : public stim::network<T>{
protected:
using stim::network<T>::E;
using stim::network<T>::V;
GLuint dlist;
public:
/// Default constructor
gl_network() : stim::network<T>(){
dlist = 0;
}
/// Constructor creates a gl_network from a stim::network
gl_network(stim::network<T> N) : stim::network<T>(N){
dlist = 0;
}
/// Fills the parameters with the minimum and maximum spatial positions in the network,
/// specifying a bounding box for the network geometry
aaboundingbox<T> boundingbox(){
aaboundingbox<T> bb; //create a bounding box
//loop through every edge
for(unsigned e = 0; e < E.size(); e++){
//loop through every point
for(unsigned p = 0; p < E[e].size(); p++)
bb.expand(E[e][p]); //expand the bounding box to include the point
}
return bb; //return the bounding box
}
//void renderCylinder(T x1, T y1, T z1, T x2, T y2, T z2, T radius, int subdivisions) {
// T dx = x2 - x1;
// T dy = y2 - y1;
// T dz = z2 - z1;
// /// handle the degenerate case with an approximation
// if (dz == 0)
// dz = .00000001;
// T d = sqrt(dx*dx + dy*dy + dz*dz);
// T ax = 57.2957795*acos(dz / d); // 180°/pi
// if (dz < 0.0)
// ax = -ax;
// T rx = -dy*dz;
// T ry = dx*dz;
// glPushMatrix();
// glTranslatef(x1, y1, z1);
// glRotatef(ax, rx, ry, 0.0);
// glutSolidCylinder(radius, d, subdivisions, 1);
// glPopMatrix();
//}
///render cylinder based on points from the top/bottom hat
///@param C1 set of points from one of the hat
void renderCylinder(std::vector< stim::vec3<T> > C1, std::vector< stim::vec3<T> > C2) {
glBegin(GL_QUAD_STRIP);
for (unsigned i = 0; i < C1.size(); i++) { // for every point on the circle
glVertex3f(C1[i][0], C1[i][1], C1[i][2]);
glVertex3f(C2[i][0], C2[i][1], C2[i][2]);
}
glEnd();
//glFlush();
}
///render the vertex as sphere
///@param x, y, z are the three coordinates of the center point
///@param radius is the radius of the sphere
///@param subdivisions is the slice/stride along/around z-axis
void renderBall(T x, T y, T z, T radius, int subdivisions) {
glPushMatrix();
glTranslatef(x, y, z);
glutSolidSphere(radius, subdivisions, subdivisions);
glPopMatrix();
}
/// Render the network centerline as a series of line strips.
/// glCenterline0 is for only one input
void glCenterline0(){
if (!glIsList(dlist)) { //if dlist isn't a display list, create it
dlist = glGenLists(1); //generate a display list
glNewList(dlist, GL_COMPILE); //start a new display list
for (unsigned e = 0; e < E.size(); e++) { //for each edge in the network
glBegin(GL_LINE_STRIP);
for (unsigned p = 0; p < E[e].size(); p++) { //for each point on that edge
glVertex3f(E[e][p][0], E[e][p][1], E[e][p][2]); //set the vertex position based on the current point
glTexCoord1f(0); //set white color
}
glEnd();
}
glEndList(); //end the display list
}
glCallList(dlist); // render the display list
}
void glCenterline(){
if(!glIsList(dlist)){ //if dlist isn't a display list, create it
dlist = glGenLists(1); //generate a display list
glNewList(dlist, GL_COMPILE); //start a new display list
for(unsigned e = 0; e < E.size(); e++){ //for each edge in the network
//unsigned errormag_id = E[e].nmags() - 1;
glBegin(GL_LINE_STRIP);
for(unsigned p = 0; p < E[e].size(); p++){ //for each point on that edge
glVertex3f(E[e][p][0], E[e][p][1], E[e][p][2]); //set the vertex position based on the current point
glTexCoord1f(E[e].r(p)); //set the texture coordinate based on the specified magnitude index
}
glEnd();
}
glEndList(); //end the display list
}
glCallList(dlist); //render the display list
}
///render the GT network cylinder as series of tubes
///@param dlist1 is the display list
///@param map is the mapping relationship between two networks
///@param colormap is the random generated color set for render
void glCylinderGT(GLuint &dlist1, std::vector<unsigned> map, std::vector<T> colormap) {
if (!glIsList(dlist1)) { // if dlist1 isn't a display list, create it
dlist1 = glGenLists(1); // generate a display list
glNewList(dlist1, GL_COMPILE); // start a new display list
for (unsigned e = 0; e < E.size(); e++) { // for each edge in the network
if (map[e] != unsigned(-1)) {
glColor3f(colormap[e * 3 + 0], colormap[e * 3 + 1], colormap[e * 3 + 2]);
for (unsigned p = 1; p < E[e].size(); p++) {// for each point on that edge
stim::circle<T> C1 = E[e].circ(p - 1);
stim::circle<T> C2 = E[e].circ(p);
C1.set_R(10); // scale the circle to the same
C2.set_R(10);
std::vector< stim::vec3<T> >Cp1 = C1.points(20);
std::vector< stim::vec3<T> >Cp2 = C2.points(20);
renderCylinder(Cp1, Cp2);
}
}
else {
glColor3f(1.0f, 1.0f, 1.0f); // white color for the un-mapping edges
for (unsigned p = 1; p < E[e].size(); p++) {// for each point on that edge
stim::circle<T> C1 = E[e].circ(p - 1);
stim::circle<T> C2 = E[e].circ(p);
C1.set_R(10); // scale the circle to the same
C2.set_R(10);
std::vector< stim::vec3<T> >Cp1 = C1.points(20);
std::vector< stim::vec3<T> >Cp2 = C2.points(20);
renderCylinder(Cp1, Cp2);
}
}
}
for (unsigned v = 0; v < V.size(); v++) {
size_t num_edge = V[v].e[0].size() + V[v].e[1].size();
if (num_edge > 1) { // if it is the joint vertex
glColor3f(0.3, 0.3, 0.3); // gray color
renderBall(V[v][0], V[v][1], V[v][2], 20, 20);
}
else { // if it is the terminal vertex
glColor3f(0.6, 0.6, 0.6); // more white gray
renderBall(V[v][0], V[v][1], V[v][2], 20, 20);
}
}
glEndList();
}
glCallList(dlist1);
}
///render the T network cylinder as series of tubes
///@param dlist2 is the display list
///@param map is the mapping relationship between two networks
///@param colormap is the random generated color set for render
void glCylinderT(GLuint &dlist2, std::vector<unsigned> map, std::vector<T> colormap) {
if (!glIsList(dlist2)) {
dlist2 = glGenLists(1);
glNewList(dlist2, GL_COMPILE);
for (unsigned e = 0; e < E.size(); e++) { // for each edge in the network
if (map[e] != unsigned(-1)) {
glColor3f(colormap[map[e] * 3 + 0], colormap[map[e] * 3 + 1], colormap[map[e] * 3 + 2]);
for (unsigned p = 0; p < E[e].size() - 1; p++) {// for each point on that edge
stim::circle<T> C1 = E[e].circ(p);
stim::circle<T> C2 = E[e].circ(p + 1);
C1.set_R(10); // scale the circle to the same
C2.set_R(10);
std::vector< stim::vec3<T> >Cp1 = C1.points(20);
std::vector< stim::vec3<T> >Cp2 = C2.points(20);
renderCylinder(Cp1, Cp2);
}
}
else {
glColor3f(1.0f, 1.0f, 1.0f); // white color for the un-mapping edges
for (unsigned p = 0; p < E[e].size() - 1; p++) {// for each point on that edge
stim::circle<T> C1 = E[e].circ(p);
stim::circle<T> C2 = E[e].circ(p + 1);
C1.set_R(10); // scale the circle to the same
C2.set_R(10);
std::vector< stim::vec3<T> >Cp1 = C1.points(20);
std::vector< stim::vec3<T> >Cp2 = C2.points(20);
renderCylinder(Cp1, Cp2);
}
}
}
for (unsigned v = 0; v < V.size(); v++) {
size_t num_edge = V[v].e[0].size() + V[v].e[1].size();
if (num_edge > 1) { // if it is the joint vertex
glColor3f(0.3, 0.3, 0.3); // gray color
renderBall(V[v][0], V[v][1], V[v][2], 20, 20);
}
else { // if it is the terminal vertex
glColor3f(0.6, 0.6, 0.6); // more white gray
renderBall(V[v][0], V[v][1], V[v][2], 20, 20);
}
}
glEndList();
}
glCallList(dlist2);
}
/// Render the GT network centerline as a series of line strips in random different color
///@param dlist1 is the display list
///@param map is the mapping relationship between two networks
///@param colormap is the random generated color set for render
void glRandColorCenterlineGT(GLuint &dlist1, std::vector<unsigned> map, std::vector<T> colormap) {
if (!glIsList(dlist1)) {
dlist1 = glGenLists(1);
glNewList(dlist1, GL_COMPILE);
for (unsigned e = 0; e < E.size(); e++) {
if (map[e] != unsigned(-1)) { // if it has corresponding edge in another network
glColor3f(colormap[e * 3 + 0], colormap[e * 3 + 1], colormap[e * 3 + 2]);
glBegin(GL_LINE_STRIP);
for (unsigned p = 0; p < E[e].size(); p++) {
glVertex3f(E[e][p][0], E[e][p][1], E[e][p][2]);
}
glEnd();
}
else {
glColor3f(1.0, 1.0, 1.0); // white color
glBegin(GL_LINE_STRIP);
for (unsigned p = 0; p < E[e].size(); p++) {
glVertex3f(E[e][p][0], E[e][p][1], E[e][p][2]);
}
glEnd();
}
}
glEndList();
}
glCallList(dlist1);
}
/// Render the T network centerline as a series of line strips in random different color
///@param dlist2 is the display list
///@param map is the mapping relationship between two networks
///@param colormap is the random generated color set for render
void glRandColorCenterlineT(GLuint &dlist2, std::vector<unsigned> map, std::vector<T> colormap) {
if (!glIsList(dlist2)) {
dlist2 = glGenLists(1);
glNewList(dlist2, GL_COMPILE);
for (unsigned e = 0; e < E.size(); e++) {
if (map[e] != unsigned(-1)) { // if it has corresponding edge in another network
glColor3f(colormap[map[e] * 3 + 0], colormap[map[e] * 3 + 1], colormap[map[e] * 3 + 2]);
glBegin(GL_LINE_STRIP);
for (unsigned p = 0; p < E[e].size(); p++) {
glVertex3f(E[e][p][0], E[e][p][1], E[e][p][2]);
}
glEnd();
}
else {
glColor3f(1.0, 1.0, 1.0); // white color
glBegin(GL_LINE_STRIP);
for (unsigned p = 0; p < E[e].size(); p++) {
glVertex3f(E[e][p][0], E[e][p][1], E[e][p][2]);
}
glEnd();
}
}
glEndList();
}
glCallList(dlist2);
}
//void glRandColorCenterlineGT(GLuint &dlist1, std::vector<unsigned> map, std::vector<T> colormap){
// if(!glIsList(dlist1)){
// dlist1 = glGenLists(1);
// glNewList(dlist1, GL_COMPILE);
// for(unsigned e = 0; e < E.size(); e++){
// if(map[e] != unsigned(-1)){
// glColor3f(colormap[e * 3 + 0], colormap[e * 3 + 1], colormap[e * 3 + 2]);
// glBegin(GL_LINE_STRIP);
// for(unsigned p = 0; p < E[e].size(); p++){
// glVertex3f(E[e][p][0], E[e][p][1], E[e][p][2]);
// }
// glEnd();
// for (unsigned p = 0; p < E[e].size() - 1; p++) {
// renderCylinder(E[e][p][0], E[e][p][1], E[e][p][2], E[e][p + 1][0], E[e][p + 1][1], E[e][p + 1][2], 10, 20);
// }
// }
// else{
// glColor3f(1.0, 1.0, 1.0);
// glBegin(GL_LINE_STRIP);
// for(unsigned p = 0; p < E[e].size(); p++){
// glVertex3f(E[e][p][0], E[e][p][1], E[e][p][2]);
// }
// glEnd();
// }
// }
// for (unsigned v = 0; v < V.size(); v++) {
// size_t num_edge = V[v].e[0].size() + V[v].e[1].size();
// if (num_edge > 1) {
// glColor3f(0.3, 0.3, 0.3); // gray color for vertex
// renderBall(V[v][0], V[v][1], V[v][2], 20, 20);
// }
// }
// glEndList();
// }
// glCallList(dlist1);
//}
//void glRandColorCenterlineT(GLuint &dlist2, std::vector<unsigned> map, std::vector<T> colormap){
// if(!glIsList(dlist2)){
// dlist2 = glGenLists(1);
// glNewList(dlist2, GL_COMPILE);
// for(unsigned e = 0; e < E.size(); e++){
// if(map[e] != unsigned(-1)){
// glColor3f(colormap[map[e] * 3 + 0], colormap[map[e] * 3 + 1], colormap[map[e] * 3 + 2]);
// glBegin(GL_LINE_STRIP);
// for(unsigned p = 0; p < E[e].size(); p++){
// glVertex3f(E[e][p][0], E[e][p][1], E[e][p][2]);
// }
// glEnd();
// for (unsigned p = 0; p < E[e].size() - 1; p++) {
// renderCylinder(E[e][p][0], E[e][p][1], E[e][p][2], E[e][p + 1][0], E[e][p + 1][1], E[e][p + 1][2], 10, 20);
// }
// }
// else{
// glColor3f(1.0, 1.0, 1.0);
// glBegin(GL_LINE_STRIP);
// for(unsigned p = 0; p < E[e].size(); p++){
// glVertex3f(E[e][p][0], E[e][p][1], E[e][p][2]);
// }
// glEnd();
// }
// }
// for (unsigned v = 0; v < V.size(); v++) {
// size_t num_edge = V[v].e[0].size() + V[v].e[1].size();
// if (num_edge > 1) {
// glColor3f(0.3, 0.3, 0.3); // gray color for vertex
// renderBall(V[v][0], V[v][1], V[v][2], 20, 20);
// }
// }
// glEndList();
// }
// glCallList(dlist2);
//}
}; //end stim::gl_network class
}; //end stim namespace
#endif