Newer
Older
# <pep8-80 compliant>
# ##### 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 #####
__author__ = "Nutti <nutti.metro@gmail.com>"
__status__ = "production"
from collections import defaultdict
from pprint import pprint
from math import fabs, sqrt
import bpy
from mathutils import Vector
import bmesh
from .utils import compatibility as compat
__DEBUG_MODE = False
def is_console_mode():
if "MUV_CONSOLE_MODE" not in os.environ:
return False
def is_debug_mode():
return __DEBUG_MODE
def enable_debugg_mode():
# pylint: disable=W0603
global __DEBUG_MODE
__DEBUG_MODE = True
def disable_debug_mode():
# pylint: disable=W0603
global __DEBUG_MODE
__DEBUG_MODE = False
def debug_print(*s):
"""
Print message to console in debugging mode
"""
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
pprint(s)
def check_version(major, minor, _):
"""
Check blender version
"""
if bpy.app.version[0] == major and bpy.app.version[1] == minor:
return 0
if bpy.app.version[0] > major:
return 1
if bpy.app.version[1] > minor:
return 1
return -1
def redraw_all_areas():
"""
Redraw all areas
"""
for area in bpy.context.screen.areas:
area.tag_redraw()
def get_space(area_type, region_type, space_type):
"""
Get current area/region/space
"""
area = None
region = None
space = None
for area in bpy.context.screen.areas:
if area.type == area_type:
break
else:
return (None, None, None)
for region in area.regions:
if region.type == region_type:
if compat.check_version(2, 80, 0) >= 0:
if region.width <= 1 or region.height <= 1:
continue
else:
return (area, None, None)
for space in area.spaces:
if space.type == space_type:
break
else:
return (area, region, None)
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
def mouse_on_region(event, area_type, region_type):
pos = Vector((event.mouse_x, event.mouse_y))
_, region, _ = get_space(area_type, region_type, "")
if region is None:
return False
if (pos.x > region.x) and (pos.x < region.x + region.width) and \
(pos.y > region.y) and (pos.y < region.y + region.height):
return True
return False
def mouse_on_area(event, area_type):
pos = Vector((event.mouse_x, event.mouse_y))
area, _, _ = get_space(area_type, "", "")
if area is None:
return False
if (pos.x > area.x) and (pos.x < area.x + area.width) and \
(pos.y > area.y) and (pos.y < area.y + area.height):
return True
return False
def mouse_on_regions(event, area_type, regions):
if not mouse_on_area(event, area_type):
return False
for region in regions:
result = mouse_on_region(event, area_type, region)
if result:
return True
return False
def create_bmesh(obj):
bm = bmesh.from_edit_mesh(obj.data)
if check_version(2, 73, 0) >= 0:
bm.faces.ensure_lookup_table()
return bm
def create_new_uv_map(obj, name=None):
uv_maps_old = {l.name for l in obj.data.uv_layers}
bpy.ops.mesh.uv_texture_add()
uv_maps_new = {l.name for l in obj.data.uv_layers}
diff = uv_maps_new - uv_maps_old
if not list(diff):
return None # no more UV maps can not be created
# rename UV map
new = obj.data.uv_layers[list(diff)[0]]
if name:
new.name = name
return new
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
def __get_island_info(uv_layer, islands):
"""
get information about each island
"""
island_info = []
for isl in islands:
info = {}
max_uv = Vector((-10000000.0, -10000000.0))
min_uv = Vector((10000000.0, 10000000.0))
ave_uv = Vector((0.0, 0.0))
num_uv = 0
for face in isl:
n = 0
a = Vector((0.0, 0.0))
ma = Vector((-10000000.0, -10000000.0))
mi = Vector((10000000.0, 10000000.0))
for l in face['face'].loops:
uv = l[uv_layer].uv
ma.x = max(uv.x, ma.x)
ma.y = max(uv.y, ma.y)
mi.x = min(uv.x, mi.x)
mi.y = min(uv.y, mi.y)
a = a + uv
n = n + 1
ave_uv = ave_uv + a
num_uv = num_uv + n
a = a / n
max_uv.x = max(ma.x, max_uv.x)
max_uv.y = max(ma.y, max_uv.y)
min_uv.x = min(mi.x, min_uv.x)
min_uv.y = min(mi.y, min_uv.y)
face['max_uv'] = ma
face['min_uv'] = mi
face['ave_uv'] = a
ave_uv = ave_uv / num_uv
info['center'] = ave_uv
info['size'] = max_uv - min_uv
info['num_uv'] = num_uv
info['group'] = -1
info['faces'] = isl
info['max'] = max_uv
info['min'] = min_uv
island_info.append(info)
return island_info
def __parse_island(bm, face_idx, faces_left, island,
face_to_verts, vert_to_faces):
"""
Parse island
"""
faces_to_parse = [face_idx]
while faces_to_parse:
fidx = faces_to_parse.pop(0)
if fidx in faces_left:
faces_left.remove(fidx)
island.append({'face': bm.faces[fidx]})
for v in face_to_verts[fidx]:
connected_faces = vert_to_faces[v]
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
def __get_island(bm, face_to_verts, vert_to_faces):
"""
Get island list
"""
uv_island_lists = []
faces_left = set(face_to_verts.keys())
while faces_left:
current_island = []
face_idx = list(faces_left)[0]
__parse_island(bm, face_idx, faces_left, current_island,
face_to_verts, vert_to_faces)
uv_island_lists.append(current_island)
return uv_island_lists
def __create_vert_face_db(faces, uv_layer):
# create mesh database for all faces
face_to_verts = defaultdict(set)
vert_to_faces = defaultdict(set)
for f in faces:
for l in f.loops:
id_ = l[uv_layer].uv.to_tuple(5), l.vert.index
face_to_verts[f.index].add(id_)
vert_to_faces[id_].add(f.index)
return (face_to_verts, vert_to_faces)
def get_island_info(obj, only_selected=True):
bm = bmesh.from_edit_mesh(obj.data)
if check_version(2, 73, 0) >= 0:
bm.faces.ensure_lookup_table()
return get_island_info_from_bmesh(bm, only_selected)
def get_island_info_from_bmesh(bm, only_selected=True):
if not bm.loops.layers.uv:
return None
uv_layer = bm.loops.layers.uv.verify()
# create database
if only_selected:
selected_faces = [f for f in bm.faces if f.select]
else:
selected_faces = [f for f in bm.faces]
return get_island_info_from_faces(bm, selected_faces, uv_layer)
def get_island_info_from_faces(bm, faces, uv_layer):
ftv, vtf = __create_vert_face_db(faces, uv_layer)
# Get island information
uv_island_lists = __get_island(bm, ftv, vtf)
island_info = __get_island_info(uv_layer, uv_island_lists)
return island_info
def get_uvimg_editor_board_size(area):
if area.spaces.active.image:
return area.spaces.active.image.size
return (255.0, 255.0)
def calc_polygon_2d_area(points):
area = 0.0
for i, p1 in enumerate(points):
p2 = points[(i + 1) % len(points)]
v1 = p1 - points[0]
v2 = p2 - points[0]
a = v1.x * v2.y - v1.y * v2.x
area = area + a
return fabs(0.5 * area)
def calc_polygon_3d_area(points):
area = 0.0
for i, p1 in enumerate(points):
p2 = points[(i + 1) % len(points)]
v1 = p1 - points[0]
v2 = p2 - points[0]
cx = v1.y * v2.z - v1.z * v2.y
cy = v1.z * v2.x - v1.x * v2.z
cz = v1.x * v2.y - v1.y * v2.x
a = sqrt(cx * cx + cy * cy + cz * cz)
area = area + a
return 0.5 * area
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
def get_faces_list(bm, method, only_selected):
faces_list = []
if method == 'MESH':
if only_selected:
faces_list.append([f for f in bm.faces if f.select])
else:
faces_list.append([f for f in bm.faces])
elif method == 'UV ISLAND':
if not bm.loops.layers.uv:
return None
uv_layer = bm.loops.layers.uv.verify()
if only_selected:
faces = [f for f in bm.faces if f.select]
islands = get_island_info_from_faces(bm, faces, uv_layer)
for isl in islands:
faces_list.append([f["face"] for f in isl["faces"]])
else:
faces = [f for f in bm.faces]
islands = get_island_info_from_faces(bm, faces, uv_layer)
for isl in islands:
faces_list.append([f["face"] for f in isl["faces"]])
elif method == 'FACE':
if only_selected:
for f in bm.faces:
if f.select:
faces_list.append([f])
else:
for f in bm.faces:
faces_list.append([f])
else:
raise ValueError("Invalid method: {}".format(method))
return faces_list
def measure_mesh_area(obj, calc_method, only_selected):
bm = bmesh.from_edit_mesh(obj.data)
if check_version(2, 73, 0) >= 0:
bm.verts.ensure_lookup_table()
bm.edges.ensure_lookup_table()
bm.faces.ensure_lookup_table()
faces_list = get_faces_list(bm, calc_method, only_selected)
areas = []
for faces in faces_list:
areas.append(measure_mesh_area_from_faces(faces))
return areas
def measure_mesh_area_from_faces(faces):
verts = [l.vert.co for l in f.loops]
f_mesh_area = calc_polygon_3d_area(verts)
mesh_area = mesh_area + f_mesh_area
return mesh_area
def find_texture_layer(bm):
if check_version(2, 80, 0) >= 0:
return None
if bm.faces.layers.tex is None:
return None
return bm.faces.layers.tex.verify()
def find_texture_nodes(obj):
nodes = []
for mat in obj.material_slots:
if not mat.material.node_tree:
continue
for node in mat.material.node_tree.nodes:
tex_node_types = [
'TEX_ENVIRONMENT',
'TEX_IMAGE',
]
if node.type not in tex_node_types:
continue
if not node.image:
continue
nodes.append(node)
return nodes
def find_image(obj, face=None, tex_layer=None):
images = find_images(obj, face, tex_layer)
if len(images) >= 2:
raise RuntimeError("Find more than 2 images")
return None
return images[0]
def find_images(obj, face=None, tex_layer=None):
images = []
# try to find from texture_layer
if tex_layer and face:
if face[tex_layer].image is not None:
images.append(face[tex_layer].image)
# not found, then try to search from node
def measure_uv_area_from_faces(obj, faces, uv_layer, tex_layer,
tex_selection_method, tex_size):
uvs = [l[uv_layer].uv for l in f.loops]
f_uv_area = calc_polygon_2d_area(uvs)
# user specified
if tex_selection_method == 'USER_SPECIFIED' and tex_size is not None:
img_size = tex_size
# first texture if there are more than 2 textures assigned
# to the object
img = find_image(obj, f, tex_layer)
# can not find from node, so we can not get texture size
if not img:
return None
img_size = img.size
# average texture size
imgs = find_images(obj, f, tex_layer)
if not imgs:
return None
img_size_total = [0.0, 0.0]
for img in imgs:
img_size_total = [img_size_total[0] + img.size[0],
img_size_total[1] + img.size[1]]
img_size = [img_size_total[0] / len(imgs),
img_size_total[1] / len(imgs)]
# max texture size
imgs = find_images(obj, f, tex_layer)
if not imgs:
return None
img_size_max = [-99999999.0, -99999999.0]
for img in imgs:
img_size_max = [max(img_size_max[0], img.size[0]),
max(img_size_max[1], img.size[1])]
img_size = img_size_max
# min texture size
imgs = find_images(obj, f, tex_layer)
if not imgs:
return None
img_size_min = [99999999.0, 99999999.0]
for img in imgs:
img_size_min = [min(img_size_min[0], img.size[0]),
min(img_size_min[1], img.size[1])]
img_size = img_size_min
else:
raise RuntimeError("Unexpected method: {}"
.format(tex_selection_method))
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
def measure_uv_area(obj, calc_method, tex_selection_method, tex_size,
only_selected):
bm = bmesh.from_edit_mesh(obj.data)
if check_version(2, 73, 0) >= 0:
bm.verts.ensure_lookup_table()
bm.edges.ensure_lookup_table()
bm.faces.ensure_lookup_table()
if not bm.loops.layers.uv:
return None
uv_layer = bm.loops.layers.uv.verify()
tex_layer = find_texture_layer(bm)
faces_list = get_faces_list(bm, calc_method, only_selected)
# measure
uv_areas = []
for faces in faces_list:
uv_area = measure_uv_area_from_faces(
obj, faces, uv_layer, tex_layer, tex_selection_method, tex_size)
if uv_area is None:
return None
uv_areas.append(uv_area)
return uv_areas
def diff_point_to_segment(a, b, p):
ab = b - a
normal_ab = ab.normalized()
ap = p - a
dist_ax = normal_ab.dot(ap)
# cross point
x = a + normal_ab * dist_ax
# difference between cross point and point
xp = p - x
return xp, x
# get selected loop pair whose loops are connected each other
def __get_loop_pairs(l, uv_layer):
pairs = []
parsed = []
loops_ready = [l]
while loops_ready:
l = loops_ready.pop(0)
parsed.append(l)
for ll in l.vert.link_loops:
# forward direction
lln = ll.link_loop_next
# if there is same pair, skip it
found = False
if (ll in p) and (lln in p):
found = True
break
# two loops must be selected
pairs.append([ll, lln])
if (lln not in parsed) and (lln not in loops_ready):
loops_ready.append(lln)
# backward direction
llp = ll.link_loop_prev
# if there is same pair, skip it
found = False
if (ll in p) and (llp in p):
found = True
break
# two loops must be selected
pairs.append([ll, llp])
if (llp not in parsed) and (llp not in loops_ready):
loops_ready.append(llp)
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
return pairs
# sort pair by vertex
# (v0, v1) - (v1, v2) - (v2, v3) ....
def __sort_loop_pairs(uv_layer, pairs, closed):
rest = pairs
sorted_pairs = [rest[0]]
rest.remove(rest[0])
# prepend
while True:
p1 = sorted_pairs[0]
for p2 in rest:
if p1[0].vert == p2[0].vert:
sorted_pairs.insert(0, [p2[1], p2[0]])
rest.remove(p2)
break
elif p1[0].vert == p2[1].vert:
sorted_pairs.insert(0, [p2[0], p2[1]])
rest.remove(p2)
break
else:
break
# append
while True:
p1 = sorted_pairs[-1]
for p2 in rest:
if p1[1].vert == p2[0].vert:
sorted_pairs.append([p2[0], p2[1]])
rest.remove(p2)
break
elif p1[1].vert == p2[1].vert:
sorted_pairs.append([p2[1], p2[0]])
rest.remove(p2)
break
else:
break
begin_vert = sorted_pairs[0][0].vert
end_vert = sorted_pairs[-1][-1].vert
if begin_vert != end_vert:
return sorted_pairs, ""
if closed and (begin_vert == end_vert):
# if the sequence of UV is circular, it is ok
return sorted_pairs, ""
# if the begin vertex and the end vertex are same, search the UVs which
# are separated each other
tmp_pairs = sorted_pairs
for i, (p1, p2) in enumerate(zip(tmp_pairs[:-1], tmp_pairs[1:])):
diff = p2[0][uv_layer].uv - p1[-1][uv_layer].uv
if diff.length > 0.000000001:
# UVs are separated
sorted_pairs = tmp_pairs[i + 1:]
sorted_pairs.extend(tmp_pairs[:i + 1])
break
else:
p1 = tmp_pairs[0]
p2 = tmp_pairs[-1]
diff = p2[-1][uv_layer].uv - p1[0][uv_layer].uv
if diff.length < 0.000000001:
# all UVs are not separated
return None, "All UVs are not separated"
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
return sorted_pairs, ""
# get index of the island group which includes loop
def __get_island_group_include_loop(loop, island_info):
for i, isl in enumerate(island_info):
for f in isl['faces']:
for l in f['face'].loops:
if l == loop:
return i # found
return -1 # not found
# get index of the island group which includes pair.
# if island group is not same between loops, it will be invalid
def __get_island_group_include_pair(pair, island_info):
l1_grp = __get_island_group_include_loop(pair[0], island_info)
if l1_grp == -1:
return -1 # not found
for p in pair[1:]:
l2_grp = __get_island_group_include_loop(p, island_info)
if (l2_grp == -1) or (l1_grp != l2_grp):
return -1 # not found or invalid
return l1_grp
# x ---- x <- next_loop_pair
# | |
# o ---- o <- pair
def __get_next_loop_pair(pair):
lp = pair[0].link_loop_prev
if lp.vert == pair[1].vert:
lp = pair[0].link_loop_next
if lp.vert == pair[1].vert:
# no loop is found
return None
ln = pair[1].link_loop_next
if ln.vert == pair[0].vert:
ln = pair[1].link_loop_prev
if ln.vert == pair[0].vert:
# no loop is found
return None
# tri-face
if lp == ln:
return [lp]
# quad-face
return [lp, ln]
# | ---- |
# % ---- % <- next_poly_loop_pair
# x ---- x <- next_loop_pair
# | |
# o ---- o <- pair
def __get_next_poly_loop_pair(pair):
v1 = pair[0].vert
v2 = pair[1].vert
for l1 in v1.link_loops:
if l1 == pair[0]:
continue
for l2 in v2.link_loops:
if l2 == pair[1]:
continue
if l1.link_loop_next == l2:
return [l1, l2]
elif l1.link_loop_prev == l2:
return [l1, l2]
# no next poly loop is found
return None
# get loop sequence in the same island
def __get_loop_sequence_internal(uv_layer, pairs, island_info, closed):
loop_sequences = []
for pair in pairs:
seqs = [pair]
p = pair
isl_grp = __get_island_group_include_pair(pair, island_info)
if isl_grp == -1:
return None, "Can not find the island or invalid island"
while True:
nlp = __get_next_loop_pair(p)
if not nlp:
break # no more loop pair
nlp_isl_grp = __get_island_group_include_pair(nlp, island_info)
if nlp_isl_grp != isl_grp:
break # another island
for nlpl in nlp:
if nlpl[uv_layer].select:
return None, "Do not select UV which does not belong to " \
"the end edge"
seqs.append(nlp)
# when face is triangle, it indicates CLOSED
if (len(nlp) == 1) and closed:
break
nplp = __get_next_poly_loop_pair(nlp)
if not nplp:
break # no more loop pair
nplp_isl_grp = __get_island_group_include_pair(nplp, island_info)
if nplp_isl_grp != isl_grp:
break # another island
# check if the UVs are already parsed.
# this check is needed for the mesh which has the circular
# sequence of the vertices
matched = False
for p1 in seqs:
p2 = nplp
if ((p1[0] == p2[0]) and (p1[1] == p2[1])) or \
((p1[0] == p2[1]) and (p1[1] == p2[0])):
matched = True
if matched:
debug_print("This is a circular sequence")
break
for nlpl in nplp:
if nlpl[uv_layer].select:
return None, "Do not select UV which does not belong to " \
"the end edge"
seqs.append(nplp)
p = nplp
loop_sequences.append(seqs)
return loop_sequences, ""
sel_faces = [f for f in bm.faces if f.select]
# get candidate loops
cand_loops = []
for f in sel_faces:
for l in f.loops:
if l[uv_layer].select:
cand_loops.append(l)
if len(cand_loops) < 2:
return None, "More than 2 UVs must be selected"
first_loop = cand_loops[0]
isl_info = get_island_info_from_bmesh(bm, False)
loop_pairs = __get_loop_pairs(first_loop, uv_layer)
loop_pairs, err = __sort_loop_pairs(uv_layer, loop_pairs, closed)
if not loop_pairs:
return None, err
loop_seqs, err = __get_loop_sequence_internal(uv_layer, loop_pairs,
if not loop_seqs:
return None, err
return loop_seqs, ""
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
def __is_segment_intersect(start1, end1, start2, end2):
seg1 = end1 - start1
seg2 = end2 - start2
a1 = -seg1.y
b1 = seg1.x
d1 = -(a1 * start1.x + b1 * start1.y)
a2 = -seg2.y
b2 = seg2.x
d2 = -(a2 * start2.x + b2 * start2.y)
seg1_line2_start = a2 * start1.x + b2 * start1.y + d2
seg1_line2_end = a2 * end1.x + b2 * end1.y + d2
seg2_line1_start = a1 * start2.x + b1 * start2.y + d1
seg2_line1_end = a1 * end2.x + b1 * end2.y + d1
if (seg1_line2_start * seg1_line2_end >= 0) or \
(seg2_line1_start * seg2_line1_end >= 0):
return False, None
u = seg1_line2_start / (seg1_line2_start - seg1_line2_end)
out = start1 + u * seg1
return True, out
class RingBuffer:
def __init__(self, arr):
self.__buffer = arr.copy()
self.__pointer = 0
def __repr__(self):
return repr(self.__buffer)
def __len__(self):
return len(self.__buffer)
def insert(self, val, offset=0):
self.__buffer.insert(self.__pointer + offset, val)
def head(self):
return self.__buffer[0]
def tail(self):
return self.__buffer[-1]
def get(self, offset=0):
size = len(self.__buffer)
val = self.__buffer[(self.__pointer + offset) % size]
return val
def next(self):
size = len(self.__buffer)
self.__pointer = (self.__pointer + 1) % size
def reset(self):
self.__pointer = 0
def find(self, obj):
try:
idx = self.__buffer.index(obj)
except ValueError:
return None
return self.__buffer[idx]
def find_and_next(self, obj):
size = len(self.__buffer)
idx = self.__buffer.index(obj)
self.__pointer = (idx + 1) % size
def find_and_set(self, obj):
idx = self.__buffer.index(obj)
self.__pointer = idx
def as_list(self):
return self.__buffer.copy()
def reverse(self):
self.__buffer.reverse()
self.reset()
# clip: reference polygon
# subject: tested polygon
def __do_weiler_atherton_cliping(clip_uvs, subject_uvs, mode):
if __is_polygon_flipped(clip_uvs):
clip_uvs.reverse()
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
if __is_polygon_flipped(subject_uvs):
subject_uvs.reverse()
debug_print("===== Clip UV List =====")
debug_print(clip_uvs)
debug_print("===== Subject UV List =====")
debug_print(subject_uvs)
# check if clip and subject is overlapped completely
if __is_polygon_same(clip_uvs, subject_uvs):
polygons = [subject_uvs.as_list()]
debug_print("===== Polygons Overlapped Completely =====")
debug_print(polygons)
return True, polygons
# check if subject is in clip
if __is_points_in_polygon(subject_uvs, clip_uvs):
polygons = [subject_uvs.as_list()]
return True, polygons
# check if clip is in subject
if __is_points_in_polygon(clip_uvs, subject_uvs):
polygons = [subject_uvs.as_list()]
return True, polygons
# check if clip and subject is overlapped partially
intersections = []
while True:
subject_uvs.reset()
while True:
uv_start1 = clip_uvs.get()
uv_end1 = clip_uvs.get(1)
uv_start2 = subject_uvs.get()
uv_end2 = subject_uvs.get(1)
intersected, point = __is_segment_intersect(uv_start1, uv_end1,
uv_start2, uv_end2)
if intersected:
clip_uvs.insert(point, 1)
subject_uvs.insert(point, 1)
intersections.append([point,
[clip_uvs.get(), clip_uvs.get(1)]])
subject_uvs.next()
if subject_uvs.get() == subject_uvs.head():
break
clip_uvs.next()
if clip_uvs.get() == clip_uvs.head():
break
debug_print("===== Intersection List =====")
debug_print(intersections)
# no intersection, so subject and clip is not overlapped
if not intersections:
return False, None
def get_intersection_pair(intersects, key):
for sect in intersects:
if sect[0] == key:
return sect[1]
return None