-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathIndexedFaceMesh.cpp
More file actions
310 lines (274 loc) · 8.26 KB
/
Copy pathIndexedFaceMesh.cpp
File metadata and controls
310 lines (274 loc) · 8.26 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
#include "IndexedFaceMesh.h"
#include<iostream>
using namespace std;
using namespace PBD;
IndexedFaceMesh& IndexedFaceMesh::operator=(IndexedFaceMesh const& other)
{
m_numPoints = other.m_numPoints;
m_indices = other.m_indices;
m_edges = other.m_edges;
m_faces = other.m_faces;
m_closed = other.m_closed;
m_uvIndices = other.m_uvIndices;
m_normalIndices = other.m_normalIndices;
m_uvs = other.m_uvs;
m_verticesPerFace = other.m_verticesPerFace;
m_normals = other.m_normals;
m_vertexNormals = other.m_vertexNormals;
m_borderEdges = other.m_borderEdges;
m_seamEdges = other.m_seamEdges;
//未使用
m_specialSeams = other.m_specialSeams;
for (size_t i(0u); i < m_faces.size(); ++i)
{
m_faces[i].m_edges = new unsigned int[m_verticesPerFace];
#if defined(WIN32) || defined(_WIN32) || defined(WIN64)
std::copy(other.m_faces[i].m_edges, other.m_faces[i].m_edges + m_verticesPerFace,
stdext::unchecked_array_iterator<unsigned int*>(m_faces[i].m_edges));
#else
std::copy(other.m_faces[i].m_edges, other.m_faces[i].m_edges + m_verticesPerFace, m_faces[i].m_edges);
#endif
}
m_verticesEdges.resize(other.m_verticesEdges.size());
for (size_t i(0u); i < m_verticesEdges.size(); ++i)
m_verticesEdges[i] = other.m_verticesEdges[i];
m_verticesFaces.resize(other.m_verticesFaces.size());
for (size_t i(0u); i < m_verticesFaces.size(); ++i)
m_verticesFaces[i] = other.m_verticesFaces[i];
return *this;
}
IndexedFaceMesh::IndexedFaceMesh(IndexedFaceMesh const& other)
{
*this = other;
}
IndexedFaceMesh::IndexedFaceMesh(const unsigned int verticesPerFace)
{
m_verticesPerFace = verticesPerFace;
m_closed = false;
}
IndexedFaceMesh::~IndexedFaceMesh()
{
release();
}
bool IndexedFaceMesh::isClosed() const
{
return m_closed;
}
//未使用
void IndexedFaceMesh::initPatternMesh(const unsigned int nPoints, const unsigned int nEdges, const unsigned int nFaces, bool isCloth, bool findSpecialSeam)
{
m_numPoints = nPoints;
m_indices.reserve(nFaces * m_verticesPerFace);
m_edges.reserve(nEdges);
m_faces.reserve(nFaces);
m_uvIndices.reserve(nFaces);
m_normalIndices.reserve(nFaces);
m_uvs.reserve(nPoints);
m_verticesFaces.reserve(nPoints);
m_verticesEdges.reserve(nPoints);
m_normals.reserve(nFaces);
m_vertexNormals.reserve(nPoints);
if (isCloth) m_borderEdges.reserve(nPoints);
if (findSpecialSeam) m_specialSeams.reserve(nPoints);
}
void IndexedFaceMesh::initMesh(const unsigned int nPoints, const unsigned int nEdges, const unsigned int nFaces, bool isCloth)
{
m_numPoints = nPoints;
m_indices.reserve(nFaces * m_verticesPerFace);
m_edges.reserve(nEdges);
m_faces.reserve(nFaces);
m_uvIndices.reserve(nFaces);
m_normalIndices.reserve(nFaces);
m_uvs.reserve(nPoints);
m_verticesFaces.reserve(nPoints);
m_verticesEdges.reserve(nPoints);
m_normals.reserve(nFaces);
m_vertexNormals.reserve(nPoints);
if (isCloth) m_borderEdges.reserve(nPoints);
}
void IndexedFaceMesh::release()
{
m_indices.clear();
m_edges.clear();
for (unsigned int i = 0; i < m_faces.size(); i++)
delete[] m_faces[i].m_edges;
m_faces.clear();
m_uvIndices.clear();
m_uvs.clear();
m_verticesFaces.clear();
m_verticesEdges.clear();
m_normals.clear();
m_vertexNormals.clear();
m_numPoints = 0;
m_seamEdges.clear();
m_specialSeams.clear();
m_normalIndices.clear();
}
/** Add a new face. Indices must be an array of size m_verticesPerFace.
*/
void IndexedFaceMesh::addFace(const unsigned int* const indices)
{
for (unsigned int i = 0u; i < m_verticesPerFace; i++)
m_indices.push_back(indices[i]);
}
/** Add a new face. Indices must be an array of size m_verticesPerFace.
*/
void IndexedFaceMesh::addFace(const int* const indices)
{
for (unsigned int i = 0u; i < m_verticesPerFace; i++)
m_indices.push_back((unsigned int)indices[i]);
}
void IndexedFaceMesh::addUV(const Real u, const Real v)
{
Vector2r uv;
uv.set(u, v);
m_uvs.push_back(uv);
}
void IndexedFaceMesh::addUVIndex(const unsigned int index)
{
m_uvIndices.push_back(index);
}
void IndexedFaceMesh::addNormalIndex(const unsigned int index)
{
m_normalIndices.push_back(index);
}
void IndexedFaceMesh::buildNeighbors(bool isCloth, bool findSpecialSeam)
{
typedef std::vector<unsigned int> PEdges;
typedef std::vector<unsigned int> VertexFE;
PEdges* pEdges = new PEdges[numVertices()];
VertexFE* vFaces = new VertexFE[numVertices()];
VertexFE* vEdges = new VertexFE[numVertices()];
for (unsigned int i = 0; i < m_faces.size(); i++)
delete[] m_faces[i].m_edges;
m_edges.clear();
m_faces.resize(numFaces());
unsigned int* v = new unsigned int[m_verticesPerFace];
unsigned int* edges = new unsigned int[m_verticesPerFace * 2];
for (unsigned int i = 0; i < numFaces(); i++)
{
m_faces[i].m_edges = new unsigned int[m_verticesPerFace];
for (unsigned int j = 0u; j < m_verticesPerFace; j++)
v[j] = m_indices[m_verticesPerFace * i + j];
for (unsigned int j = 0u; j < m_verticesPerFace - 1u; j++)
{
edges[2 * j] = v[j];
edges[2 * j + 1] = v[j + 1];
}
edges[2 * (m_verticesPerFace - 1)] = v[m_verticesPerFace - 1];
edges[2 * (m_verticesPerFace - 1) + 1] = v[0];
for (unsigned int j = 0u; j < m_verticesPerFace; j++)
{
// add vertex-face connection 保存顶点vIndex在哪几个面中
const unsigned int vIndex = m_indices[m_verticesPerFace * i + j];
bool found = false;
for (unsigned int k = 0; k < vFaces[vIndex].size(); k++)
{
if (vFaces[vIndex][k] == i)
{
found = true;
break;
}
}
if (!found)
{
vFaces[vIndex].push_back(i); //保存vIndex点在第i个面内
}
// add edge information
const unsigned int a = edges[j * 2 + 0];
const unsigned int b = edges[j * 2 + 1];
unsigned int edge = 0xffffffff;
// find edge
for (unsigned int k = 0; k < pEdges[a].size(); k++)
{
const Edge& e = m_edges[pEdges[a][k]];
if (((e.m_vert[0] == a) || (e.m_vert[0] == b)) &&
((e.m_vert[1] == a) || (e.m_vert[1] == b)))
{
edge = pEdges[a][k]; //从另一个面中找到该边
break;
}
}
if (edge == 0xffffffff)
{
// create new
Edge e;
e.m_vert[0] = a;
e.m_vert[1] = b;
e.m_face[0] = i;
e.m_face[1] = 0xffffffff;
m_edges.push_back(e);
edge = (unsigned int)m_edges.size() - 1u;
// add vertex-edge connection
vEdges[a].push_back(edge); //存储点a属于边edge
vEdges[b].push_back(edge);
}
else
{
Edge& e = m_edges[edge]; //此时的面为边e的另一个面
e.m_face[1] = i;
}
// append to points
pEdges[a].push_back(edge);
pEdges[b].push_back(edge);
// append face
m_faces[i].m_edges[j] = edge;
}
}
delete[] v;
delete[] edges;
// build vertex-face structure
m_verticesFaces.clear(); // to delete old pointers
m_verticesFaces.resize(numVertices());
m_verticesEdges.clear(); // to delete old pointers
m_verticesEdges.resize(numVertices());
for (unsigned int i = 0; i < numVertices(); i++)
{
m_verticesFaces[i].m_numFaces = (unsigned int)vFaces[i].size();
m_verticesFaces[i].m_fIndices = new unsigned int[m_verticesFaces[i].m_numFaces];
memcpy(m_verticesFaces[i].m_fIndices, vFaces[i].data(), sizeof(unsigned int) * m_verticesFaces[i].m_numFaces);
m_verticesEdges[i].m_numEdges = (unsigned int)vEdges[i].size();
m_verticesEdges[i].m_eIndices = new unsigned int[m_verticesEdges[i].m_numEdges];
memcpy(m_verticesEdges[i].m_eIndices, vEdges[i].data(), sizeof(unsigned int) * m_verticesEdges[i].m_numEdges);
}
// check for boundary 判断模型是否完全闭合:即每个边都属于两个面
if (isCloth)
{
for (unsigned int i = 0; i < (unsigned int)m_edges.size(); i++)
{
Edge& e = m_edges[i];
if (e.m_face[1] == 0xffffffff)
{
m_borderEdges.push_back(i);
}
}
}
delete[] pEdges;
delete[] vFaces;
delete[] vEdges;
}
void IndexedFaceMesh::copyUVs(const UVIndices & uvIndices,const NormalIndices& normalIndices, const UVs & uvs)
{
m_uvs.clear();
m_uvs.resize(uvs.size());
for (unsigned int i = 0; i < uvs.size(); i++)
{
m_uvs[i] = uvs[i];
}
m_uvIndices.clear();
m_uvIndices.resize(uvIndices.size());
for (unsigned int i = 0; i < uvIndices.size(); i++)
{
m_uvIndices[i] = uvIndices[i];
}
m_normalIndices.clear();
m_normalIndices.resize(normalIndices.size());
for (unsigned int i = 0; i < normalIndices.size(); i++)
{
m_normalIndices[i] = normalIndices[i];
}
}
unsigned int IndexedFaceMesh::getVerticesPerFace() const
{
return m_verticesPerFace;
}