+def make_edge_key(i1, i2):
+ return (min(i1, i2), max(i1, i2))
+
+
+class Edge:
+ def __init__(self, me):
+ if me.__class__==Edge:
+ self._medge=me._medge
+ self.v1=me.v1
+ self.v2=me.v2
+ self.smooth=me.smooth
+ else:
+ self._medge=me
+ self.smooth=False
+ self.faces=[]
+
+ def __getattr__(self, attr):
+ return getattr(self._medge, attr)
+
+ def __cmp__(self, other):
+ return self is other
+
+ def check_smooth(self, limit):
+ if len(self.faces)!=2:
+ return
+
+ d=Blender.Mathutils.DotVecs(self.faces[0].no, self.faces[1].no)
+ if (d>limit and self.faces[0].smooth and self.faces[1].smooth) or d>0.999:
+ self.smooth=True
+
+ def other_face(self, f):
+ if f.index==self.faces[0].index:
+ if len(self.faces)>=2:
+ return self.faces[1]
+ else:
+ return None
+ else:
+ return self.faces[0]
+
+
+class Vertex:
+ def __init__(self, mv):
+ if mv.__class__==Vertex:
+ self._mvert=mv._mvert
+ self.no=mv.no
+ self.uv=mv.uv
+ else:
+ self._mvert=mv
+ self.uv=None
+ self.orig_index=self._mvert.index
+ self.flag=False
+ self.faces=[]
+ self.tan=None
+ self.bino=None
+
+ def __getattr__(self, attr):
+ return getattr(self._mvert, attr)
+
+ def __cmp__(self, other):
+ if other is None:
+ return 1
+ return cmp(self.index, other.index)
+
+ def __str__(self):
+ return "<Vert %d (%.4f, %.4f, %.4f) (%.4f, %.4f, %.4f)>"%(self.index, self.co[0], self.co[1], self.co[2], self.no[0], self.no[1], self.no[2])
+
+ __repr__=__str__
+
+
+class Face:
+ def __init__(self, mf):
+ self._mface=mf
+ self.edges=[]
+ self.verts=[v for v in mf.verts]
+ self.flag=False
+
+ def __getattr__(self, attr):
+ return getattr(self._mface, attr)
+
+ def __cmp__(self, other):
+ if other is None:
+ return 1
+ return cmp(self.index, other.index)
+
+ def __str__(self):
+ return "<Face %d (%s)>"%(self.index, " ".join([str(v.index) for v in self.verts]))
+
+ __repr__=__str__
+
+ def pivot_vertices(self, reverse, *vt):
+ verts=self.verts[:]
+ if reverse:
+ verts.reverse()
+ flags=[(v in vt) for v in verts]
+ l=len(verts)
+ for i in range(l):
+ if flags[i] and not flags[(i+l-1)%l]:
+ return verts[i:]+verts[:i]
+
+ def get_edge(self, v1, v2):
+ key=make_edge_key(v1.index, v2.index)
+ for e in self.edges:
+ if e.key==key:
+ return e
+ raise KeyError, "No edge %s"%(key,)
+
+
+class Line:
+ def __init__(self, e):
+ self.edge=e
+ self.verts=[e.v1, e.v2]
+ self.flag=False
+
+ def __str__(self):
+ return "<Line (%d %d)>"%(self.verts[0].index, self.verts[1].index)
+
+ __repr__=__str__
+
+
+class Mesh:
+ def __init__(self, m):
+ self._mesh=m
+ self.verts=[Vertex(v) for v in m.verts]
+ self.faces=[Face(f) for f in m.faces]
+
+ for f in self.faces:
+ for i in range(len(f.verts)):
+ 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, reverse, 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, reverse=%s"%([v.index for v in face.verts], (edge.v1.index, edge.v2.index), reverse)
+
+ verts=face.pivot_vertices(reverse, edge.v1, edge.v2)
+ if len(verts)==3:
+ result=[verts[-1], verts[0]]
+ else:
+ result=[verts[-2], verts[-1]]
+
+ while 1:
+ verts=face.pivot_vertices(reverse, *result[-2:])
+ k=len(result)%2
+ if debug:
+ print " Adding %s"%face
+
+ 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])
+
+ 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
+
+