-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathEulerOperator.cpp
More file actions
332 lines (289 loc) · 6.06 KB
/
Copy pathEulerOperator.cpp
File metadata and controls
332 lines (289 loc) · 6.06 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
#include<stdio.h>
#include "EulerOperator.h"
void EulerOperator::insertEdge(Solid* solid,Edge* edge)
{
Edge* head = solid->edge;
if(head==NULL) solid->edge = edge;
else
{
while(head->next!=NULL) head=head->next;
edge->prev = head;
head->next = edge;
}
}
void EulerOperator::insertFace(Solid* solid,Face* face)
{
face->solid = solid;
Face* head = solid->face;
if(head==NULL) solid->face = face;
else
{
while(head->next!=NULL) head=head->next;
face->prev = head;
head->next = face;
}
}
void EulerOperator::insertLoop(Face* face,Loop* loop)
{
loop->face = face;
Loop* head = face->loop;
if(head==NULL) face->loop = loop;
else
{
while(head->next!=NULL) head=head->next;
loop->prev = head;
head->next = loop;
}
}
void EulerOperator::delEdge(Solid* solid,Edge* edge)
{
Edge* head = solid->edge;
while(head!=edge)
{
head = head->next;
}
if(head->prev==NULL)
{
solid->edge = head->next;
head->next->prev = NULL;
}
else if(head->next==NULL)
{
head->prev->next = NULL;
head->prev = NULL;
}
else
{
head->next->prev = head->prev;
head->prev->next = head->next;
}
delete edge;
}
void EulerOperator::delFace(Solid* solid,Face* face)
{
Face* head = solid->face;
while(head!=face)
{
head = head->next;
}
if(head->prev==NULL)
{
solid->face = head->next;
head->next->prev = NULL;
}
else if(head->next==NULL)
{
head->prev->next = NULL;
head->prev = NULL;
}
else
{
head->next->prev = head->prev;
head->prev->next = head->next;
}
delete face;
}
Edge* EulerOperator::makeEdge(Vertex* ve1,Vertex* ve2)
{
Edge* edge = new Edge;
Half_Edge* he1 = new Half_Edge;
Half_Edge* he2 = new Half_Edge;
he1->ve1=ve1;
he1->ve2=ve2;
he2->ve1=ve2;
he2->ve2=ve1;
he1->next = he2;
he2->prev = he1;
edge->he1 = he1;
edge->he2 = he2;
he1->edge = edge;
he2->edge = edge;
return edge;
}
void EulerOperator::insertSolid(Solid*& head,Solid* solid)
{
if(head==NULL) head = solid;
else
{
Solid* tail = head;
while(tail->next!=NULL) tail = tail->next;
tail->next = solid;
solid->prev = solid;
}
}
/*
*构造一个体，面，外环，顶点
*@param[in] point 新顶点的位置
*@param[out] solid 新生成的体
*@return 新生成的顶点
*/
Vertex* EulerOperator::mvfs(Point point,Solid*& solid)
{
Solid* solid2 = new Solid;
Face* face = new Face;
Loop* loop = new Loop;
Vertex* vertex = new Vertex;
vertex->point = point;
loop->he = NULL;
insertFace(solid2,face);
insertLoop(face,loop);
insertSolid(solid,solid2);
return vertex;
}
/*
*构造一个位置为point的新的顶点，并构造vertex指向新顶点的边
*@param[in] vertex 顶点
*@param[in] point 新生成的顶点位置
*@param[in] loop 当前环
*@return 新生成的半边
*/
Half_Edge* EulerOperator::mev(Vertex* vertex,Point point,Loop* loop)
{
Vertex* vertex2 = new Vertex;
vertex2->point = point;
Edge* edge = makeEdge(vertex,vertex2);
Half_Edge* he1 = edge->he1;
Half_Edge* he2 = edge->he2;
//将半边插入环中
he1->loop = loop;
he2->loop = loop;
if (loop->he==NULL)
{
loop->he = he1;
he2->next = he1;
he1->prev = he2;
}
else
{
Half_Edge* he = loop->he;
while(he->next->ve1!=vertex) he = he->next;
he2->next = he->next;
he1->prev = he;
he->next->prev = he2;
he->next = he1;
}
insertEdge(loop->face->solid,edge);
return he1;
}
/*
*构造顶点ve1到ve2的一条边，同时构造一个新面
*注意当前loop的走向变为ve1->ve2,新面loop的走向为ve2->ve1
*@param[in] ve1 顶点1
*@param[in] ve2 顶点2
*@param[in] loop 当前环
*@return 新生成的面
*/
Face* EulerOperator::mef(Vertex* ve1,Vertex* ve2,Loop* loop)
{
Edge* edge = makeEdge(ve1,ve2);
Half_Edge* he1 = edge->he1;
Half_Edge* he2 = edge->he2;
//创建新环
Loop* loop2 = new Loop;
Half_Edge *tmpHe1,*tmpHe2;
Half_Edge* he = loop->he;
while(he->ve1!=ve1) he=he->next;
tmpHe1 = he;
while(he->ve1!=ve2) he=he->next;
tmpHe2 = he;
tmpHe1->prev->next = he1;
he1->prev = tmpHe1->prev;
he2->next = tmpHe1;
tmpHe1->prev = he2;
tmpHe2->prev->next = he2;
he2->prev = tmpHe2->prev;
he1->next = tmpHe2;
tmpHe2->prev = he1;
loop->he = he1;
he1->loop = loop;
loop2->he = he2;
he2->loop = loop2;
//创建新面
Face* face = new Face;
Solid* solid = loop->face->solid;
insertEdge(solid,edge);
insertFace(solid,face);
insertLoop(face,loop2);
return face;
}
/*
*删除环中ve1->ve2的一条边，构造一个新环
*@param[in] ve1 顶点1
*@param[in] ve2 顶点2
*@param[in] loop 当前环
*@return 新生成的环
*/
Loop* EulerOperator::kemr(Vertex *ve1, Vertex *ve2, Loop *loop)
{
Half_Edge *he1,*he2;
Half_Edge *head = loop->he;
while(head->ve1!=ve1 || head->ve2!=ve2) head = head->next;
he1 = head;
he2 = he1->getAdjacent();
he2->prev->next = he1->next;
he1->next->prev = he2->prev;
he1->prev->next = he2->next;
he2->next->prev = he1->prev;
//创建新环
Loop* loop2 = new Loop;
loop2->he = he2->prev;
he2->prev->loop = loop2;
insertLoop(loop->face,loop2);
loop->he = he1->prev;
he1->prev->loop = loop;
delEdge(loop->face->solid,he1->edge);
return loop2;
}
/*
*删除innerLoop指向的面，将其变成outerLoop指向面的内环
*@param[in] outerLoop 接收删除面的外环
*@param[in] innerLoop 要删除面所在的外环
*/
void EulerOperator::kfmrh(Loop* outerLoop,Loop* innerLoop)
{
delFace(innerLoop->face->solid,innerLoop->face);
insertLoop(outerLoop->face,innerLoop);
}
/*
*平移扫成
*@param[in] face 要平移的面
*@param[in] dir 平移方向
*@param[in] distance 平移方向上的位移
*/
void EulerOperator::sweep(Face *face, double dir[3], double distance)
{
Loop* outerLoop = NULL;
for(Loop* loop = face->loop;loop!=NULL;loop=loop->next)
{
Loop* loop2 = loop->he->getAdjacent()->loop;
Half_Edge* head = loop2->he;
Half_Edge* he = head;
Half_Edge* next = head->next;
Vertex* end;
Vertex *ve1=NULL,*ve2=NULL;
do
{
Vertex *ve = he->ve1;
Point pt1 = ve->point;
pt1.multiple(dir,distance);
pt1.index = Point::indexIncrement();
if(ve1==NULL)
{
ve1 = mev(ve,pt1,loop2)->ve2;
end = ve1;
}
else ve2 = mev(ve,pt1,loop2)->ve2;
if(ve1&&ve2)
{
mef(ve1,ve2,loop2);
ve1 = ve2;
ve2 = NULL;
}
he = next;
next = next->next;
}while(he->ve1!=head->ve1);
mef(ve1,end,loop2);
if(outerLoop!=NULL) kfmrh(outerLoop,loop2);
else outerLoop = loop2;
}
}