-
Notifications
You must be signed in to change notification settings - Fork 0
/
DCEL.cpp
165 lines (128 loc) · 3.14 KB
/
DCEL.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
/**
DCEL.cpp
doubly linked edge list
main data structure for storing mesh infomation
also where subdivision occurs
@author
Lanqin Yuan
Kiranpreet Bajwa
Aleks Djuric
*/
#include "DCEL.h"
using namespace std;
// Implementation of doublely connected edge list (DCEL) aka half-edge data structure
// constructor
DCEL::DCEL()
{
}
// Methods go here
void DCEL::readOBJ(string fileName)
{
ifstream file;
file.open(fileName);
//cout << getcwd(NULL, 0);
if (!file.is_open()){
cout << "Error could not open file" << endl;
}
else {
//parse the vertices and faces
DCEL dcel = DCEL();
string line;
int vertexIndex = 0;
while (!file.eof())
{
//file >> word;
//getline(file, line);
string var1;
double var2, var3, var4;
file >> var1 >> var2 >> var3 >> var4;
if (var1[0] == 'v')
{
// read normals for vertex
if (var1[1] == 'n')
{
Vertex* v = vertexList[vertexIndex];
// set normals
v->nx = var3;
v->ny = var3;
v->nz = var3;
vertexIndex++;
}
else
// read vertex data
{
// read into DCEL structure
Vertex* v = (Vertex*)malloc(sizeof(struct Vertex));
v->x = var2;
v->y = var3;
v->z = var4;
vertexList.push_back(v);
}
}
map <pair<unsigned int, unsigned int>, HalfEdge*> Edges;
// assumption is made that mesh is entirely triagular
if (var1[0] == 'f')
{
Face* f = (Face*)malloc(sizeof(struct Face));
HalfEdge* he1 = (HalfEdge*)malloc(sizeof(struct HalfEdge));
HalfEdge* he2 = (HalfEdge*)malloc(sizeof(struct HalfEdge));;
HalfEdge* he3 = (HalfEdge*)malloc(sizeof(struct HalfEdge));;
Vertex* v1 = vertexList.at(var2 - 1);
Vertex* v2 = vertexList.at(var3 - 1);
Vertex* v3 = vertexList.at(var4 - 1);
HalfEdge* he[3];
he1->next = he2;
he2->next = he3;
he3->next = he1;
he1->face = f;
he2->face = f;
he3->face = f;
he1->vertex = v1;
he2->vertex = v2;
he3->vertex = v3;
if (Edges[make_pair(var2, var3)] = NULL)
Edges[make_pair(var2, var3)] = he1;
else
he1->pair = Edges[make_pair(var2, var3)];
if (Edges[make_pair(var3, var4)] = NULL)
Edges[make_pair(var3, var4)] = he2;
else
he2->pair = Edges[make_pair(var3, var4)];
if (Edges[make_pair(var4, var2)] = NULL)
Edges[make_pair(var4, var2)] = he3;
else
he3->pair = Edges[make_pair(var4, var2)];
f->halfEdge = he1;
faceList.push_back(f);
halfEdgeList.push_back(he1);
halfEdgeList.push_back(he2);
halfEdgeList.push_back(he3);
}
cout << var1 << var2 << var3 << var4 << "\n";
}
file.close();
}
}
// actually draw the mesh
void DCEL::drawMesh()
{
glBegin(GL_TRIANGLES);
for each (Face* f in faceList)
{
Vertex* v[3];
HalfEdge* he = f->halfEdge;
for (int i = 0; i < 3; i++)
{
v[i] = he->vertex;
he = he->next;
}
glColor3f(1.0f, 0.0f, 0.0f); // red
glNormal3f(v[0]->nx, v[0]->ny, v[0]->nz);
glVertex3f(v[0]->x, v[0]->y, v[0]->z);
glNormal3f(v[1]->nx, v[1]->ny, v[1]->nz);
glVertex3f(v[1]->x, v[1]->y, v[1]->z);
glNormal3f(v[2]->nx, v[2]->ny, v[2]->nz);
glVertex3f(v[2]->x, v[2]->y, v[2]->z);
}
glEnd();
}