FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
solvespace/src/exportstep.cpp at wip-intersection · ruevs/solvespace · GitHub
ruevs
/
solvespace
Public
forked from
solvespace/solvespace
Notifications
You must be signed in to change notification settings
Fork
0
Star
4
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
solvespace
/
src
/
exportstep.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
375 lines (329 loc) · 11.7 KB
Breadcrumbs
solvespace
/
src
/
exportstep.cpp
Copy path
File metadata and controls
375 lines (329 loc) · 11.7 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
371
372
373
374
//
-----------------------------------------------------------------------------
//
Export a STEP file describing our ratpoly shell.
//
//
Copyright 2008-2013 Jonathan Westhues.
//
-----------------------------------------------------------------------------
#
include
"
solvespace.h
"
void
StepFileWriter::WriteHeader
() {
fprintf
(f,
"
ISO-10303-21;
\n
"
"
HEADER;
\n
"
"
\n
"
"
FILE_DESCRIPTION((''), '2;1');
\n
"
"
\n
"
"
FILE_NAME(
\n
"
"
'output_file',
\n
"
"
'2009-06-07T17:44:47-07:00',
\n
"
"
(''),
\n
"
"
(''),
\n
"
"
'SolveSpace',
\n
"
"
'',
\n
"
"
''
\n
"
"
);
\n
"
"
\n
"
"
FILE_SCHEMA (('CONFIG_CONTROL_DESIGN'));
\n
"
"
ENDSEC;
\n
"
"
\n
"
"
DATA;
\n
"
"
\n
"
"
/**********************************************************
\n
"
"
* This defines the units and tolerances for the file. It
\n
"
"
* is always the same, independent of the actual data.
\n
"
"
**********************************************************/
\n
"
"
#158=(
\n
"
"
LENGTH_UNIT()
\n
"
"
NAMED_UNIT(*)
\n
"
"
SI_UNIT(.MILLI.,.METRE.)
\n
"
"
);
\n
"
"
#161=(
\n
"
"
NAMED_UNIT(*)
\n
"
"
PLANE_ANGLE_UNIT()
\n
"
"
SI_UNIT($,.RADIAN.)
\n
"
"
);
\n
"
"
#166=(
\n
"
"
NAMED_UNIT(*)
\n
"
"
SI_UNIT($,.STERADIAN.)
\n
"
"
SOLID_ANGLE_UNIT()
\n
"
"
);
\n
"
"
#167=UNCERTAINTY_MEASURE_WITH_UNIT(LENGTH_MEASURE(0.001),#158,
\n
"
"
'DISTANCE_ACCURACY_VALUE',
\n
"
"
'string');
\n
"
"
#168=(
\n
"
"
GEOMETRIC_REPRESENTATION_CONTEXT(3)
\n
"
"
GLOBAL_UNCERTAINTY_ASSIGNED_CONTEXT((#167))
\n
"
"
GLOBAL_UNIT_ASSIGNED_CONTEXT((#166,#161,#158))
\n
"
"
REPRESENTATION_CONTEXT('ID1','3D')
\n
"
"
);
\n
"
"
#169=SHAPE_REPRESENTATION('',(#170),#168);
\n
"
"
#170=AXIS2_PLACEMENT_3D('',#173,#171,#172);
\n
"
"
#171=DIRECTION('',(0.,0.,1.));
\n
"
"
#172=DIRECTION('',(1.,0.,0.));
\n
"
"
#173=CARTESIAN_POINT('',(0.,0.,0.));
\n
"
"
\n
"
);
//
Start the ID somewhere beyond the header IDs.
id =
200
;
}
void
StepFileWriter::WriteProductHeader
() {
fprintf
(f,
"
#175 = SHAPE_DEFINITION_REPRESENTATION(#176, #169);
\n
"
"
#176 = PRODUCT_DEFINITION_SHAPE('Version', 'Test Part', #177);
\n
"
"
#177 = PRODUCT_DEFINITION('Version', 'Test Part', #182, #178);
\n
"
"
#178 = DESIGN_CONTEXT('3D Mechanical Parts', #181, 'design');
\n
"
"
#179 = PRODUCT('1', 'Product', 'Test Part', (#180));
\n
"
"
#180 = MECHANICAL_CONTEXT('3D Mechanical Parts', #181, 'mechanical');
\n
"
"
#181 = APPLICATION_CONTEXT(
\n
"
"
'configuration controlled 3d designs of mechanical parts and assemblies');
\n
"
"
#182 = PRODUCT_DEFINITION_FORMATION_WITH_SPECIFIED_SOURCE('Version',
\n
"
"
'Test Part', #179, .MADE.);
\n
"
"
\n
"
);
}
int
StepFileWriter::ExportCurve
(SBezier *sb) {
int
i, ret = id;
fprintf
(f,
"
#%d=(
\n
"
, ret);
fprintf
(f,
"
BOUNDED_CURVE()
\n
"
);
fprintf
(f,
"
B_SPLINE_CURVE(%d,(
"
, sb->
deg
);
for
(i =
0
; i <= sb->
deg
; i++) {
fprintf
(f,
"
#%d
"
, ret + i +
1
);
if
(i != sb->
deg
)
fprintf
(f,
"
,
"
);
}
fprintf
(f,
"
),.UNSPECIFIED.,.F.,.F.)
\n
"
);
fprintf
(f,
"
B_SPLINE_CURVE_WITH_KNOTS((%d,%d),
"
,
(sb->
deg
+
1
), (sb-> deg +
1
));
fprintf
(f,
"
(0.000,1.000),.UNSPECIFIED.)
\n
"
);
fprintf
(f,
"
CURVE()
\n
"
);
fprintf
(f,
"
GEOMETRIC_REPRESENTATION_ITEM()
\n
"
);
fprintf
(f,
"
RATIONAL_B_SPLINE_CURVE((
"
);
for
(i =
0
; i <= sb->
deg
; i++) {
fprintf
(f,
"
%.10f
"
, sb->
weight
[i]);
if
(i != sb->
deg
)
fprintf
(f,
"
,
"
);
}
fprintf
(f,
"
))
\n
"
);
fprintf
(f,
"
REPRESENTATION_ITEM('')
\n
);
\n
"
);
for
(i =
0
; i <= sb->
deg
; i++) {
fprintf
(f,
"
#%d=CARTESIAN_POINT('',(%.10f,%.10f,%.10f));
\n
"
,
id +
1
+ i,
CO
(sb->
ctrl
[i]));
}
fprintf
(f,
"
\n
"
);
id = ret +
1
+ (sb->
deg
+
1
);
return
ret;
}
int
StepFileWriter::ExportCurveLoop
(SBezierLoop *loop,
bool
inner) {
ssassert
(loop->
l
.
n
>=
1
,
"
Expected at least one loop
"
);
List<
int
> listOfTrims = {};
SBezier *sb = loop->
l
.
Last
();
//
Generate "exactly closed" contours, with the same vertex id for the
//
finish of a previous edge and the start of the next one. So we need
//
the finish of the last Bezier in the loop before we start our process.
fprintf
(f,
"
#%d=CARTESIAN_POINT('',(%.10f,%.10f,%.10f));
\n
"
,
id,
CO
(sb->
Finish
()));
fprintf
(f,
"
#%d=VERTEX_POINT('',#%d);
\n
"
, id+
1
, id);
int
lastFinish = id +
1
, prevFinish = lastFinish;
id +=
2
;
for
(sb = loop->
l
.
First
(); sb; sb = loop->
l
.
NextAfter
(sb)) {
int
curveId =
ExportCurve
(sb);
int
thisFinish;
if
(loop->
l
.
NextAfter
(sb) !=
NULL
) {
fprintf
(f,
"
#%d=CARTESIAN_POINT('',(%.10f,%.10f,%.10f));
\n
"
,
id,
CO
(sb->
Finish
()));
fprintf
(f,
"
#%d=VERTEX_POINT('',#%d);
\n
"
, id+
1
, id);
thisFinish = id +
1
;
id +=
2
;
}
else
{
thisFinish = lastFinish;
}
fprintf
(f,
"
#%d=EDGE_CURVE('',#%d,#%d,#%d,%s);
\n
"
,
id, prevFinish, thisFinish, curveId,
"
.T.
"
);
fprintf
(f,
"
#%d=ORIENTED_EDGE('',*,*,#%d,.T.);
\n
"
,
id+
1
, id);
int
oe = id+
1
;
listOfTrims.
Add
(&oe);
id +=
2
;
prevFinish = thisFinish;
}
fprintf
(f,
"
#%d=EDGE_LOOP('',(
"
, id);
int
*oe;
for
(oe = listOfTrims.
First
(); oe; oe = listOfTrims.
NextAfter
(oe)) {
fprintf
(f,
"
#%d
"
, *oe);
if
(listOfTrims.
NextAfter
(oe) !=
NULL
)
fprintf
(f,
"
,
"
);
}
fprintf
(f,
"
));
\n
"
);
int
fb = id +
1
;
fprintf
(f,
"
#%d=%s('',#%d,.T.);
\n
"
,
fb, inner ?
"
FACE_BOUND
"
:
"
FACE_OUTER_BOUND
"
, id);
id +=
2
;
listOfTrims.
Clear
();
return
fb;
}
void
StepFileWriter::ExportSurface
(SSurface *ss, SBezierList *sbl) {
int
i, j, srfid = id;
//
First, we create the untrimmed surface. We always specify a rational
//
B-spline surface (in fact, just a Bezier surface).
fprintf
(f,
"
#%d=(
\n
"
, srfid);
fprintf
(f,
"
BOUNDED_SURFACE()
\n
"
);
fprintf
(f,
"
B_SPLINE_SURFACE(%d,%d,(
"
, ss->
degm
, ss->
degn
);
for
(i =
0
; i <= ss->
degm
; i++) {
fprintf
(f,
"
(
"
);
for
(j =
0
; j <= ss->
degn
; j++) {
fprintf
(f,
"
#%d
"
, srfid +
1
+ j + i*(ss->
degn
+
1
));
if
(j != ss->
degn
)
fprintf
(f,
"
,
"
);
}
fprintf
(f,
"
)
"
);
if
(i != ss->
degm
)
fprintf
(f,
"
,
"
);
}
fprintf
(f,
"
),.UNSPECIFIED.,.F.,.F.,.F.)
\n
"
);
fprintf
(f,
"
B_SPLINE_SURFACE_WITH_KNOTS((%d,%d),(%d,%d),
"
,
(ss->
degm
+
1
), (ss->
degm
+
1
),
(ss->
degn
+
1
), (ss->
degn
+
1
));
fprintf
(f,
"
(0.000,1.000),(0.000,1.000),.UNSPECIFIED.)
\n
"
);
fprintf
(f,
"
GEOMETRIC_REPRESENTATION_ITEM()
\n
"
);
fprintf
(f,
"
RATIONAL_B_SPLINE_SURFACE((
"
);
for
(i =
0
; i <= ss->
degm
; i++) {
fprintf
(f,
"
(
"
);
for
(j =
0
; j <= ss->
degn
; j++) {
fprintf
(f,
"
%.10f
"
, ss->
weight
[i][j]);
if
(j != ss->
degn
)
fprintf
(f,
"
,
"
);
}
fprintf
(f,
"
)
"
);
if
(i != ss->
degm
)
fprintf
(f,
"
,
"
);
}
fprintf
(f,
"
))
\n
"
);
fprintf
(f,
"
REPRESENTATION_ITEM('')
\n
"
);
fprintf
(f,
"
SURFACE()
\n
"
);
fprintf
(f,
"
);
\n
"
);
//
The control points for the untrimmed surface.
for
(i =
0
; i <= ss->
degm
; i++) {
for
(j =
0
; j <= ss->
degn
; j++) {
fprintf
(f,
"
#%d=CARTESIAN_POINT('',(%.10f,%.10f,%.10f));
\n
"
,
srfid +
1
+ j + i*(ss->
degn
+
1
),
CO
(ss->
ctrl
[i][j]));
}
}
fprintf
(f,
"
\n
"
);
id = srfid +
1
+ (ss->
degm
+
1
)*(ss->
degn
+
1
);
//
Now we do the trim curves. We must group each outer loop separately
//
along with its inner faces, so do that now.
SBezierLoopSetSet sblss = {};
SPolygon spxyz = {};
bool
allClosed;
SEdge notClosedAt;
//
We specify a surface, so it doesn't check for coplanarity; and we
//
don't want it to give us any open contours. The polygon and chord
//
tolerance are required, because they are used to calculate the
//
contour directions and determine inner vs. outer contours.
sblss.
FindOuterFacesFrom
(sbl, &spxyz, ss,
SS
.
ExportChordTolMm
(),
&allClosed, ¬ClosedAt,
NULL
,
NULL
,
NULL
);
//
So in our list of SBezierLoopSet, each set contains at least one loop
//
(the outer boundary), plus any inner loops associated with that outer
//
loop.
SBezierLoopSet *sbls;
for
(sbls = sblss.
l
.
First
(); sbls; sbls = sblss.
l
.
NextAfter
(sbls)) {
SBezierLoop *loop = sbls->
l
.
First
();
List<
int
> listOfLoops = {};
//
Create the face outer boundary from the outer loop.
int
fob =
ExportCurveLoop
(loop,
/*
inner=
*/
false
);
listOfLoops.
Add
(&fob);
//
And create the face inner boundaries from any inner loops that
//
lie within this contour.
loop = sbls->
l
.
NextAfter
(loop);
for
(; loop; loop = sbls->
l
.
NextAfter
(loop)) {
int
fib =
ExportCurveLoop
(loop,
/*
inner=
*/
true
);
listOfLoops.
Add
(&fib);
}
//
And now create the face that corresponds to this outer loop
//
and all of its holes.
int
advFaceId = id;
fprintf
(f,
"
#%d=ADVANCED_FACE('',(
"
, advFaceId);
int
*fb;
for
(fb = listOfLoops.
First
(); fb; fb = listOfLoops.
NextAfter
(fb)) {
fprintf
(f,
"
#%d
"
, *fb);
if
(listOfLoops.
NextAfter
(fb) !=
NULL
)
fprintf
(f,
"
,
"
);
}
fprintf
(f,
"
),#%d,.T.);
\n
"
, srfid);
fprintf
(f,
"
\n
"
);
advancedFaces.
Add
(&advFaceId);
id++;
listOfLoops.
Clear
();
}
sblss.
Clear
();
spxyz.
Clear
();
}
void
StepFileWriter::WriteFooter
() {
fprintf
(f,
"
\n
"
"
ENDSEC;
\n
"
"
\n
"
"
END-ISO-10303-21;
\n
"
);
}
void
StepFileWriter::ExportSurfacesTo
(
const
Platform::Path &filename) {
Group *g =
SK
.
GetGroup
(
SS
.
GW
.
activeGroup
);
SShell *shell = &(g->
runningShell
);
if
(shell->
surface
.
IsEmpty
()) {
Error
(
"
The model does not contain any surfaces to export.%s
"
,
!g->
runningMesh
.
l
.
IsEmpty
()
?
"
\n\n
The model does contain triangles from a mesh, but
"
"
a triangle mesh cannot be exported as a STEP file. Try
"
"
File -> Export Mesh... instead.
"
:
"
"
);
return
;
}
f =
OpenFile
(filename,
"
wb
"
);
if
(!f) {
Error
(
"
Couldn't write to '%s'
"
, filename.
raw
.
c_str
());
return
;
}
WriteHeader
();
WriteProductHeader
();
advancedFaces = {};
SSurface *ss;
for
(ss = shell->
surface
.
First
(); ss; ss = shell->
surface
.
NextAfter
(ss)) {
if
(ss->
trim
.
IsEmpty
())
continue
;
//
Get all of the loops of Beziers that trim our surface (with each
//
Bezier split so that we use the section as t goes from 0 to 1), and
//
the piecewise linearization of those loops in xyz space.
SBezierList sbl = {};
ss->
MakeSectionEdgesInto
(shell,
NULL
, &sbl);
//
Apply the export scale factor.
ss->
ScaleSelfBy
(
1.0
/
SS
.
exportScale
);
sbl.
ScaleSelfBy
(
1.0
/
SS
.
exportScale
);
ExportSurface
(ss, &sbl);
sbl.
Clear
();
}
fprintf
(f,
"
#%d=CLOSED_SHELL('',(
"
, id);
int
*af;
for
(af = advancedFaces.
First
(); af; af = advancedFaces.
NextAfter
(af)) {
fprintf
(f,
"
#%d
"
, *af);
if
(advancedFaces.
NextAfter
(af) !=
NULL
)
fprintf
(f,
"
,
"
);
}
fprintf
(f,
"
));
\n
"
);
fprintf
(f,
"
#%d=MANIFOLD_SOLID_BREP('brep',#%d);
\n
"
, id+
1
, id);
fprintf
(f,
"
#%d=ADVANCED_BREP_SHAPE_REPRESENTATION('',(#%d,#170),#168);
\n
"
,
id+
2
, id+
1
);
fprintf
(f,
"
#%d=SHAPE_REPRESENTATION_RELATIONSHIP($,$,#169,#%d);
\n
"
,
id+
3
, id+
2
);
WriteFooter
();
fclose
(f);
advancedFaces.
Clear
();
}
void
StepFileWriter::WriteWireframe
() {
fprintf
(f,
"
#%d=GEOMETRIC_CURVE_SET('curves',(
"
, id);
int
*c;
for
(c = curves.
First
(); c; c = curves.
NextAfter
(c)) {
fprintf
(f,
"
#%d
"
, *c);
if
(curves.
NextAfter
(c) !=
NULL
)
fprintf
(f,
"
,
"
);
}
fprintf
(f,
"
));
\n
"
);
fprintf
(f,
"
#%d=GEOMETRICALLY_BOUNDED_WIREFRAME_SHAPE_REPRESENTATION
"
"
('',(#%d,#170),#168);
\n
"
, id+
1
, id);
fprintf
(f,
"
#%d=SHAPE_REPRESENTATION_RELATIONSHIP($,$,#169,#%d);
\n
"
,
id+
2
, id+
1
);
id +=
3
;
curves.
Clear
();
}
Back
|
FazBrowse Home
|
New Git URL