-
Notifications
You must be signed in to change notification settings - Fork 42
/
mi_looptools.py
226 lines (189 loc) · 7.16 KB
/
mi_looptools.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
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
# ##### BEGIN GPL LICENSE BLOCK #####
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License
# as published by the Free Software Foundation; either version 2
# of the License, or (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software Foundation,
# Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
#
# ##### END GPL LICENSE BLOCK #####
import bmesh
import bpy
import collections
import mathutils
import math
from bpy_extras import view3d_utils
# THIS CODE IS TAKEN FROM BLENDER LOOPTOOLS ADDON. Thanks a lot to Bart Crouch.
##########################################
####### General functions ################
##########################################
# check loops and only return valid ones
# method is modified
def check_loops(loops, bm_mod):
valid_loops = []
for loop, circular in loops:
# loop needs to have at least 3 vertices
if len(loop) < 3:
continue
## loop needs at least 1 vertex in the original, non-mirrored mesh
#if mapping:
#all_virtual = True
#for vert in loop:
#if mapping[vert] > -1:
#all_virtual = False
#break
#if all_virtual:
#continue
# vertices can not all be at the same location
stacked = True
for i in range(len(loop) - 1):
if (bm_mod.verts[loop[i]].co - \
bm_mod.verts[loop[i+1]].co).length > 1e-6:
stacked = False
break
if stacked:
continue
# passed all tests, loop is valid
valid_loops.append([loop, circular])
return(valid_loops)
# input: bmesh, output: dict with the edge-key as key and face-index as value
def dict_edge_faces(bm):
edge_faces = dict([[edgekey(edge), []] for edge in bm.edges if \
not edge.hide])
for face in bm.faces:
if face.hide:
continue
for key in face_edgekeys(face):
edge_faces[key].append(face.index)
return(edge_faces)
# input: bmesh (edge-faces optional), output: dict with face-face connections
def dict_face_faces(bm, edge_faces=False):
if not edge_faces:
edge_faces = dict_edge_faces(bm)
connected_faces = dict([[face.index, []] for face in bm.faces if \
not face.hide])
for face in bm.faces:
if face.hide:
continue
for edge_key in face_edgekeys(face):
for connected_face in edge_faces[edge_key]:
if connected_face == face.index:
continue
connected_faces[face.index].append(connected_face)
return(connected_faces)
# input: bmesh, output: dict with the vert index as key and edge-keys as value
def dict_vert_edges(bm):
vert_edges = dict([[v.index, []] for v in bm.verts if not v.hide])
for edge in bm.edges:
if edge.hide:
continue
ek = edgekey(edge)
for vert in ek:
vert_edges[vert].append(ek)
return(vert_edges)
# input: bmesh, output: dict with the vert index as key and face index as value
def dict_vert_faces(bm):
vert_faces = dict([[v.index, []] for v in bm.verts if not v.hide])
for face in bm.faces:
if not face.hide:
for vert in face.verts:
vert_faces[vert.index].append(face.index)
return(vert_faces)
# input: list of edge-keys, output: dictionary with vertex-vertex connections
def dict_vert_verts(edge_keys):
# create connection data
vert_verts = {}
for ek in edge_keys:
for i in range(2):
if ek[i] in vert_verts:
vert_verts[ek[i]].append(ek[1-i])
else:
vert_verts[ek[i]] = [ek[1-i]]
return(vert_verts)
# return the edgekey ([v1.index, v2.index]) of a bmesh edge
def edgekey(edge):
return(tuple(sorted([edge.verts[0].index, edge.verts[1].index])))
# returns the edgekeys of a bmesh face
def face_edgekeys(face):
return([tuple(sorted([edge.verts[0].index, edge.verts[1].index])) for \
edge in face.edges])
# calculate input loops
# method is modified
def get_connected_input(bm):
# calculate selected loops
edge_keys = [edgekey(edge) for edge in bm.edges if \
edge.select and not edge.hide]
loops = get_connected_selections(edge_keys)
return(loops)
# sorts all edge-keys into a list of loops
def get_connected_selections(edge_keys):
# create connection data
vert_verts = dict_vert_verts(edge_keys)
# find loops consisting of connected selected edges
loops = []
while len(vert_verts) > 0:
loop = [iter(vert_verts.keys()).__next__()]
growing = True
flipped = False
# extend loop
while growing:
# no more connection data for current vertex
if loop[-1] not in vert_verts:
if not flipped:
loop.reverse()
flipped = True
else:
growing = False
else:
extended = False
for i, next_vert in enumerate(vert_verts[loop[-1]]):
if next_vert not in loop:
vert_verts[loop[-1]].pop(i)
if len(vert_verts[loop[-1]]) == 0:
del vert_verts[loop[-1]]
# remove connection both ways
if next_vert in vert_verts:
if len(vert_verts[next_vert]) == 1:
del vert_verts[next_vert]
else:
vert_verts[next_vert].remove(loop[-1])
loop.append(next_vert)
extended = True
break
if not extended:
# found one end of the loop, continue with next
if not flipped:
loop.reverse()
flipped = True
# found both ends of the loop, stop growing
else:
growing = False
# check if loop is circular
if loop[0] in vert_verts:
if loop[-1] in vert_verts[loop[0]]:
# is circular
if len(vert_verts[loop[0]]) == 1:
del vert_verts[loop[0]]
else:
vert_verts[loop[0]].remove(loop[-1])
if len(vert_verts[loop[-1]]) == 1:
del vert_verts[loop[-1]]
else:
vert_verts[loop[-1]].remove(loop[0])
loop = [loop, True]
else:
# not circular
loop = [loop, False]
else:
# not circular
loop = [loop, False]
loops.append(loop)
return(loops)