forked from nortikin/Scripts
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1D_Scripts.py
More file actions
4822 lines (3992 loc) · 177 KB
/
1D_Scripts.py
File metadata and controls
4822 lines (3992 loc) · 177 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
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
# -*- coding: utf-8 -*-
# ##### 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 #####
bl_info = {
"name": "1D_Scripts",
"author": "Alexander Nedovizin, Paul Kotelevets aka 1D_Inc (concept design), Nikitron",
"version": (0, 7, 14),
"blender": (2, 7, 3),
"location": "View3D > Toolbar",
"category": "Mesh"
}
# http://dl.dropboxusercontent.com/u/59609328/Blender-Rus/1D_Scripts.py
import bpy,bmesh, mathutils, math
from mathutils import Vector
from mathutils.geometry import intersect_line_plane, intersect_point_line
from math import sin, cos, pi, sqrt, degrees
import os, urllib
from bpy.props import BoolProperty
from bpy_extras.io_utils import ExportHelper
from bpy.types import Operator
import time
list_z = []
mats_idx = []
list_f = []
maloe = 1e-5
steps_smoose = 0
def check_lukap(bm):
if hasattr(bm.verts, "ensure_lookup_table"):
bm.verts.ensure_lookup_table()
bm.edges.ensure_lookup_table()
bm.faces.ensure_lookup_table()
#----- Module: extrude along path -------
# author this module: Zmj100
# version 0.5.0.9
# ref: http://blenderartists.org/forum/showthread.php?179375-Addon-Edge-fillet-and-other-bmesh-tools-Update-Jan-11
def edit_mode_out():
bpy.ops.object.mode_set(mode = 'OBJECT')
def edit_mode_in():
bpy.ops.object.mode_set(mode = 'EDIT')
def get_adj_v_(list_):
tmp = {}
for i in list_:
try: tmp[i[0]].append(i[1])
except KeyError: tmp[i[0]] = [i[1]]
try: tmp[i[1]].append(i[0])
except KeyError: tmp[i[1]] = [i[0]]
return tmp
def f_1(frst, list_, last): # edge chain
fi = frst
tmp = [frst]
while list_ != []:
for i in list_:
if i[0] == fi:
tmp.append(i[1])
fi = i[1]
list_.remove(i)
elif i[1] == fi:
tmp.append(i[0])
fi = i[0]
list_.remove(i)
if tmp[-1] == last:
break
return tmp
def f_2(frst, list_): # edge loop
fi = frst
tmp = [frst]
while list_ != []:
for i in list_:
if i[0] == fi:
tmp.append(i[1])
fi = i[1]
list_.remove(i)
elif i[1] == fi:
tmp.append(i[0])
fi = i[0]
list_.remove(i)
if tmp[-1] == frst:
break
return tmp
def is_loop_(list_fl):
return True if len(list_fl) == 0 else False
def e_no_(bme, indx, p, p1):
if hasattr(bme.verts, "ensure_lookup_table"):
bme.verts.ensure_lookup_table()
tmp1 = (bme.verts[indx].co).copy()
tmp1[0] += 0.1
tmp1[1] += 0.1
tmp1[2] += 0.1
ip1 = intersect_point_line( tmp1, p, p1)[0]
return tmp1 - ip1
# ------ ------
def f_(bme, dict_0, list_fl, loop):
check_lukap(bme)
if loop:
list_1 = f_2(eap_buf.list_sp[0], eap_buf.list_ek)
del list_1[-1]
else:
list_1 = f_1(eap_buf.list_sp[0], eap_buf.list_ek, list_fl[1] if eap_buf.list_sp[0] == list_fl[0] else list_fl[0])
list_2 = [ v.index for v in bme.verts if v.select and v.is_valid ]
n1 = len(list_2)
list_3 = list_2[:]
dict_1 = {}
for k in list_2:
dict_1[k] = [k]
n = len(list_1)
for i in range(n):
p = (bme.verts[list_1[i]].co).copy()
p1 = (bme.verts[list_1[(i - 1) % n]].co).copy()
p2 = (bme.verts[list_1[(i + 1) % n]].co).copy()
vec1 = p - p1
vec2 = p - p2
ang = vec1.angle(vec2, any)
if round(degrees(ang)) == 180.0 or round(degrees(ang)) == 0.0:
pp = p - ((e_no_(bme, list_1[i], p, p1)).normalized() * 0.1)
pn = vec1.normalized()
else:
pp = ((p - (vec1.normalized() * 0.1)) + (p - (vec2.normalized() * 0.1))) * 0.5
pn = ((vec1.cross(vec2)).cross(p - pp)).normalized()
if loop: # loop
if i == 0:
pass
else:
for j in range(n1):
v = (bme.verts[list_3[j]].co).copy()
bme.verts.new(intersect_line_plane(v, v + (vec1.normalized() * 0.1), pp, pn))
bme.verts.index_update()
if hasattr(bme.verts, "ensure_lookup_table"):
bme.verts.ensure_lookup_table()
list_3[j] = bme.verts[-1].index
dict_1[list_2[j]].append(bme.verts[-1].index)
else: # path
if i == 0:
pass
elif i == (n - 1):
pp_ = p - ((e_no_(bme, list_fl[1] if eap_buf.list_sp[0] == list_fl[0] else list_fl[0], p, p1)).normalized() * 0.1)
pn_ = vec1.normalized()
for j in range(n1):
v = (bme.verts[list_3[j]].co).copy()
bme.verts.new(intersect_line_plane(v, v + (vec1.normalized() * 0.1), pp_, pn_))
bme.verts.index_update()
if hasattr(bme.verts, "ensure_lookup_table"):
bme.verts.ensure_lookup_table()
dict_1[list_2[j]].append(bme.verts[-1].index)
else:
for j in range(n1):
v = (bme.verts[list_3[j]].co).copy()
bme.verts.new(intersect_line_plane(v, v + (vec1.normalized() * 0.1), pp, pn))
bme.verts.index_update()
if hasattr(bme.verts, "ensure_lookup_table"):
bme.verts.ensure_lookup_table()
list_3[j] = bme.verts[-1].index
dict_1[list_2[j]].append(bme.verts[-1].index)
# -- -- -- --
list_4 = [[v.index for v in e.verts] for e in bme.edges if e.select and e.is_valid ]
n2 = len(list_4)
for t in range(n2):
for o in range(n if loop else (n - 1)):
bme.faces.new([bme.verts[dict_1[list_4[t][0]][o]], bme.verts[dict_1[list_4[t][1]][o]], bme.verts[dict_1[list_4[t][1]][(o + 1) % n]], bme.verts[dict_1[list_4[t][0]][(o + 1) % n]]])
bme.faces.index_update()
if hasattr(bme.faces, "ensure_lookup_table"):
bme.faces.ensure_lookup_table()
# ------ ------
class eap_buf():
list_ek = [] # path
list_sp = [] # start point
# ------ operator 0 ------
class eap_op0(bpy.types.Operator):
bl_idname = 'eap.op0_id'
bl_label = '....'
def execute(self, context):
edit_mode_out()
ob_act = context.active_object
bme = bmesh.new()
bme.from_mesh(ob_act.data)
check_lukap(bme)
eap_buf.list_ek[:] = []
for e in bme.edges:
if e.select and e.is_valid:
eap_buf.list_ek.append([v.index for v in e.verts])
e.select_set(0)
bme.to_mesh(ob_act.data)
edit_mode_in()
return {'FINISHED'}
# ------ operator 1 ------
class eap_op1(bpy.types.Operator):
bl_idname = 'eap.op1_id'
bl_label = '....'
def execute(self, context):
edit_mode_out()
ob_act = context.active_object
bme = bmesh.new()
bme.from_mesh(ob_act.data)
check_lukap(bme)
eap_buf.list_sp[:] = []
for v in bme.verts:
if v.select and v.is_valid:
eap_buf.list_sp.append(v.index)
v.select_set(0)
bme.to_mesh(ob_act.data)
edit_mode_in()
return {'FINISHED'}
# ------ operator 2 ------
class eap_op2(bpy.types.Operator):
bl_idname = 'eap.op2_id'
bl_label = 'Extrude Along Path'
bl_options = {'REGISTER', 'UNDO'}
def draw(self, context):
layout = self.layout
def execute(self, context):
edit_mode_out()
ob_act = context.active_object
bme = bmesh.new()
bme.from_mesh(ob_act.data)
check_lukap(bme)
dict_0 = get_adj_v_(eap_buf.list_ek)
list_fl = [i for i in dict_0 if (len(dict_0[i]) == 1)]
loop = is_loop_(list_fl)
f_(bme, dict_0, list_fl, loop)
bme.to_mesh(ob_act.data)
edit_mode_in()
return {'FINISHED'}
#-------------- END --- extrude along path ---------
def find_index_of_selected_vertex(mesh):
selected_verts = [i.index for i in mesh.vertices if i.select]
verts_selected = len(selected_verts)
if verts_selected <1:
return None
else:
return selected_verts
def find_extreme_select_verts(mesh, verts_idx):
res_vs = []
edges = mesh.edges
for v_idx in verts_idx:
connecting_edges = [i for i in edges if v_idx in i.vertices[:] and i.select]
if len(connecting_edges) == 1:
res_vs.append(v_idx)
return res_vs
def find_connected_verts_simple(me, found_index):
edges = me.edges
connecting_edges = [i for i in edges if found_index in i.vertices[:] and \
me.vertices[i.vertices[0]].select and me.vertices[i.vertices[1]].select]
if len(connecting_edges) == 0:
return []
else:
connected_verts = []
for edge in connecting_edges:
cvert = set(edge.vertices[:])
cvert.remove(found_index)
vert = cvert.pop()
connected_verts.append(vert)
return connected_verts
def find_connected_verts(me, found_index, not_list):
edges = me.edges
connecting_edges = [i for i in edges if found_index in i.vertices[:]]
if len(connecting_edges) == 0:
return []
else:
connected_verts = []
for edge in connecting_edges:
cvert = set(edge.vertices[:])
cvert.remove(found_index)
vert = cvert.pop()
if not (vert in not_list) and me.vertices[vert].select:
connected_verts.append(vert)
return connected_verts
def find_all_connected_verts(me, active_v, not_list=[], step=0):
vlist = [active_v]
not_list.append(active_v)
step+=1
list_v_1 = find_connected_verts(me, active_v, not_list)
for v in list_v_1:
list_v_2 = find_all_connected_verts(me, v, not_list, step)
vlist += list_v_2
return vlist
def bm_vert_active_get(bm):
for elem in reversed(bm.select_history):
if isinstance(elem, (bmesh.types.BMVert, bmesh.types.BMEdge, bmesh.types.BMFace)):
return elem.index, str(elem)[3:4]
return None, None
def to_store_coner(obj_name, bm, mode):
config = bpy.context.window_manager.paul_manager
active_edge, el = bm_vert_active_get(bm)
old_name_c = config.object_name_store_c
old_coner1 = config.coner_edge1_store
old_coner2 = config.coner_edge2_store
def check():
if mode=='EDIT_MESH' and \
(old_name_c != config.object_name_store_c or \
old_coner1 != config.coner_edge1_store or \
old_coner2 != config.coner_edge2_store):
config.flip_match = False
if active_edge != None and el=='E':
mesh = bpy.data.objects[obj_name].data
config.object_name_store_c = obj_name
config.coner_edge1_store = active_edge
verts = bm.edges[active_edge].verts
v0 = verts[0].index
v1 = verts[1].index
edges_idx = [i.index for i in mesh.edges \
if (v1 in i.vertices[:] or v0 in i.vertices[:])and i.select \
and i.index!=active_edge]
if edges_idx:
config.coner_edge2_store = edges_idx[0]
check()
return True
if active_edge != None and el=='V':
mesh = bpy.data.objects[obj_name].data
config.object_name_store_c = obj_name
v2_l = find_all_connected_verts(mesh, active_edge,[],0)
control_vs = find_connected_verts_simple(mesh, active_edge)
if len(v2_l)>2 and len(control_vs)==1:
v1 = v2_l.pop(1)
edges_idx = []
for v2 in v2_l[:2]:
edges_idx.extend([i.index for i in mesh.edges \
if v1 in i.vertices[:] and v2 in i.vertices[:]] )
if len(edges_idx)>1:
config.coner_edge1_store = edges_idx[0]
config.coner_edge2_store = edges_idx[1]
check()
return True
check()
config.object_name_store_c = ''
config.coner_edge1_store = -1
config.coner_edge2_store = -1
if mode =='EDIT_MESH':
config.flip_match = False
print_error('Two edges is not detected')
print('Error: align 05')
return False
def to_store_vert(obj_name, bm):
config = bpy.context.window_manager.paul_manager
active_edge, el = bm_vert_active_get(bm)
old_edge1 = config.active_edge1_store
old_edge2 = config.active_edge2_store
old_name_v = config.object_name_store_v
def check():
if old_name_v != config.object_name_store_v or \
old_edge1 != config.active_edge1_store or \
old_edge2 != config.active_edge2_store:
config.flip_match = False
if active_edge != None and el=='E':
mesh = bpy.data.objects[obj_name].data
config.object_name_store_v = obj_name
config.active_edge1_store = active_edge
verts = bm.edges[active_edge].verts
v0 = verts[0].index
v1 = verts[1].index
edges_idx = [i.index for i in mesh.edges \
if (v1 in i.vertices[:] or v0 in i.vertices[:])and i.select \
and i.index!=active_edge]
if edges_idx:
config.active_edge2_store = edges_idx[0]
check()
return True
if active_edge != None and el=='V':
mesh = bpy.data.objects[obj_name].data
config.object_name_store_v = obj_name
v2_l = find_all_connected_verts(mesh, active_edge,[],0)
control_vs = find_connected_verts_simple(mesh, active_edge)
if len(v2_l)>2 and len(control_vs)==1:
v1 = v2_l.pop(1)
edges_idx = []
for v2 in v2_l[:2]:
edges_idx.extend([i.index for i in mesh.edges \
if v1 in i.vertices[:] and v2 in i.vertices[:]] )
if len(edges_idx)>1:
config.active_edge1_store = edges_idx[0]
config.active_edge2_store = edges_idx[1]
check()
return True
check()
config.object_name_store_v = ''
config.active_edge1_store = -1
config.active_edge2_store = -1
config.flip_match = False
print_error('Side is undefined')
print('Error: 3dmatch 10')
return
def to_store(obj_name, bm):
config = bpy.context.window_manager.paul_manager
active_edge, el = bm_vert_active_get(bm)
if active_edge != None and el=='E':
config.object_name_store = obj_name
config.edge_idx_store = active_edge
verts = bm.edges[active_edge].verts
config.vec_store = (verts[1].co - verts[0].co) * \
bpy.data.objects[obj_name].matrix_world.to_3x3().transposed()
return
if active_edge != None and el=='V':
obj_act = bpy.context.active_object
mesh = obj_act.data
v2_l = find_index_of_selected_vertex(mesh)
if len(v2_l)==2:
v1 = active_edge
v2_l.pop(v2_l.index(v1))
v2 = v2_l[0]
edges_idx = [i.index for i in mesh.edges \
if v1 in i.vertices[:] and v2 in i.vertices[:]]
if edges_idx:
config.edge_idx_store = edges_idx[0]
config.object_name_store = obj_name
config.vec_store = (mesh.vertices[v1].co - mesh.vertices[v2].co) * \
bpy.data.objects[obj_name].matrix_world.to_3x3().transposed()
return
config.object_name_store = ''
config.edge_idx_store = -1
config.vec_store = mathutils.Vector((0,0,0))
print_error('Active edge is not detected')
print('Error: align 02')
def select_mesh_rot(me, matrix):
verts = [v for v in me.verts if v.select==True]
for v in verts:
v.co = v.co*matrix
def store_align(vts='edge', mode='EDIT_MESH'):
bpy.ops.object.editmode_toggle()
bpy.ops.object.editmode_toggle()
obj = bpy.context.active_object
mesh = obj.data
bm = bmesh.new()
bm.from_mesh(mesh)
result = True
check_lukap(bm)
if vts=='vert':
to_store_vert(obj.name, bm)
elif vts=='edge':
to_store(obj.name, bm)
else:
# vts=='coner':
result = to_store_coner(obj.name, bm, mode)
bm.free()
return result
def getNormalPlane(vecs, mat):
if len(vecs)<3:
return None
out_ = []
vec_c = mathutils.Vector((0,0,0))
for v in vecs:
vec = v*mat
out_.append(vec)
vec_c+=vec
vec_c = vec_c / len(vecs)
v = out_[1]-out_[0]
w = out_[2]-out_[0]
A = v.y*w.z - v.z*w.y
B = -v.x*w.z + v.z*w.x
C = v.x*w.y - v.y*w.x
D = -out_[0].x*A - out_[0].y*B - out_[0].z*C
norm = mathutils.Vector((A,B,C)).normalized()
return norm
def getNormalPlane2(vecs, mat):
if len(vecs)<3:
return None
out_ = []
vec_c = mathutils.Vector((0,0,0))
for v in vecs:
vec = mat*v
out_.append(vec)
vec_c+=vec
vec_c = vec_c / len(vecs)
v = out_[1]-out_[0]
w = out_[2]-out_[0]
A = v.y*w.z - v.z*w.y
B = -v.x*w.z + v.z*w.x
C = v.x*w.y - v.y*w.x
D = -out_[0].x*A - out_[0].y*B - out_[0].z*C
norm = mathutils.Vector((A,B,C)).normalized()
return norm
def mk_ob(mesh,name, loc):
ob = bpy.data.objects.new(name, mesh)
ob.location = loc
bpy.context.scene.objects.link(ob)
return ob
def sign(x):
if x<0:
return -1
else: return 1
def match3D(flip = False):
mode_ = bpy.context.mode
store_align('coner', mode_)
config = bpy.context.window_manager.paul_manager
if config.object_name_store_v == '' or \
config.active_edge1_store < 0 or config.active_edge2_store < 0:
print_error('Stored Vertex is required')
print('Error: 3dmatch 01')
return False
if config.object_name_store_c == '':
if mode_ =='EDIT_MESH':
print_error('Not specified object')
print('Error: 3dmatch 02')
return False
else:
config.object_name_store_c = bpy.context.active_object.name
if config.coner_edge1_store == -1 or \
config.coner_edge2_store == -1:
if mode_ =='EDIT_MESH':
#print_error('Not specified object')
print_error('Stored edges is required')
print('Error: 3dmatch 03')
return False
obj_A = bpy.data.objects[config.object_name_store_v]
obj_B = bpy.data.objects[config.object_name_store_c]
ve1 = obj_A.data.edges[config.active_edge1_store]
ve2 = obj_A.data.edges[config.active_edge2_store]
e1 = obj_B.data.edges[config.coner_edge1_store]
e2 = obj_B.data.edges[config.coner_edge2_store]
# получаем ещё две вершины. Иначе - реджект
connect_vs = []
connect_vs.extend(ve1.vertices[:])
connect_vs.extend(ve2.vertices[:])
v1 = -1
for v in connect_vs:
if connect_vs.count(v)>1:
v1 = obj_A.data.vertices[v]
connect_vs.pop(connect_vs.index(v))
connect_vs.pop(connect_vs.index(v))
break
if v1 == -1:
print_error('Active vertex of object_A must have two edges')
print('Error: 3dmatch 04')
return False
v2 = obj_A.data.vertices[connect_vs[0]]
v3 = obj_A.data.vertices[connect_vs[1]]
# вычислить нормаль объекта Б
#if mode_ =='EDIT_MESH':
if config.coner_edge1_store != -1:
lws = list(e1.vertices[:]+e2.vertices[:])
for l in lws:
if lws.count(l)>1:
lws.pop(lws.index(l))
w1 = obj_B.data.vertices[lws.pop(lws.index(l))]
w3 = obj_B.data.vertices[lws.pop()]
w2 = obj_B.data.vertices[lws.pop()]
else:
w1,w2,w3 = 0,0,0
mat_w = obj_B.matrix_world.copy()
k_x = 1
if mode_ !='EDIT_MESH':
if config.flip_match: k_x = -1
else: k_x = 1
if flip!=config.flip_match:
config.flip_match = flip
if mode_ =='EDIT_MESH':
bpy.ops.object.mode_set(mode='EDIT')
normal_B = getNormalPlane([w1.co, w2.co, w3.co], mathutils.Matrix())
normal_z = mathutils.Vector((0,0,1))
mat_rot_norm = normal_B.rotation_difference(normal_z).to_matrix().to_4x4()
verts = [v for v in obj_B.data.vertices if v.select==True]
for v in verts:
v.co = mat_rot_norm * v.co
bpy.ops.transform.resize(value=(1,1,-1), constraint_axis=(False, False, True))
else:
k_x *= -1
normal_x = mathutils.Vector((1,0,0)) * k_x
bpy.ops.object.mode_set(mode='EDIT')
bpy.ops.object.mode_set(mode='OBJECT')
edge_idx = [i.index for i in obj_A.data.edges \
if v1 in i.vertices[:] and v2 in i.vertices[:]]
vecA= (v2.co - v1.co) * obj_A.matrix_world.to_3x3().transposed()
if mode_ =='EDIT_MESH':
v1A = obj_A.matrix_world * v1.co
w1B = obj_B.matrix_world * w1.co
vecB = (w2.co - w1.co)
mat_rot = vecB.rotation_difference(vecA).to_matrix().to_4x4()
# rotation1
bpy.ops.object.mode_set(mode='EDIT')
bpy.ops.object.mode_set(mode='OBJECT')
normal_A = getNormalPlane([v1.co, v2.co, v3.co], mathutils.Matrix())
normal_A = normal_A * obj_A.matrix_world.to_3x3().transposed()
normal_B = getNormalPlane([w1.co, w2.co, w3.co], mathutils.Matrix())
mat_rot2 = normal_B.rotation_difference(normal_A).to_matrix().to_4x4()
verts = [v for v in obj_B.data.vertices if v.select==True]
for v in verts:
v.co = mat_rot2 * v.co
bpy.ops.object.mode_set(mode='EDIT')
bpy.ops.object.mode_set(mode='OBJECT')
vecA= (v2.co - v1.co) * obj_A.matrix_world.to_3x3().transposed()
vecB = (w2.co - w1.co)
mat_rot = vecB.rotation_difference(vecA).to_matrix().to_4x4()
verts = [v for v in obj_B.data.vertices if v.select==True]
for v in verts:
v.co = mat_rot * v.co
# invert rotation
bpy.ops.object.mode_set(mode='EDIT')
bpy.ops.object.mode_set(mode='OBJECT')
vec1 = mathutils.Vector((0,0,1))
vec2 = obj_B.matrix_world * vec1
mat_rot2 = vec1.rotation_difference(vec2).to_matrix().to_4x4()
mat_tmp = obj_B.matrix_world.copy()
mat_tmp[0][3]=0
mat_tmp[1][3]=0
mat_tmp[2][3]=0
mat_inv = mat_tmp.inverted()
verts = [v for v in obj_B.data.vertices if v.select==True]
for v in verts:
v.co = mat_inv * v.co
# location
bpy.ops.object.mode_set(mode='EDIT')
bpy.ops.object.mode_set(mode='OBJECT')
w1B = obj_B.matrix_world * w1.co
mat_loc = mathutils.Matrix.Translation(v1A-w1B)
vec_l = mat_inv * (v1A-w1B)
mat_tp = obj_B.matrix_world
vec_loc = mathutils.Vector((mat_tp[0][3],mat_tp[1][3],mat_tp[2][3]))
verts = [v for v in obj_B.data.vertices if v.select==True]
for v in verts:
v.co = v.co + vec_l
bpy.ops.object.mode_set(mode='EDIT')
else:
if config.coner_edge1_store == -1:
v1A = obj_A.matrix_world * v1.co
normal_A = getNormalPlane([v1.co, v2.co, v3.co], mathutils.Matrix())
normal_A = normal_A * obj_A.matrix_world.to_3x3().transposed()
normal_z = mathutils.Vector((0,0,1))
mat_rot1 = normal_z.rotation_difference(normal_A).to_matrix().to_4x4()
vecA = (v2.co - v1.co) * obj_A.matrix_world.to_3x3().transposed()
vecB = mat_rot1 * normal_x
mat_rot = vecB.rotation_difference(vecA).to_matrix().to_4x4()
obj_B.matrix_world = mat_rot * mat_rot1
vec_l = v1A-obj_B.location
obj_B.location = obj_B.location+vec_l
else:
v1A = obj_A.matrix_world * v1.co
w1B = obj_B.matrix_world * w1.co
vecB = (w2.co - w1.co) * obj_B.matrix_world.to_3x3().transposed()
normal_A = getNormalPlane([v1.co, v2.co, v3.co], mathutils.Matrix())
normal_A = normal_A * obj_A.matrix_world.to_3x3().transposed()
normal_B = getNormalPlane([w1.co, w2.co, w3.co], mathutils.Matrix())
normal_B = normal_B * obj_B.matrix_world.to_3x3().transposed()
mat_rot1 = normal_B.rotation_difference(normal_A).to_matrix().to_4x4()
vecA = (v2.co - v1.co) * obj_A.matrix_world.to_3x3().transposed()
vecB = mat_rot1 * vecB
mat_rot = vecB.rotation_difference(vecA).to_matrix().to_4x4()
obj_B.matrix_world = mat_rot * mat_rot1
w1B = obj_B.matrix_world * w1.co
vec_l = v1A-w1B
obj_B.location = obj_B.location+vec_l
def mirrorside():
mode_ = bpy.context.mode
bpy.ops.object.mode_set(mode='OBJECT')
bpy.ops.object.mode_set(mode='EDIT')
config = bpy.context.window_manager.paul_manager
if config.object_name_store_v == '' or \
config.active_edge1_store < 0 or config.active_edge2_store < 0:
print_error2('Stored Vertex is required','mirrorside 01')
return False
obj_A = bpy.data.objects[config.object_name_store_v]
ve1 = obj_A.data.edges[config.active_edge1_store]
ve2 = obj_A.data.edges[config.active_edge2_store]
# получаем ещё две вершины. Иначе - реджект
connect_vs = []
connect_vs.extend(ve1.vertices[:])
connect_vs.extend(ve2.vertices[:])
v1 = -1
for v in connect_vs:
if connect_vs.count(v)>1:
v1 = obj_A.matrix_world * obj_A.data.vertices[v].co
connect_vs.pop(connect_vs.index(v))
connect_vs.pop(connect_vs.index(v))
break
if v1 == -1:
print_error2('Active vertex of object_A must have two edges', 'mirrorside 04')
return False
v2 = obj_A.matrix_world * obj_A.data.vertices[connect_vs[0]].co
v3 = obj_A.matrix_world * obj_A.data.vertices[connect_vs[1]].co
obj_B = bpy.context.scene.objects.active
normal_B = getNormalPlane([v1, v2, v3], mathutils.Matrix())
if mode_ =='EDIT_MESH':
bpy.ops.object.mode_set(mode='EDIT')
ref_vts = [v for v in obj_B.data.vertices if v.select==True]
verts = []
v_idx_B = []
for v in ref_vts:
verts.append(v.co)
v_idx_B.append(v.index)
bpy.ops.object.mode_set(mode='OBJECT')
bm = bmesh.new()
bm.from_mesh(obj_B.data)
check_lukap(bm)
vts = []
mat_inv = obj_B.matrix_world.inverted()
for pt_a_ in verts:
pt_a = obj_B.matrix_world * pt_a_
pt_b = normal_B + pt_a
cross_pt = mathutils.geometry.intersect_line_plane(pt_a, pt_b, v1, normal_B)
d_vec = cross_pt-pt_a
pt_c = cross_pt + d_vec
v_new = bm.verts.new(mat_inv*pt_c)
vts.append(v_new)
bm.verts.index_update()
check_lukap(bm)
vts_ = [v.index for v in vts]
ref_edges = [(e.vertices[0], e.vertices[1]) for e in obj_B.data.edges if e.select==True]
for e in ref_edges:
ev0 = v_idx_B.index(e[0])
ev1 = v_idx_B.index(e[1])
e = (bm.verts[vts_[ev0]], bm.verts[vts_[ev1]])
bm.edges.new(e)
check_lukap(bm)
ref_faces = [(v for v in f.vertices) for f in obj_B.data.polygons if f.select==True]
for f in ref_faces:
f_B = []
for v in f:
fv = v_idx_B.index(v)
f_B.append(bm.verts[vts_[fv]])
bm.faces.new(tuple(f_B))
bm.to_mesh(obj_B.data)
bm.free()
bpy.ops.object.mode_set(mode='EDIT')
elif mode_ =='OBJECT':
bpy.ops.object.mode_set(mode='OBJECT')
bm = bmesh.new()
bm.from_mesh(obj_B.data)
check_lukap(bm)
ref_vtert = bm.verts
mat_inv = obj_B.matrix_world.inverted()
for pt_a_ in ref_vtert:
pt_a = obj_B.matrix_world * pt_a_.co
pt_b = normal_B + pt_a
cross_pt = mathutils.geometry.intersect_line_plane(pt_a, pt_b, v1, normal_B)
d_vec = cross_pt-pt_a
pt_c = cross_pt + d_vec
ref_vtert[pt_a_.index].co = mat_inv*pt_c
name = obj_B.name+'copy'
me = bpy.data.meshes.new(name+'_Mesh')
obj_C = bpy.data.objects.new(name, me)
# Привязка объекта к сцене
bpy.context.scene.objects.link(obj_C)
bm.to_mesh(me)
me.update()
bm.free()
def getorient():
obj = bpy.context.active_object
if obj.type!='MESH':
return False
space_data = bpy.context.space_data
trans_ori = 'GLOBAL'
if hasattr(space_data,'transform_orientation'):
trans_ori = space_data.transform_orientation
bpy.ops.transform.create_orientation(name='1DTEMP', use=True, overwrite=True)
if trans_ori=='1DTEMP':
bpy.context.space_data.show_manipulator = not bpy.context.space_data.show_manipulator
else:
bpy.context.space_data.show_manipulator = True
def main_align_object(axe='X',project='XY'):
obj_res = bpy.context.active_object
if obj_res.type=='MESH':
bpy.ops.object.mode_set(mode='EDIT')
bpy.ops.object.mode_set(mode='OBJECT')
config = bpy.context.window_manager.paul_manager
if config.object_name_store == '':
print_error('Stored Edge is required')
print('Error: align 01')
return False
obj = bpy.data.objects[config.object_name_store]
mesh = obj.data
bm = bmesh.new()
bm.from_mesh(mesh)
check_lukap(bm)
# Найдём диагональ Store
edge_idx = config.edge_idx_store
verts_edge_store = bm.edges[edge_idx].verts
vec_diag_store = verts_edge_store[1].co - verts_edge_store[0].co
# Развернем объект
dict_axe = {'X':(1.0,0.0,0.0), 'Y':(0.0,1.0,0.0), 'Z':(0.0,0.0,1.0)}
aa_vec = dict_axe[axe]
aa = mathutils.Vector(aa_vec)
bb = vec_diag_store.normalized()
planes = set(project)
if 'X' not in planes:
aa.x=0
bb.x=0
if 'Y' not in planes:
aa.y=0
bb.y=0
if 'Z' not in planes:
aa.z=0
bb.z=0
vec = aa
q_rot = vec.rotation_difference(bb).to_matrix().to_4x4()
obj_res.matrix_world *= q_rot
for obj in bpy.context.scene.objects:
if obj.select:
if obj.name!=obj_res.name:
orig_tmp = obj_res.location-obj.location
mat_loc = mathutils.Matrix.Translation(orig_tmp)
mat_loc2 = mathutils.Matrix.Translation(-orig_tmp)
obj.matrix_world *= mat_loc*q_rot*mat_loc2
return
def main_align():
bpy.ops.object.mode_set(mode='OBJECT')
bpy.ops.object.mode_set(mode='EDIT')
config = bpy.context.window_manager.paul_manager
if config.object_name_store == '':
print_error('Stored Edge is required')
print('Error: align 01')
return False
obj = bpy.data.objects[config.object_name_store]
mesh = obj.data
bm = bmesh.new()
bm.from_mesh(mesh)
check_lukap(bm)
# Найдём диагональ Store