+ f.verts[i] = self.verts[f.verts[i].index]
+ f.verts[i].faces.append(f)
+
+ self.edges = dict([(e.key, Edge(e)) for e in m.edges])
+ for f in self.faces:
+ for k in f.edge_keys:
+ e = self.edges[k]
+ e.faces.append(self.faces[f.index])
+ f.edges.append(e)
+
+ self.lines = [Line(e) for e in self.edges.itervalues() if not e.faces]
+
+ if m.mode&Blender.Mesh.Modes.AUTOSMOOTH:
+ smooth_limit = math.cos(m.degr*math.pi/180)
+ else:
+ smooth_limit = -1
+ for e in self.edges.itervalues():
+ e.v1 = self.verts[e.v1.index]
+ e.v2 = self.verts[e.v2.index]
+ e.check_smooth(smooth_limit)
+
+ def __getattr__(self, attr):
+ return getattr(self._mesh, attr)
+
+ def split_vertices(self, find_group_func, debug):
+ groups = []
+ for v in self.verts:
+ for f in v.faces:
+ f.flag = False
+
+ vg = []
+ for f in v.faces:
+ if not f.flag:
+ vg.append(find_group_func(v, f))
+
+ groups.append(vg)
+
+ for i in range(len(self.verts)):
+ if len(groups[i])==1:
+ continue
+
+ if debug:
+ print "Vertex %s has %d groups"%(self.verts[i], len(groups[i]))
+
+ for g in groups[i][1:]:
+ v = Vertex(self.verts[i])
+ v.index = len(self.verts)
+ self.verts.append(v)
+
+ if debug:
+ print " -> %d %s"%(v.index, [f.index for f in g])
+
+ for f in g:
+ for j in range(len(f.edges)):
+ e = f.edges[j]
+
+ if e.v1!=self.verts[i] and e.v2!=self.verts[i]:
+ continue
+
+ if debug:
+ print " Splitting edge %s with faces %s"%(e.key, e.faces)
+
+ if e.other_face(f) not in g and len(e.faces)>=2:
+ k = e.faces.index(f)
+ e.faces.remove(f)
+ e = Edge(e)
+ f.edges[j] = e
+ e.faces.append(f)
+ else:
+ del self.edges[e.key]
+
+ if e.v1==self.verts[i]:
+ e.v1 = v
+ elif e.v2==self.verts[i]:
+ e.v2 = v
+
+ e.key = make_edge_key(e.v1.index, e.v2.index)
+ self.edges[e.key] = e
+
+ self.verts[i].faces.remove(f)
+ f.verts[f.verts.index(self.verts[i])] = v
+ v.faces.append(f)
+
+ def split_smooth(self, debug = False):
+ self.split_vertices(self.find_smooth_group, debug)
+
+ def split_uv(self, debug = False):
+ self.split_vertices(self.find_uv_group, debug)
+
+ def find_smooth_group(self, vert, face):
+ face.flag = True
+ queue = [face]
+
+ for f in queue:
+ for e in f.edges:
+ other = e.other_face(f)
+ #if not other or other.index not in face_indices:
+ if other not in vert.faces:
+ continue
+
+ if e.smooth:
+ if not other.flag:
+ other.flag = True
+ queue.append(other)
+
+ return queue
+
+ def find_uv_group(self, vert, face):
+ uv = face.uv[face.verts.index(vert)]
+ face.flag = True
+ group = [face]
+ for f in vert.faces:
+ if not f.flag and f.uv[f.verts.index(vert)]==uv:
+ f.flag = True
+ group.append(f)
+ return group
+
+ def compute_normals(self):
+ for v in self.verts:
+ if v.faces:
+ v.no = Blender.Mathutils.Vector()
+ for f in v.faces:
+ v.no += f.no
+ v.no.normalize()
+ else:
+ # XXX Should use edges to compute normal
+ v.no = Blender.Mathutils.Vector(0, 0, 1)
+
+ def compute_uv(self):
+ for v in self.verts:
+ if v.faces:
+ v.uv = v.faces[0].uv[v.faces[0].verts.index(v)]
+
+ def compute_tbn(self):
+ for v in self.verts:
+ v.tan = Blender.Mathutils.Vector()
+ v.bino = Blender.Mathutils.Vector()
+ for f in v.faces:
+ fverts = f.pivot_vertices(False, v)
+ v1 = fverts[1]
+ v2 = fverts[-1]
+ du1 = v1.uv[0]-v.uv[0]
+ du2 = v2.uv[0]-v.uv[0]
+ dv1 = v1.uv[1]-v.uv[1]
+ dv2 = v2.uv[1]-v.uv[1]
+ div = du1*dv2-du2*dv1
+ edge1 = fverts[1].co-fverts[0].co
+ edge2 = fverts[-1].co-fverts[0].co
+ v.tan += (edge1*dv2-edge2*dv1)/div
+ v.bino += (edge2*du1-edge1*du2)/div
+ v.tan.normalize()
+ v.bino.normalize()
+
+ def create_strip(self, face, max_len, debug):
+ edge = None
+ for e in face.edges:
+ other = e.other_face(face)
+ if other and not other.flag:
+ edge = e
+ break
+
+ if not edge:
+ return None
+
+ if debug:
+ print "Starting strip from %s, edge %s"%([v.index for v in face.verts], (edge.v1.index, edge.v2.index))
+
+ verts = face.pivot_vertices(edge.v1, edge.v2)
+ if len(verts)==3:
+ result = [verts[-1], verts[0]]
+ else:
+ result = [verts[-2], verts[-1]]
+
+ while 1:
+ if debug:
+ print " Adding %s"%face
+
+ verts = face.pivot_vertices(*result[-2:])
+ k = len(result)%2
+
+ face.flag = True
+ if len(verts)==4 and not k:
+ result.append(verts[3])
+ result.append(verts[2])
+ if len(verts)==4 and k:
+ result.append(verts[3])
+
+ if len(result)>=max_len:
+ if debug:
+ print " Max length exceeded"
+ break
+
+ edge = face.get_edge(*result[-2:])
+
+ if debug:
+ print " Next edge is %s"%(edge.key, )
+
+ next = edge.other_face(face)
+ if not next or next.flag:
+ break
+ face = next
+
+ if debug:
+ print " %s"%[v.index for v in result]
+
+ return result
+
+
+class VertexCache:
+ def __init__(self, size):
+ self.size = size
+ self.slots = [-1]*self.size
+
+ def fetch(self, v):
+ hit = v.index in self.slots
+ if hit:
+ self.slots.remove(v.index)
+ self.slots.append(v.index)
+ if not hit:
+ del self.slots[0]
+ return hit
+
+ def fetch_strip(self, strip):
+ hits = 0
+ for v in strip:
+ if self.fetch(v):
+ hits += 1
+ return hits
+
+ def test_strip(self, strip):
+ hits = 0
+ for i in range(len(strip)):
+ if i>=self.size:
+ break
+ if strip[i].index in self.slots[i:]:
+ hits += 1
+ return hits