-
Notifications
You must be signed in to change notification settings - Fork 19
/
DDConvexHullUtils.cpp
252 lines (229 loc) · 7.82 KB
/
DDConvexHullUtils.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
//
// DDConvexHullUtils.cpp
// DDConvexHull
//
// Created by Jonathan Tilden on 1/28/13.
//
// MIT License
//
// Copyright (c) 2017 Jonathan Tilden
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
#include "DDConvexHullUtils.h"
#include "StanHull/hull.h"
#include <maya/MFnMesh.h>
#include <maya/MFnSingleIndexedComponent.h>
#include <maya/MIntArray.h>
#include <maya/MPoint.h>
#include <maya/MPointArray.h>
#include <sstream>
MString DDConvexHullUtils::dbl_to_string(double x)
{
std::ostringstream ss;
ss << x;
return MString((ss.str()).c_str());
}
MString DDConvexHullUtils::int_to_string(int x)
{
std::ostringstream ss;
ss << x;
return MString((ss.str()).c_str());
}
MStatus DDConvexHullUtils::generateMayaHull(MObject &output,
const MObject &input,
const DDConvexHullUtils::hullOpts &hullOptions)
{
// Convert the input mobject to mfnmesh
if (!input.hasFn(MFn::kMesh))
{
return MStatus::kInvalidParameter;
}
MFnMesh inputMesh(input);
// Allocate an array for the vertices and fill it with the data extracted
// from the input mesh
uint numInputVerts = inputMesh.numVertices();
if (!numInputVerts)
{
return MStatus::kFailure;
}
MPointArray points;
inputMesh.getPoints(points);
return generateMayaHull(output, points, hullOptions);
}
MStatus DDConvexHullUtils::generateMayaHull(MObject &output,
const MPointArray &vertices,
const DDConvexHullUtils::hullOpts &hullOptions)
{
// Allocate and push the vert list into the new array Mem Cleanup req.
uint numInputVerts = vertices.length();
double *inputVerts = new double[numInputVerts*3];
for (uint i=0; i < numInputVerts; i++)
{
uint offset = i*3;
inputVerts[offset] = vertices[i].x;
inputVerts[offset+1] = vertices[i].y;
inputVerts[offset+2] = vertices[i].z;
}
// Setup the flags
uint hullFlags = QF_DEFAULT;
if (hullOptions.forceTriangles)
{
hullFlags |= QF_TRIANGLES;
}
if (hullOptions.useSkinWidth)
{
hullFlags |= QF_SKIN_WIDTH;
}
if (hullOptions.reverseTriangleOrder)
{
hullFlags |= QF_REVERSE_ORDER;
}
// Create the description
HullDesc hullDescription;
hullDescription.mFlags = hullFlags;
hullDescription.mMaxVertices = hullOptions.maxOutputVertices;
hullDescription.mSkinWidth = hullOptions.skinWidth;
hullDescription.mNormalEpsilon = hullOptions.normalEpsilon;
hullDescription.mVertexStride = sizeof(double)*3;
hullDescription.mVcount = numInputVerts;
hullDescription.mVertices = inputVerts;
// Create the hull
HullLibrary hullComputer;
HullResult hullResult;
HullError err = hullComputer.CreateConvexHull(hullDescription, hullResult);
MStatus hullStat = MStatus::kSuccess;
if (err == QE_OK)
{
// Grab the verts
MPointArray outPoints;
for (uint i=0; i < hullResult.mNumOutputVertices; i++)
{
uint offset = i*3;
MPoint curPoint(hullResult.mOutputVertices[offset],
hullResult.mOutputVertices[offset+1],
hullResult.mOutputVertices[offset+2]);
outPoints.append(curPoint);
}
// Check if the results are in polygons, or triangles. Depending on
// which for the result is in, the way the face indices are setup
// is different.
MIntArray polyCounts;
MIntArray vertexConnects;
if (hullResult.mPolygons)
{
const uint *idx = hullResult.mIndices;
for (uint i=0; i < hullResult.mNumFaces; i++)
{
uint pCount = *idx++;
polyCounts.append(pCount);
for (uint j=0; j < pCount; j++)
{
uint val = idx[0];
vertexConnects.append(val);
idx++;
}
}
}
else
{
polyCounts.setLength(hullResult.mNumFaces);
for (uint i=0; i < hullResult.mNumFaces; i++)
{
polyCounts[i] = 3;
uint *idx = &hullResult.mIndices[i*3];
vertexConnects.append(idx[0]);
vertexConnects.append(idx[1]);
vertexConnects.append(idx[2]);
}
}
// Setup the outmesh
MFnMesh outMeshFn(output);
outMeshFn.create(hullResult.mNumOutputVertices,
hullResult.mNumFaces,
outPoints,
polyCounts,
vertexConnects,
output,
&hullStat);
}
else
{
hullStat = MStatus::kFailure;
}
// Mem Cleanup
hullComputer.ReleaseResult(hullResult);
delete[] inputVerts;
return hullStat;
}
MStatus DDConvexHullUtils::componentToVertexIDs(MIntArray &outIndices,
const MObject &mesh,
const MObject &component)
{
// Create the funciton sets
MFnSingleIndexedComponent compFn(component);
MFnMesh meshFn(mesh);
MIntArray elems;
compFn.getElements(elems);
uint elemLen = elems.length();
// Convert the components to vertices based on component type
uint compType = compFn.componentType();
if (compType == MFn::kMeshVertComponent)
{
outIndices = elems;
}
else if (compType == MFn::kMeshEdgeComponent)
{
for (uint i=0; i < elemLen; i++)
{
int2 edgeVerts;
meshFn.getEdgeVertices(elems[i], edgeVerts);
outIndices.append(edgeVerts[0]);
outIndices.append(edgeVerts[1]);
}
}
else if (compType == MFn::kMeshPolygonComponent)
{
for (uint i=0; i < elemLen; i++)
{
// Grab verts for the current poly
MIntArray polyVerts;
meshFn.getPolygonVertices(elems[i], polyVerts);
uint polyVertsLen = polyVerts.length();
for (uint j=0; j < polyVertsLen; j++)
{
outIndices.append(polyVerts[j]);
}
}
}
else if (compType == MFn::kMeshFaceVertComponent)
{
// I think this is how you convert face to object
// relative vertices...
MIntArray faceCounts;
MIntArray faceVerts;
meshFn.getVertices(faceCounts, faceVerts);
for (uint j=0; j < elemLen; j++)
{
outIndices.append(faceVerts[j]);
}
}
else
{
// Not supported
return MStatus::kNotImplemented;
}
return MStatus::kSuccess;
}