forked from egradman/rhino-fingerjoint
-
Notifications
You must be signed in to change notification settings - Fork 0
/
xyz.py
117 lines (89 loc) · 3.38 KB
/
xyz.py
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
import rhinoscriptsyntax as rs
from collections import defaultdict
from collections import Iterable
import Rhino
"""
# notes
- doesn't handle laser curf currently. to do this, simple scale alternating
cylinders along the intersection axis
"""
# this dictionary maps a guid to the fingers
# which will be booleansubtracted from it
# in the final step
guid_to_difference = defaultdict(list)
def main():
# first, select objects in three orthogonal planes
xs = rs.GetObjects("select X objects", filter=16); # polysurface
ys = rs.GetObjects("select Y objects", filter=16);
zs = rs.GetObjects("select Z objects", filter=16);
subdivisions = rs.GetInteger(message="enter subdivisions (odd)", number=5, minimum=2, maximum=None)
for positive, negative, hidden in ((xs, ys, zs), (xs, zs, ys), (ys, zs, xs)):
rs.HideObjects(hidden)
make_fingers(positive, negative, subdivisions)
rs.ShowObjects(hidden)
# each time make_fingers is run, it fills guid_to_difference
# with more fingers to subtract.
# after all the fingers are subtracted at once
for guid, objs in guid_to_difference.items():
if objs:
rs.BooleanDifference(guid, objs)
def make_fingers(positive, negative, subdivisions):
"""
intersect two collections of planes
subdivide the intersections
assign each subdivision to a guid from which it will be subtracted
"""
# this vector is used to indicate axis of the intersection.
# it needs to be parallel to the intersection
# (there are other ways of doing this!)
p0 = rs.GetPoint("select start of intersection")
p1 = rs.GetPoint("select end of intersection")
edge = rs.AddLine(p0, p1)
vector = rs.VectorCreate(p0, p1)
rs.EnableRedraw(False)
# this dict maps a pair of planes (ps, ns) to their booleanintersection
intersections = {}
for ps in positive:
for ns in negative:
intersection = rs.BooleanIntersection(ps, ns, False)
intersections[(ps, ns)] = intersection
# here we construct some very large cylinders aligned with the axis you drew
origins = []
cylinders = []
for i in range(subdivisions+1):
origin = rs.EvaluateCurve(edge, rs.CurveParameter(edge, i * 1.0/(subdivisions)))
origins.append(origin)
rs.DeleteObject(edge)
for i in range(subdivisions):
plane = rs.PlaneFromNormal(origins[i], vector)
circle = rs.AddCircle(plane, 100)
planar_circle = rs.AddPlanarSrf(circle)
extrusion_curve = rs.AddLine(origins[i], origins[i+1])
cylinders.append(rs.ExtrudeSurface(planar_circle, extrusion_curve))
rs.DeleteObject(circle)
rs.DeleteObject(planar_circle)
rs.DeleteObject(extrusion_curve)
# we perform a boolean intersection between each intersection and
# the cylinders to construct the fingers
for key, intersection in intersections.items():
ps, ns = key
for i, cylinder in enumerate(cylinders):
objs = rs.BooleanIntersection(intersection, cylinder, False)
# assign the resulting fingers to either the positive or negative
if i % 2 == 0:
guid_to_difference[ps].extend(objs)
else:
guid_to_difference[ns].extend(objs)
DeleteItemOrList(cylinders)
DeleteItemOrList(intersections.values())
rs.EnableRedraw(True)
def DeleteItemOrList(d):
"""
helper to delete a guid or a list of guids
"""
if isinstance(d, Iterable):
for item in d: DeleteItemOrList(item)
else:
rs.DeleteObject(d)
if __name__ == '__main__':
main()