-
Notifications
You must be signed in to change notification settings - Fork 7
Expand file tree
/
Copy pathspb_Brep_nakedEdgeLoop.py
More file actions
596 lines (452 loc) · 19.5 KB
/
spb_Brep_nakedEdgeLoop.py
File metadata and controls
596 lines (452 loc) · 19.5 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
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
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
"""
"""
#! python 2 Must be on a line less than 32.
from __future__ import absolute_import, division, print_function, unicode_literals
"""
160924: Created.
...
250221,22: Added command options. Bug fix in printed output.
TODO:
Move createClosedCrvs_2EdgesPerVertexOnly and getNakedEdgeIndices_2EdgesPerVertexOnly
into their own script with a UI?
"""
import Rhino
import Rhino.Geometry as rg
import Rhino.Input as ri
import rhinoscriptsyntax as rs
import scriptcontext as sc
from System import Guid
class Opts:
keys = []
values = {}
names = {}
riOpts = {}
listValues = {}
stickyKeys = {}
key = 'fJoinTol'; keys.append(key)
#values[key] = sc.doc.ModelAbsoluteTolerance
value = 1e-6 * Rhino.RhinoMath.UnitScale(
Rhino.UnitSystem.Millimeters,
sc.doc.ModelUnitSystem)
values[key] = float(format(value, '.0e'))
riOpts[key] = ri.Custom.OptionDouble(values[key])
stickyKeys[key] = '{}({})({})'.format(key, __file__, sc.doc.Name)
key = 'fMinSegLengthToKeep'; keys.append(key)
values[key] = 1.0 * sc.doc.ModelAbsoluteTolerance
#value = 1e-3 * Rhino.RhinoMath.UnitScale(
# Rhino.UnitSystem.Millimeters,
# sc.doc.ModelUnitSystem)
#values[key] = float(format(value, '.0e'))
riOpts[key] = ri.Custom.OptionDouble(values[key])
stickyKeys[key] = '{}({})({})'.format(key, __file__, sc.doc.Name)
key = 'bEcho'; keys.append(key)
values[key] = True
riOpts[key] = ri.Custom.OptionToggle(values[key], 'No', 'Yes')
stickyKeys[key] = '{}({})'.format(key, __file__)
key = 'bDebug'; keys.append(key)
values[key] = False
riOpts[key] = ri.Custom.OptionToggle(values[key], 'No', 'Yes')
stickyKeys[key] = '{}({})'.format(key, __file__)
for key in keys:
if key not in names:
names[key] = key[1:]
# Load sticky.
for key in stickyKeys:
_debug = sc.sticky
if stickyKeys[key] in sc.sticky:
if key in riOpts:
riOpts[key].CurrentValue = values[key] = sc.sticky[stickyKeys[key]]
else:
values[key] = sc.sticky[stickyKeys[key]]
@classmethod
def addOption(cls, go, key):
idxOpt = None
if key in cls.riOpts:
if key[0] == 'b':
idxOpt = go.AddOptionToggle(
cls.names[key], cls.riOpts[key])[0]
elif key[0] == 'f':
idxOpt = go.AddOptionDouble(
cls.names[key], cls.riOpts[key])[0]
elif key[0] == 'i':
idxOpt = go.AddOptionInteger(
englishName=cls.names[key], intValue=cls.riOpts[key])[0]
elif key in cls.listValues:
idxOpt = go.AddOptionList(
englishOptionName=cls.names[key],
listValues=cls.listValues[key],
listCurrentIndex=cls.values[key])
else:
print("{} is not a valid key in Opts.".format(key))
return idxOpt
@classmethod
def setValue(cls, key, idxList=None):
if key in ('fJoinTol', 'fMinSegLengthToKeep'):
if cls.riOpts[key].CurrentValue < 0.0:
cls.riOpts[key].CurrentValue = cls.riOpts[key].InitialValue
elif cls.riOpts[key].CurrentValue < Rhino.RhinoMath.ZeroTolerance:
cls.riOpts[key].CurrentValue = Rhino.RhinoMath.ZeroTolerance
sc.sticky[cls.stickyKeys[key]] = cls.values[key] = cls.riOpts[key].CurrentValue
return
if key in cls.riOpts:
sc.sticky[cls.stickyKeys[key]] = cls.values[key] = cls.riOpts[key].CurrentValue
return
if key in cls.listValues:
sc.sticky[cls.stickyKeys[key]] = cls.values[key] = idxList
print("Invalid key?")
#
# Functions only used externally.
def getNakedEdgeIndices_2EdgesPerVertexOnly(brep):
def getBorderEdgeInfo_OnlyVertexCountsOf2(brep):
idxs_NE_All = []
idxs_NEVs_All = []
for edge in brep.Edges:
if edge.Valence == rg.EdgeAdjacency.Naked:
idxs_NE_All.append(edge.EdgeIndex)
idxs_NEVs_All.append(
(edge.StartVertex.VertexIndex,
edge.EndVertex.VertexIndex))
# Edges of naked borders normally have a total of 2 count for each vertex.
# Edges with vertex counts != 2 will be ignored.
flatList = [item for pair in idxs_NEVs_All for item in pair]
idxVs_not2Count = [item for item in set(flatList) if flatList.count(item) != 2]
if not idxVs_not2Count:
return idxs_NE_All, idxs_NEVs_All
else:
idxs_NE_2CtVs, idxs_NEVs_2CtVs = [], []
for idxE, idxVs in zip(idxs_NE_All, idxs_NEVs_All):
edge = brep.Edges[idxE]
if (
(edge.PointAtStart not in idxVs_not2Count) and
(edge.PointAtEnd not in idxVs_not2Count)
):
idxs_NE_2CtVs.append(idxE)
idxs_NEVs_2CtVs.append(idxVs)
return idxs_NE_2CtVs, idxs_NEVs_2CtVs
idx_NEs, idxs_Vs = getBorderEdgeInfo_OnlyVertexCountsOf2(brep)
idxs_nakedEdges_perBorder = [[idx_NEs[0]]]
while True:
sc.escape_test()
if not idxs_nakedEdges_perBorder[-1]:
# Add first items in nested lists.
for i in range(1, len(idx_NEs)):
idxE_A = idx_NEs[i]
if not any(idxE_A in idxs_Border for idxs_Border in idxs_nakedEdges_perBorder):
idxs_nakedEdges_perBorder[-1].append(idxE_A)
break
else:
idxE_A = idxs_nakedEdges_perBorder[-1][-1]
for i in range(1, len(idx_NEs)):
idxE_B = idx_NEs[i]
if any(idxE_B in idxs_Border for idxs_Border in idxs_nakedEdges_perBorder):
continue
if not idxs_nakedEdges_perBorder[-1]:
# This only occurs after the 'else' in 'else' below.
idxs_nakedEdges_perBorder[-1].append(idxE_B)
continue
if (
idxs_Vs[idx_NEs.index(idxE_A)][0] in idxs_Vs[i] or
idxs_Vs[idx_NEs.index(idxE_A)][1] in idxs_Vs[i]
):
idxs_nakedEdges_perBorder[-1].append(idxE_B)
break # to restart 'for i' but with the last added Edge index as Edge A.
else:
if sum([len(border) for border in idxs_nakedEdges_perBorder]) == len(idx_NEs):
# All naked edge indices are in idxs_nakedEdges_perBorder.
break # out of 'while'.
else:
# Start a new set of border edges.
idxs_nakedEdges_perBorder.append([])
#print(idxs_nakedEdges_perBorder
return idxs_nakedEdges_perBorder
def createClosedCrvs_2EdgesPerVertexOnly(brep, bDebug=False):
"""
Returns closed curves.
"""
def joinEdgeCrvsToEdgeTols(brep, idxs_Border, bDebug=False):
# Do not get EdgeCurves since they sometimes extend beyond the Edge Vertices.
crvs_toJoin = []
tols_Border = []
for iE in idxs_Border:
edge = brep.Edges[iE]
crvs_toJoin.append(edge)
tols_Border.append(edge.Tolerance)
rgCrvs_Joined = rg.Curve.JoinCurves(
crvs_toJoin,
joinTolerance=2.01*max(tols_Border))
if not rgCrvs_Joined:
1/0
elif len(rgCrvs_Joined) > 1:
if bDebug:
s = "More than 1 closed curve joined for a single border."
s += " This brep will not be used for trimming."
print(s)
return
rgCrv_Joined = rgCrvs_Joined[0]
#if not rgCrv_Joined.IsClosed:
# sc.doc.Objects.AddCurve(rgCrv_Joined)
# raise ValueError("Warning... curves for JoinCurves did not close.")
return rgCrv_Joined
idxs_NEs_perBorder = getNakedEdgeIndices_2EdgesPerVertexOnly(brep)
crvs_Border = []
for idxs_Border in idxs_NEs_perBorder:
crv_Border = joinEdgeCrvsToEdgeTols(brep, idxs_Border, bDebug=bDebug)
if crv_Border and crv_Border.IsClosed: crvs_Border.append(crv_Border)
return crvs_Border
#
#
def convertObjrefsToSortedBrepsAndEdges(objrefs):
"""
Parameters:
objrefs of Edges
Returns on success:
list(GUIDs of breps)
list(list(Edge indices) per brep)
"""
gBreps = []
idxs_Edges = []
# Organize input into synchronized lists of brep ids and edge indices.
for objref in objrefs:
gBrep = objref.ObjectId
idx_Edge = objref.Edge().EdgeIndex
if gBrep not in gBreps:
# Brep not in list, so add it as well as objref's edge.
gBreps.append(gBrep)
idxs_Edges.append([idx_Edge])
else:
# Brep already in list, so add the objref's edge to the relative index.
iB = gBreps.index(gBrep)
if idx_Edge not in idxs_Edges[iB]:
idxs_Edges[iB].append(idx_Edge)
return gBreps, idxs_Edges
def getInput():
"""
Get naked edges of breps.
"""
go = ri.Custom.GetObject()
go.GeometryFilter = Rhino.DocObjects.ObjectType.EdgeFilter
go.GeometryAttributeFilter = (ri.Custom.GeometryAttributeFilter.BoundaryEdge)
go.SetCommandPrompt("Select one edge of each naked edge loop")
go.EnablePreSelect(False, ignoreUnacceptablePreselectedObjects=True)
idxs_Opts = {}
def addOption(key): idxs_Opts[key] = Opts.addOption(go, key)
while True:
go.ClearCommandOptions()
idxs_Opts.clear()
addOption('fJoinTol')
addOption('fMinSegLengthToKeep')
addOption('bEcho')
addOption('bDebug')
res = go.GetMultiple(minimumNumber=1, maximumNumber=0)
if res == ri.GetResult.Cancel:
go.Dispose()
return
if res == ri.GetResult.Object:
objrefs = go.Objects()
go.Dispose()
return objrefs
# An option was selected.
for key in idxs_Opts:
if go.Option().Index == idxs_Opts[key]:
Opts.setValue(key, go.Option().CurrentListOptionIndex)
break
def getEdgeIndicesOfBorders(rhBrep, idxs_Edges, bDebug=False):
"""
Parameter:
rhBrep
idxs_Edges: List of BrepEdge indices or None if all borders (naked edges) are to be returned.
bDebug: bool
Loop through each target edge of the brep:
Find adjacent naked edges using vertices.
Accumulate edges in a list of a naked edge loop.
Join edges of naked edge loop into a closed curve.
Returns: 1-level deep list: Indices of BrepEdge in list per border.
The edges are in order in border loop.
"""
rgBrep = rhBrep if isinstance(rhBrep, rg.Brep) else rs.coercebrep(rhBrep)
if not rgBrep.IsValid:
print("Warning! Brep is not valid. Check results.")
idxs_Es_perBorder = [] # 1-level deep list.
if not idxs_Edges:
idxs_Edges = [edge.EdgeIndex for edge in rgBrep.Edges if edge.Valence == rg.EdgeAdjacency.Naked]
for idx_Edge in idxs_Edges:
if bDebug:
print('-'*80)
sEval = 'idx_Edge'; print(sEval+':', eval(sEval))
# Skip edges that are already in join list.
if idx_Edge in [i for b in idxs_Es_perBorder for i in b]:
continue # To next edge.
rgEdge = rgBrep.Edges[idx_Edge]
idx_rgVertex_Start0 = rgEdge.StartVertex.VertexIndex
if bDebug: sEval = 'idx_rgVertex_Start0'; print(sEval+':', eval(sEval))
idx_rgVertex_Last = None
if bDebug: sEval = 'idx_rgVertex_Last'; print(sEval+':', eval(sEval))
idxs_Edges_in_border = []
# Accumulate indices of a border of edges.
while True:
if bDebug: print('-'*40)
sc.escape_test()
idxs_Edges_in_border.append(idx_Edge)
rgVertex_Now = rgEdge.EndVertex
idx_Vertex_Now = rgVertex_Now.VertexIndex
if bDebug: sEval = 'idx_Vertex_Now'; print(sEval+':', eval(sEval))
# When does this happen?
if bDebug: sEval = 'idx_Vertex_Now == idx_rgVertex_Last'; print(sEval+':', eval(sEval))
if idx_Vertex_Now == idx_rgVertex_Last:
if bDebug:
print("End vertex matches the last end vertex, so using the start vertex instead.")
rgVertex_Now = rgEdge.StartVertex
if bDebug: sEval = 'rgVertex_Now'; print(sEval+':', eval(sEval))
idx_Vertex_Now = rgVertex_Now.VertexIndex
if bDebug: sEval = 'idx_Vertex_Now'; print(sEval+':', eval(sEval))
# Break out of while loop if this is the last edge of naked edge border.
if bDebug: sEval = 'idx_Vertex_Now == idx_rgVertex_Start0'; print(sEval+':', eval(sEval))
if idx_Vertex_Now == idx_rgVertex_Start0:
break
if bDebug: sEval = 'rgVertex_Now.EdgeIndices()'; print(sEval+':', eval(sEval))
# Find next adjacent naked edge.
idx_Es_V_Now = rgVertex_Now.EdgeIndices()
for idx_Edge_at_Vertext in idx_Es_V_Now:
if bDebug: sEval = 'idx_Edge_at_Vertext'; print(sEval+':', eval(sEval))
rgEdge = rgBrep.Edges[idx_Edge_at_Vertext]
if bDebug:
sEval = 'idx_Edge_at_Vertext != idx_Edge'; print(sEval+':', eval(sEval))
sEval = 'idx_Edge_at_Vertext not in idxs_Edges_in_border'; print(sEval+':', eval(sEval))
sEval = 'rgEdge.Valence == rg.EdgeAdjacency.Naked'; print(sEval+':', eval(sEval))
if (
idx_Edge_at_Vertext != idx_Edge and
idx_Edge_at_Vertext not in idxs_Edges_in_border and
rgEdge.Valence == rg.EdgeAdjacency.Naked
):
idx_Edge = idx_Edge_at_Vertext
if bDebug: sEval = 'idx_Edge'; print(sEval+':', eval(sEval))
idx_rgVertex_Last = idx_Vertex_Now
if bDebug: sEval = 'idx_rgVertex_Last'; print(sEval+':', eval(sEval))
break
else: print("Next adjacent naked edge not found!")
idxs_Es_perBorder.append(idxs_Edges_in_border)
return idxs_Es_perBorder
def removeIndicesOfShortEdges(rhBrep, idxs_Edges_in_border, fMinSegLengthToKeep=None):
rgBrep = rhBrep if isinstance(rhBrep, rg.Brep) else rs.coercebrep(rhBrep)
for idx in reversed(idxs_Edges_in_border):
fLength = rgBrep.Edges[idx].GetLength()
if fLength < fMinSegLengthToKeep:
idxs_Edges_in_border.remove(idx)
def get_joined_curves(rhBrep, idxs_Edges_per_border, fJoinTol=None, bEcho=True, bDebug=False):
"""
Parameters:
rhBrep: rg.Brep, rd.BrepObject, or (GUID of brep)
idxs_Edges_per_border: These are ordered to border loop.
fJoinTol
bEcho
bDebug
Returns on success:
list(rg.Curve (0-level deep))
"""
rgBrep = rs.coercebrep(rhBrep)
rgCrvs_Borders = []
for idxEs_of_border in idxs_Edges_per_border:
rgEdges_in_border = [rgBrep.Edges[idx] for idx in idxEs_of_border]
rgCrvs = rg.Curve.JoinCurves(rgEdges_in_border, joinTolerance=fJoinTol)
rgCrvs_Borders.extend(rgCrvs)
return rgCrvs_Borders
def add_CurvesOfBorders(rgCrvs, bEcho=True, bDebug=False):
gCurves_borders = []
for rgCrv in rgCrvs:
if not rgCrv.IsClosed: bAllCurvesClosed = False
gCrv = sc.doc.Objects.AddCurve(rgCrv)
if gCrv == Guid.Empty: continue
sc.doc.Objects.Select(gCrv)
gCurves_borders.append(gCrv)
return gCurves_borders
def processBrep(rgBrep, idxs_Trims, fMinSegLengthToKeep=None, fJoinTol=None, bEcho=True, bDebug=False):
idxs_Edges_per_border = getEdgeIndicesOfBorders(
rgBrep,
idxs_Trims,
bDebug=bDebug)
if idxs_Edges_per_border is None: return
if fMinSegLengthToKeep:
for idxEs_of_border in idxs_Edges_per_border:
removeIndicesOfShortEdges(
rgBrep,
idxEs_of_border,
fMinSegLengthToKeep=fMinSegLengthToKeep)
rgCrvs_Borders = get_joined_curves(
rgBrep,
idxs_Edges_per_border,
fJoinTol=fJoinTol,
bEcho=bEcho,
bDebug=bDebug)
return rgCrvs_Borders
def processBrepObjects(rhBreps, idx_Trims_PerBrep, fMinSegLengthToKeep=None, fJoinTol=None, bEcho=True, bDebug=False):
"""
Parameters:
rdBreps, # list(rd.BrepObject's or GUID's of them)
idx_Trims_PerBrep,
bEcho,
bDebug
Returns on success:
list(list(GUIDs of curves) per brep))
"""
gCurves_Borders_PerBrep = [] # 1-level deep list nesting.
for rhBrep, idxs_Trims in zip(rhBreps, idx_Trims_PerBrep):
rgBrep_In = rs.coercebrep(rhBrep)
rgCrvs_Borders = processBrep(
rgBrep_In,
idxs_Trims,
fMinSegLengthToKeep=fMinSegLengthToKeep,
fJoinTol=fJoinTol,
bEcho=bEcho,
bDebug=bDebug)
if rgCrvs_Borders is None:
continue
gCurves_Borders = add_CurvesOfBorders(
rgCrvs_Borders,
bEcho,
bDebug)
if gCurves_Borders is None:
continue
gCurves_Borders_PerBrep.append(gCurves_Borders)
return gCurves_Borders_PerBrep
def main():
objrefs = getInput()
if not objrefs: return
fJoinTol = Opts.values['fJoinTol']
fMinSegLengthToKeep = Opts.values['fMinSegLengthToKeep']
bEcho = Opts.values['bEcho']
bDebug = Opts.values['bDebug']
#if not bDebug: sc.doc.Views.RedrawEnabled=False
rc = convertObjrefsToSortedBrepsAndEdges(objrefs)
if rc is None: return
gBreps, idxs_Edges_per_Brep = rc
sc.doc.Objects.UnselectAll()
gCurves_Borders_PerBrep = processBrepObjects(
gBreps,
idxs_Edges_per_Brep,
fMinSegLengthToKeep=fMinSegLengthToKeep,
fJoinTol=fJoinTol,
bEcho=bEcho,
bDebug=bDebug)
if gCurves_Borders_PerBrep is None: return
sc.doc.Views.Redraw()
iCt_Crvs_added = 0
iCt_Open = 0
for gCurves_borders in gCurves_Borders_PerBrep:
for gCurve in gCurves_borders:
if not rs.IsCurveClosed(gCurve):
iCt_Open += 1
iCt_Crvs_added += 1
if iCt_Crvs_added == 1:
if not iCt_Open:
print("1 closed curve added to document.")
else:
print("1 open curve added to document.")
else:
if iCt_Open == 0:
print("{} closed curves added to document.".format(iCt_Crvs_added))
elif iCt_Open == iCt_Crvs_added:
print("{} open curves added to document.".format(iCt_Open))
else:
print("{} open and {} closed curves added to document.".format(
iCt_Open, iCt_Crvs_added-iCt_Open))
if __name__ == '__main__': main()