blender/io_mspgl/mesh.py

   1 import bpy
   2 import math
   3 import mathutils
   4
   5 def make_edge_key(i1, i2):
   6         return (min(i1, i2), max(i1, i2))
   7
   8 class Edge:
   9         def __init__(self, edge):
  10                 if edge.__class__==Edge:
  11                         self._edge = edge._edge
  12                         self.smooth = edge.smooth
  13                 else:
  14                         self._edge = edge
  15                         self.smooth = False
  16                 if edge:
  17                         self.vertices = edge.vertices[:]
  18                         self.key = edge.key
  19                 else:
  20                         self.vertices = []
  21                         self.key = None
  22                 self.faces = []
  23
  24         def __getattr__(self, attr):
  25                 return getattr(self._edge, attr)
  26
  27         def check_smooth(self, limit):
  28                 if len(self.faces)!=2:
  29                         return
  30
  31                 d = self.faces[0].normal.dot(self.faces[1].normal)
  32                 self.smooth = ((d>limit and self.faces[0].use_smooth and self.faces[1].use_smooth) or d>0.99995)
  33
  34         def other_face(self, f):
  35                 if f.index==self.faces[0].index:
  36                         if len(self.faces)>=2:
  37                                 return self.faces[1]
  38                         else:
  39                                 return None
  40                 else:
  41                         return self.faces[0]
  42
  43         def other_vertex(self, v):
  44                 if v.index==self.vertices[0].index:
  45                         return self.vertices[1]
  46                 else:
  47                         return self.vertices[0]
  48
  49
  50 class Vertex:
  51         def __init__(self, vertex):
  52                 if vertex.__class__==Vertex:
  53                         self._vertex = vertex._vertex
  54                         self.uvs = vertex.uvs[:]
  55                         self.tan = vertex.tan
  56                         self.bino = vertex.bino
  57                 else:
  58                         self._vertex = vertex
  59                         self.uvs = []
  60                         self.tan = None
  61                         self.bino = None
  62                 self.index = vertex.index
  63                 self.co = vertex.co
  64                 self.normal = vertex.normal
  65                 self.flag = False
  66                 self.edges = []
  67                 self.faces = []
  68                 self.groups = vertex.groups[:]
  69
  70         def __getattr__(self, attr):
  71                 return getattr(self._vertex, attr)
  72
  73         def __cmp__(self, other):
  74                 if other is None:
  75                         return 1
  76                 return cmp(self.index, other.index)
  77
  78
  79 class VertexGroup:
  80         def __init__(self, group):
  81                 self._group = group
  82                 self.group = group.group
  83                 self.weight = group.weight
  84
  85         def __getattr__(self, attr):
  86                 return getattr(self._group, attr)
  87
  88
  89 class Face:
  90         def __init__(self, face):
  91                 self._face = face
  92                 self.index = face.index
  93                 self.edges = []
  94                 self.vertices = face.vertices[:]
  95                 self.uvs = []
  96                 self.flag = False
  97
  98         def __getattr__(self, attr):
  99                 return getattr(self._face, attr)
 100
 101         def __cmp__(self, other):
 102                 if other is None:
 103                         return 1
 104                 return cmp(self.index, other.index)
 105
 106         def pivot_vertex(self, v):
 107                 n = self.vertices.index(v)
 108                 return [(n+i)%len(self.vertices) for i in range(len(self.vertices))]
 109
 110         def pivot_vertices(self, *vt):
 111                 flags = [(v in vt) for v in self.vertices]
 112                 l = len(self.vertices)
 113                 for i in range(l):
 114                         if flags[i] and not flags[(i+l-1)%l]:
 115                                 return self.vertices[i:]+self.vertices[:i]
 116
 117         def get_edge(self, v1, v2):
 118                 key = make_edge_key(v1.index, v2.index)
 119                 for e in self.edges:
 120                         if e.key==key:
 121                                 return e
 122                 raise KeyError("No edge %s"%(key,))
 123
 124         def other_edge(self, e, v):
 125                 for d in self.edges:
 126                         if d!=e and v in d.vertices:
 127                                 return d
 128
 129         def get_neighbors(self):
 130                 neighbors = [e.other_face(self) for e in self.edges]
 131                 return list(filter(bool, neighbors))
 132
 133
 134 class Line:
 135         def __init__(self, e):
 136                 self.edge = e
 137                 self.vertices = e.vertices[:]
 138                 self.flag = False
 139
 140
 141 class UvLayer:
 142         def __init__(self, arg):
 143                 if type(arg)==str:
 144                         self._layer = None
 145                         self.name = arg
 146                         self.uvs = []
 147                 else:
 148                         self._layer = arg
 149                         self.name = arg.name
 150                         self.uvs = [d.uv for d in self.data]
 151
 152                 self.unit = None
 153                 self.hidden = False
 154
 155                 dot = self.name.find('.')
 156                 if dot>=0:
 157                         ext = self.name[dot:]
 158                         if ext.startswith(".unit") and ext[5:].isdigit():
 159                                 self.unit = int(ext[5:])
 160                         elif ext==".hidden":
 161                                 self.hidden = True
 162
 163         def __getattr__(self, attr):
 164                 return getattr(self._layer, attr)
 165
 166
 167 class Mesh:
 168         def __init__(self, mesh):
 169                 self._mesh = mesh
 170
 171                 self.winding_test = mesh.winding_test
 172                 self.tbn_vecs = mesh.tbn_vecs
 173                 self.vertex_groups = mesh.vertex_groups
 174
 175                 # Clone basic data
 176                 self.vertices = [Vertex(v) for v in mesh.vertices]
 177                 for v in self.vertices:
 178                         v.groups = [VertexGroup(g) for g in v.groups]
 179
 180                 self.faces = [Face(f) for f in mesh.polygons]
 181                 self.edges = [Edge(e) for e in mesh.edges]
 182                 self.loops = mesh.loops[:]
 183                 self.materials = mesh.materials[:]
 184
 185                 # Clone only the desired UV layers
 186                 if self.use_uv=='NONE' or not mesh.uv_layers:
 187                         self.uv_layers = []
 188                 else:
 189                         self.uv_layers = [UvLayer(u) for u in mesh.uv_layers]
 190                         self.uv_layers = sorted([u for u in self.uv_layers if not u.hidden], key=(lambda u: (u.unit or 1000, u.name)))
 191
 192                         if self.use_uv=='UNIT0':
 193                                 self.uv_layers = [self.uv_layers[0]]
 194
 195                         # Assign texture unit numbers to UV layers that lack one
 196                         next_unit = max((u.unit+1 for u in self.uv_layers if u.unit is not None), default=0)
 197                         for u in self.uv_layers:
 198                                 if not u.unit:
 199                                         u.unit = next_unit
 200                                         next_unit += 1
 201
 202                 # Rewrite links between elements to point to cloned data, or create links
 203                 # where they don't exist
 204                 edge_map = {e.key: e for e in self.edges}
 205                 for f in self.faces:
 206                         if len(f.vertices)>4:
 207                                 raise ValueError("Ngons are not supported")
 208
 209                         f.vertices = [self.vertices[i] for i in f.vertices]
 210                         for v in f.vertices:
 211                                 v.faces.append(f)
 212
 213                         for k in f.edge_keys:
 214                                 e = edge_map[k]
 215                                 e.faces.append(f)
 216                                 f.edges.append(e)
 217
 218                 for e in self.edges:
 219                         e.vertices = [self.vertices[i] for i in e.vertices]
 220                         for v in e.vertices:
 221                                 v.edges.append(e)
 222
 223                 # Store loose edges as lines
 224                 if self.use_lines:
 225                         self.lines = [Line(e) for e in self.edges if not e.faces]
 226                 else:
 227                         self.lines = []
 228
 229                 self.vertex_sequence = []
 230
 231         def __getattr__(self, attr):
 232                 return getattr(self._mesh, attr)
 233
 234         def transform(self, matrix):
 235                 for v in self.vertices:
 236                         v.co = matrix*v.co
 237
 238         def splice(self, other):
 239                 if len(self.uv_layers)!=len(other.uv_layers):
 240                         raise ValueError("Meshes have incompatible UV layers")
 241                 for i, u in enumerate(self.uv_layers):
 242                         if u.name!=other.uv_layers[i].name:
 243                                 raise ValueError("Meshes have incompatible UV layers")
 244
 245                 # Merge materials and form a lookup from source material indices to the
 246                 # merged material list
 247                 material_map = []
 248                 for m in other.materials:
 249                         if m in self.materials:
 250                                 material_map.append(self.materials.index(m))
 251                         else:
 252                                 material_map.append(len(self.materials))
 253                                 self.materials.append(m)
 254
 255                 # Append data and adjust indices where necessary.  Since the data is
 256                 # spliced from the source mesh, rebuilding references is not necessary.
 257                 for i, u in enumerate(self.uv_layers):
 258                         u.uvs += other.uv_layers[i].uvs
 259
 260                 offset = len(self.vertices)
 261                 self.vertices += other.vertices
 262                 for v in self.vertices[offset:]:
 263                         v.index += offset
 264
 265                 loop_offset = len(self.loops)
 266                 self.loops += other.loops
 267
 268                 offset = len(self.faces)
 269                 self.faces += other.faces
 270                 for f in self.faces[offset:]:
 271                         f.index += offset
 272                         f.loop_start += loop_offset
 273                         f.loop_indices = range(f.loop_start, f.loop_start+f.loop_total)
 274                         if other.materials:
 275                                 f.material_index = material_map[f.material_index]
 276
 277                 offset = len(self.edges)
 278                 self.edges += other.edges
 279                 for e in self.edges[offset:]:
 280                         e.index += offset
 281                         e.key = make_edge_key(e.vertices[0].index, e.vertices[1].index)
 282
 283                 self.lines += other.lines
 284
 285         def prepare_triangles(self, progress):
 286                 face_count = len(self.faces)
 287                 for i in range(face_count):
 288                         f = self.faces[i]
 289                         nverts = len(f.vertices)
 290                         if nverts==3:
 291                                 continue
 292
 293                         # Calculate normals at each vertex of the face
 294                         edge_vecs = []
 295                         for j in range(nverts):
 296                                 edge_vecs.append(f.vertices[(j+1)%nverts].co-f.vertices[j].co)
 297
 298                         normals = []
 299                         for j in range(nverts):
 300                                 normals.append(edge_vecs[j-1].cross(edge_vecs[j]).normalized())
 301
 302                         # Check which diagonal results in a flatter triangulation
 303                         flatness1 = normals[0].dot(normals[2])
 304                         flatness2 = normals[1].dot(normals[3])
 305                         cut_index = 1 if flatness1>flatness2 else 0
 306
 307                         nf = Face(f)
 308                         nf.index = len(self.faces)
 309                         self.faces.append(nf)
 310
 311                         ne = Edge(None)
 312                         ne.index = len(self.edges)
 313                         self.edges.append(ne)
 314
 315                         nf.vertices = [f.vertices[cut_index], f.vertices[2], f.vertices[3]]
 316                         nf.loop_indices = [f.loop_indices[cut_index], f.loop_indices[2], f.loop_indices[3]]
 317                         for v in nf.vertices:
 318                                 v.faces.append(nf)
 319
 320                         ne.vertices = [f.vertices[cut_index], f.vertices[2+cut_index]]
 321                         for v in ne.vertices:
 322                                 v.edges.append(ne)
 323                         ne.key = make_edge_key(ne.vertices[0].index, ne.vertices[1].index)
 324                         ne.smooth = True
 325
 326                         f.vertices[3-cut_index].faces.remove(f)
 327                         del f.vertices[3-cut_index]
 328                         f.loop_indices = [f.loop_indices[0], f.loop_indices[1], f.loop_indices[2+cut_index]]
 329
 330                         ne.faces = [f, nf]
 331                         if cut_index==0:
 332                                 nf.edges = [ne, f.edges[2], f.edges[3]]
 333                                 f.edges = [f.edges[0], f.edges[1], ne]
 334                         else:
 335                                 nf.edges = [f.edges[1], f.edges[2], ne]
 336                                 f.edges = [f.edges[0], ne, f.edges[3]]
 337                         for e in nf.edges:
 338                                 if e!=ne:
 339                                         e.faces.remove(f)
 340                                         e.faces.append(nf)
 341
 342                         f.normal = normals[1-cut_index]
 343                         nf.normal = normals[3-cut_index]
 344
 345                         progress.set_progress(i/face_count)
 346
 347         def prepare_smoothing(self, progress):
 348                 smooth_limit = -1
 349                 if self.smoothing=='NONE':
 350                         for f in self.faces:
 351                                 f.use_smooth = False
 352
 353                         smooth_limit = 1
 354                 elif self.use_auto_smooth:
 355                         smooth_limit = math.cos(self.auto_smooth_angle)
 356
 357                 for e in self.edges:
 358                         e.check_smooth(smooth_limit)
 359
 360                 progress.push_task("Sharp edges", 0.0, 0.7)
 361                 self.split_vertices(self.find_smooth_group, progress)
 362
 363                 if self.smoothing!='BLENDER':
 364                         progress.set_task("Updating normals", 0.7, 1.0)
 365                         self.compute_normals(progress)
 366
 367                 progress.pop_task()
 368
 369         def prepare_vertex_groups(self, obj):
 370                 for v in self.vertices:
 371                         if v.groups:
 372                                 weight_sum = sum(g.weight for g in v.groups)
 373                                 v.groups = sorted(v.groups, key=(lambda g: g.weight), reverse=True)[:self.max_groups_per_vertex]
 374                                 weight_scale = weight_sum/sum(g.weight for g in v.groups)
 375                                 for g in v.groups:
 376                                         g.weight *= weight_scale
 377
 378                 if obj.parent and obj.parent.type=="ARMATURE":
 379                         armature = obj.parent.data
 380                         bone_indices = {b.name: i for i, b in enumerate(armature.bones)}
 381                         group_index_map = {i: i for i in range(len(obj.vertex_groups))}
 382                         for g in first_obj.vertex_groups:
 383                                 if g.name in bone_indices:
 384                                         group_index_map[g.index] = bone_indices[g.name]
 385
 386                         for v in self.vertices:
 387                                 for g in v.groups:
 388                                         g.group = group_index_map[g.group]
 389
 390         def prepare_uv(self, progress):
 391                 # Form a list of UV layers referenced by materials with the array atlas
 392                 # property set
 393                 array_uv_layers = [t.uv_layer for m in self.materials if m.array_atlas for t in m.texture_slots if t and t.texture_coords=='UV']
 394                 array_uv_layers = [u for u in self.uv_layers if u.name in array_uv_layers]
 395
 396                 if array_uv_layers:
 397                         for f in self.faces:
 398                                 layer = 0
 399                                 if f.material_index<len(self.materials):
 400                                         mat = self.materials[f.material_index]
 401                                         if mat and mat.array_atlas:
 402                                                 layer = mat.array_layer
 403
 404                                 for l in array_uv_layers:
 405                                         for i in f.loop_indices:
 406                                                 l.uvs[i] = mathutils.Vector((*l.uvs[i], layer))
 407
 408                 # Copy UVs from layers to faces
 409                 for f in self.faces:
 410                         for u in self.uv_layers:
 411                                 f.uvs.append([u.uvs[i] for i in f.loop_indices])
 412
 413                 prog_count = len(self.uv_layers)
 414                 prog_step = 0
 415
 416                 # Split by the UV layer used for TBN vectors first so connectivity
 417                 # remains intact for TBN vector computation
 418                 tbn_layer_index = -1
 419                 if self.tbn_vecs:
 420                         uv_names = [u.name for u in self.uv_layers]
 421                         if self.tbn_uvtex in uv_names:
 422                                 prog_count += 1
 423                                 tbn_layer_index = uv_names.index(self.tbn_uvtex)
 424                                 progress.push_task_slice("Computing TBN", 0, prog_count)
 425                                 self.split_vertices(self.find_uv_group, progress, tbn_layer_index)
 426                                 progress.set_task_slice(self.tbn_uvtex, 1, prog_count)
 427                                 self.compute_tbn(tbn_layer_index, progress)
 428                                 progress.pop_task()
 429                                 prog_step = 2
 430
 431                 # Split by the remaining UV layers
 432                 for i, u in enumerate(self.uv_layers):
 433                         if i==tbn_layer_index:
 434                                 continue
 435
 436                         progress.push_task_slice(u.name, prog_step, prog_count)
 437                         self.split_vertices(self.find_uv_group, progress, i)
 438                         progress.pop_task()
 439                         prog_step += 1
 440
 441                 # Copy UVs from faces to vertices
 442                 for v in self.vertices:
 443                         if v.faces:
 444                                 # All faces still connected to the vertex have the same UV value
 445                                 f = v.faces[0]
 446                                 i = f.vertices.index(v)
 447                                 v.uvs = [u[i] for u in f.uvs]
 448                         else:
 449                                 v.uvs = [(0.0, 0.0)]*len(self.uv_layers)
 450
 451         def split_vertices(self, find_group_func, progress, *args):
 452                 vertex_count = len(self.vertices)
 453                 for i in range(vertex_count):
 454                         v = self.vertices[i]
 455                         for f in v.faces:
 456                                 f.flag = False
 457
 458                         # Find all groups of faces on this vertex
 459                         groups = []
 460                         for f in v.faces:
 461                                 if not f.flag:
 462                                         groups.append(find_group_func(v, f, *args))
 463
 464                         # Give groups after the first separate copies of the vertex
 465                         for g in groups[1:]:
 466                                 nv = Vertex(v)
 467                                 nv.index = len(self.vertices)
 468                                 self.vertices.append(nv)
 469
 470                                 for e in v.edges:
 471                                         e_faces_in_g = [f for f in e.faces if f in g]
 472                                         if not e_faces_in_g:
 473                                                 continue
 474
 475                                         if len(e_faces_in_g)<len(e.faces):
 476                                                 # Create a copy of an edge at the boundary of the group
 477                                                 ne = Edge(e)
 478                                                 ne.index = len(self.edges)
 479                                                 self.edges.append(ne)
 480
 481                                                 ne.other_vertex(v).edges.append(ne)
 482
 483                                                 for f in e_faces_in_g:
 484                                                         e.faces.remove(f)
 485                                                         f.edges[f.edges.index(e)] = ne
 486                                                         ne.faces.append(f)
 487
 488                                                 e = ne
 489
 490                                         e.vertices[e.vertices.index(v)] = nv
 491                                         nv.edges.append(e)
 492
 493                                         e.key = make_edge_key(e.vertices[0].index, e.vertices[1].index)
 494
 495                                 # Filter out any edges that were removed from the original vertex
 496                                 v.edges = [e for e in v.edges if v in e.vertices]
 497
 498                                 for f in g:
 499                                         v.faces.remove(f)
 500                                         f.vertices[f.vertices.index(v)] = nv
 501                                         nv.faces.append(f)
 502
 503                         progress.set_progress(i/vertex_count)
 504
 505         def find_smooth_group(self, vertex, face):
 506                 face.flag = True
 507
 508                 edges = [e for e in face.edges if vertex in e.vertices]
 509
 510                 group = [face]
 511                 for e in edges:
 512                         f = face
 513                         while e.smooth:
 514                                 f = e.other_face(f)
 515                                 if not f or f.flag:
 516                                         break
 517
 518                                 f.flag = True
 519                                 group.append(f)
 520                                 e = f.other_edge(e, vertex)
 521
 522                 return group
 523
 524         def find_uv_group(self, vertex, face, index):
 525                 uv = face.uvs[index][face.vertices.index(vertex)]
 526                 face.flag = True
 527
 528                 group = [face]
 529                 for f in vertex.faces:
 530                         if not f.flag and f.uvs[index][f.vertices.index(vertex)]==uv:
 531                                 f.flag = True
 532                                 group.append(f)
 533
 534                 return group
 535
 536         def compute_normals(self, progress):
 537                 for i, v in enumerate(self.vertices):
 538                         v.normal = mathutils.Vector()
 539                         for f in v.faces:
 540                                 fv = f.pivot_vertices(v)
 541                                 edge1 = fv[1].co-fv[0].co
 542                                 edge2 = fv[-1].co-fv[0].co
 543                                 if edge1.length and edge2.length:
 544                                         # Use the angle between edges as a weighting factor.  This gives
 545                                         # more consistent normals on bends with an inequal number of
 546                                         # faces on each side.
 547                                         v.normal += f.normal*edge1.angle(edge2)
 548
 549                         if v.normal.length:
 550                                 v.normal.normalize()
 551                         else:
 552                                 v.normal = mathutils.Vector((0, 0, 1))
 553
 554                         progress.set_progress(i/len(self.vertices))
 555
 556         def compute_tbn(self, index, progress):
 557                 # This function is called at an early stage during UV preparation when
 558                 # face UVs are not available yet
 559                 layer_uvs = self.uv_layers[index].uvs
 560
 561                 for i, v in enumerate(self.vertices):
 562                         v.tan = mathutils.Vector()
 563                         v.bino = mathutils.Vector()
 564                         for f in v.faces:
 565                                 vi = f.pivot_vertex(v)
 566                                 uv0 = layer_uvs[f.loop_indices[vi[0]]]
 567                                 uv1 = layer_uvs[f.loop_indices[vi[1]]]
 568                                 uv2 = layer_uvs[f.loop_indices[vi[-1]]]
 569                                 du1 = uv1[0]-uv0[0]
 570                                 du2 = uv2[0]-uv0[0]
 571                                 dv1 = uv1[1]-uv0[1]
 572                                 dv2 = uv2[1]-uv0[1]
 573                                 edge1 = f.vertices[vi[1]].co-f.vertices[vi[0]].co
 574                                 edge2 = f.vertices[vi[-1]].co-f.vertices[vi[0]].co
 575                                 div = (du1*dv2-du2*dv1)
 576                                 if div:
 577                                         mul = edge1.angle(edge2)/div
 578                                         v.tan += (edge1*dv2-edge2*dv1)*mul
 579                                         v.bino += (edge2*du1-edge1*du2)*mul
 580
 581                         if v.tan.length:
 582                                 v.tan.normalize()
 583                         if v.bino.length:
 584                                 v.bino.normalize()
 585
 586                         progress.set_progress(i/len(self.vertices))
 587
 588         def prepare_sequence(self, progress):
 589                 progress.push_task("Reordering faces", 0.0, 0.5)
 590                 self.reorder_faces(progress)
 591
 592                 progress.set_task("Building sequence", 0.5, 1.0)
 593                 sequence = None
 594                 for i, f in enumerate(self.faces):
 595                         if sequence:
 596                                 if len(sequence)==3:
 597                                         # Rotate the first three vertices so that the new face can be added
 598                                         if sequence[0] in f.vertices and sequence[1] not in f.vertices:
 599                                                 sequence.append(sequence[0])
 600                                                 del sequence[0]
 601                                         elif sequence[2] not in f.vertices and sequence[1] in f.vertices:
 602                                                 sequence.insert(0, sequence[-1])
 603                                                 del sequence[-1]
 604
 605                                 if sequence[-1] not in f.vertices:
 606                                         sequence = None
 607                                 else:
 608                                         to_add = [v for v in f.vertices if v!=sequence[-1] and v!=sequence[-2]]
 609                                         if len(to_add)==2:
 610                                                 if (f.vertices[1]==sequence[-1]) != (len(sequence)%2==1):
 611                                                         to_add.reverse()
 612                                                 sequence.append(sequence[-1])
 613                                         sequence += to_add
 614
 615                         if not sequence:
 616                                 sequence = f.vertices[:]
 617                                 self.vertex_sequence.append(sequence)
 618
 619                         progress.set_progress(i/len(self.faces))
 620
 621                 progress.pop_task()
 622
 623                 self.reorder_vertices()
 624
 625         def reorder_faces(self, progress):
 626                 # Tom Forsyth's vertex cache optimization algorithm
 627                 # http://eelpi.gotdns.org/papers/fast_vert_cache_opt.html
 628
 629                 for f in self.faces:
 630                         f.flag = False
 631
 632                 last_triangle_score = 0.75
 633                 cache_decay_power = 1.5
 634                 valence_boost_scale = 2.0
 635                 valence_boost_power = -0.5
 636
 637                 max_cache_size = 32
 638                 cached_vertices = []
 639
 640                 # Keep track of the score and number of unused faces for each vertex
 641                 vertex_info = [[0, len(v.faces)] for v in self.vertices]
 642                 for vi in vertex_info:
 643                         vi[0] = valence_boost_scale*(vi[1]**valence_boost_power)
 644
 645                 face = None
 646                 reordered_faces = []
 647
 648                 n_processed = 0
 649                 while 1:
 650                         if not face:
 651                                 # Previous iteration gave no candidate for best face (or this is
 652                                 # the first iteration).  Scan all faces for the highest score.
 653                                 best_score = 0
 654                                 for f in self.faces:
 655                                         if f.flag:
 656                                                 continue
 657
 658                                         score = sum(vertex_info[v.index][0] for v in f.vertices)
 659                                         if score>best_score:
 660                                                 best_score = score
 661                                                 face = f
 662
 663                         if not face:
 664                                 break
 665
 666                         reordered_faces.append(face)
 667                         face.flag = True
 668
 669                         for v in face.vertices:
 670                                 vertex_info[v.index][1] -= 1
 671
 672                                 # Shuffle the vertex into the front of the cache
 673                                 if v in cached_vertices:
 674                                         cached_vertices.remove(v)
 675                                 cached_vertices.insert(0, v)
 676
 677                         # Update scores for all vertices in the cache
 678                         for i, v in enumerate(cached_vertices):
 679                                 score = 0
 680                                 if i<3:
 681                                         score += last_triangle_score
 682                                 elif i<max_cache_size:
 683                                         score += (1-(i-3)/(max_cache_size-3))**cache_decay_power
 684                                 if vertex_info[v.index][1]:
 685                                         score += valence_boost_scale*(vertex_info[v.index][1]**valence_boost_power)
 686                                 vertex_info[v.index][0] = score
 687
 688                         face = None
 689                         best_score = 0
 690                         for v in cached_vertices:
 691                                 for f in v.faces:
 692                                         if not f.flag:
 693                                                 score = sum(vertex_info[fv.index][0] for fv in f.vertices)
 694                                                 if score>best_score:
 695                                                         best_score = score
 696                                                         face = f
 697
 698                         del cached_vertices[max_cache_size:]
 699
 700                         n_processed += 1
 701                         progress.set_progress(n_processed/len(self.faces))
 702
 703                 self.faces = reordered_faces
 704                 for i, f in enumerate(self.faces):
 705                         f.index = i
 706
 707         def reorder_vertices(self):
 708                 for v in self.vertices:
 709                         v.index = -1
 710
 711                 reordered_vertices = []
 712                 for s in self.vertex_sequence:
 713                         for v in s:
 714                                 if v.index<0:
 715                                         v.index = len(reordered_vertices)
 716                                         reordered_vertices.append(v)
 717
 718                 self.vertices = reordered_vertices
 719
 720                 for e in self.edges:
 721                         e.key = make_edge_key(e.vertices[0].index, e.vertices[1].index)
 722
 723         def drop_references(self):
 724                 for v in self.vertices:
 725                         v._vertex = None
 726                         for g in v.groups:
 727                                 g._group = None
 728                 for e in self.edges:
 729                         e._edge = None
 730                 for f in self.faces:
 731                         f._face = None
 732                 for u in self.uv_layers:
 733                         u._layer = None
 734                 self._mesh = None
 735
 736
 737 def create_mesh_from_object(context, obj, progress):
 738         if obj.type!="MESH":
 739                 raise Exception("Object is not a mesh")
 740
 741         progress.push_task("Preparing mesh", 0.0, 0.2)
 742
 743         objs = [(obj, mathutils.Matrix())]
 744         i = 0
 745         while i<len(objs):
 746                 o, m = objs[i]
 747                 i += 1
 748                 for c in o.children:
 749                         if c.type=="MESH" and c.compound:
 750                                 objs.append((c, m*c.matrix_local))
 751
 752         mesh = None
 753         bmeshes = []
 754         for o, m in objs:
 755                 bmesh = o.to_mesh(context.scene, True, "PREVIEW")
 756                 bmeshes.append(bmesh)
 757
 758                 # Object.to_mesh does not copy custom properties
 759                 bmesh.winding_test = o.data.winding_test
 760                 bmesh.smoothing = o.data.smoothing
 761                 bmesh.use_lines = o.data.use_lines
 762                 bmesh.vertex_groups = o.data.vertex_groups
 763                 bmesh.max_groups_per_vertex = o.data.max_groups_per_vertex
 764                 bmesh.use_uv = o.data.use_uv
 765                 bmesh.tbn_vecs = o.data.tbn_vecs
 766                 bmesh.tbn_uvtex = o.data.tbn_uvtex
 767
 768                 me = Mesh(bmesh)
 769                 me.transform(m)
 770
 771                 if mesh:
 772                         mesh.splice(me)
 773                 else:
 774                         mesh = me
 775
 776         progress.set_task("Triangulating", 0.2, 0.3)
 777         mesh.prepare_triangles(progress)
 778         progress.set_task("Smoothing", 0.3, 0.5)
 779         mesh.prepare_smoothing(progress)
 780         progress.set_task("Vertex groups", 0.5, 0.6)
 781         mesh.prepare_vertex_groups(obj)
 782         progress.set_task("Preparing UVs", 0.6, 0.8)
 783         mesh.prepare_uv(progress)
 784         progress.set_task("Render sequence", 0.8, 1.0)
 785         mesh.prepare_sequence(progress)
 786
 787         # Discard the temporary Blender meshes after making sure there's no
 788         # references to the data
 789         mesh.drop_references()
 790         for m in bmeshes:
 791                 bpy.data.meshes.remove(m)
 792
 793         progress.pop_task()
 794
 795         return mesh