-
Notifications
You must be signed in to change notification settings - Fork 15
/
Copy pathgen_func.py
174 lines (133 loc) · 4.21 KB
/
gen_func.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
# __________________________________/
# __Author:_________Vit_Prochazka___/
# __Created:________15.12.2015______/
# __Last_modified:__31.03.2018______/
# __Version:________0.4_____________/
# __________________________________/
import bpy
from mathutils import Vector, Quaternion
from math import pi
from typing import List
def create_mesh_object(context, verts, edges, faces, name):
# Create new mesh
mesh = bpy.data.meshes.new(name)
mesh.from_pydata(verts, edges, faces)
mesh.update()
from bpy_extras import object_utils
return object_utils.object_data_add(context, mesh, operator=None)
def circleVerts(radius: float, seg: int, IDs_Offset: int):
verts = []
vertIDs = []
if radius <= 0:
return [Vector((0, 0, 0))], [IDs_Offset]
if seg < 3:
seg = 3
stepAngle = (2 * pi) / seg
for i in range(seg):
vertIDs.append(i + IDs_Offset)
quat = Quaternion((0, 0, 1), i * stepAngle)
verts.append(quat * Vector((radius, 0.0, 0.0)))
return verts, vertIDs
def moveVerts(
verts: List[Vector],
offset: Vector):
for i in range(len(verts)):
verts[i] += offset
def rotateVerts(
verts: List[Vector],
axis: Quaternion):
for i, vel in enumerate(verts):
verts[i] = axis * vel
def bridgeLoops(loop1, loop2, close):
faces = []
if len(loop1) != len(loop2):
return None
for i in range(len(loop1) - 1):
face = (loop1[i], loop1[i + 1], loop2[i + 1], loop2[i])
faces.append(face)
if close:
faces.append((loop1[- 1], loop1[0], loop2[0], loop2[- 1]))
return faces
def fanClose(loop, point, closed = True, flipped = False):
faces = []
prevID = None
for idx in loop:
if prevID is None and closed:
if flipped:
faces.append((loop[-1], point, idx))
else:
faces.append((loop[-1], idx, point))
elif prevID is not None:
if flipped:
faces.append((prevID, point, idx))
else:
faces.append((prevID, idx, point))
prevID = idx
return faces
# subsurf
def findEdges(faces):
edges = [] # edge(vertsIDs)
borders = [] # border(edgesIDs)
for face in faces:
polys = len(face)
border = []
for i in range(polys):
if i == polys - 1:
edgeA, edgeB = face[i], face[0]
else:
edgeA, edgeB = face[i], face[i + 1]
# sort indexes
if edgeA > edgeB:
edgeA, edgeB = edgeB, edgeA
newEdge = (edgeA, edgeB)
# is it a really NEW edge?
if newEdge not in edges:
border.append(len(edges))
edges.append(newEdge)
else:
border.append(edges.index(newEdge))
borders.append(border)
return edges, borders
def VectorMedian(IDs, verts):
outVec = Vector((0, 0, 0))
for IDX in IDs:
outVec += verts[IDX]
outVec /= len(IDs)
return outVec
def subdivide(verts, edges, faces, tris):
Sedges, borders = findEdges(faces)
NewFaces = []
vertIDsOffset = len(verts)
# midpoints
midVerts = []
for line in Sedges:
midVerts.append((verts[line[0]] + verts[line[1]]) / 2)
verts.extend(midVerts)
i = 0
for border in borders:
face = faces[i]
i += 1
if not tris:
centerVec = VectorMedian(face, verts)
centerVecID = len(verts)
verts.append(centerVec)
for b in range(len(border)):
NewFaces.append((
face[b],
border[b] + vertIDsOffset,
centerVecID,
border[b-1] + vertIDsOffset
))
else:
for b in range(len(border)):
NewFaces.append((
face[b],
border[b] + vertIDsOffset,
border[b-1] + vertIDsOffset
))
NewFaces.append((
border[0] + vertIDsOffset,
border[1] + vertIDsOffset,
border[2] + vertIDsOffset
))
return verts, edges, NewFaces