+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.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.uv=mv.uv
+ else:
+ self._mvert=mv
+ self.uv=None
+ self.orig_index=self._mvert.index
+ self.flag=False
+ self.faces=[]
+
+ def __getattr__(self, attr):
+ return getattr(self._mvert, attr)
+
+ def __cmp__(self, other):
+ 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.smooth_group=None
+ 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):
+ 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 get_vertices_from(self, reverse, *vt):
+ verts=self.verts[:]
+ if reverse:
+ verts.reverse()
+ indices=[u.index for u in vt]
+ flags=[(v.index in indices) 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
+
+
+class SmoothGroup:
+ def __init__(self, index):
+ self.index=index
+ self.faces=[]
+ self.verts=[]
+
+ def find_vertices(self):
+ vert_map={}
+ for f in self.faces:
+ for i in range(len(f.verts)):
+ v=f.verts[i]
+ if v.index not in vert_map:
+ vt=Vertex(v)
+ vt.index=len(self.verts)
+ self.verts.append(vt)
+
+ vert_map[v.index]=vt
+ vt.no=Blender.Mathutils.Vector(f.no)
+ else:
+ vt=vert_map[v.index]
+ vt.no+=f.no
+ f.verts[i]=vt
+
+ for v in self.verts:
+ v.no.normalize()
+
+ def separate_uv(self):
+ copies={}
+ for f in self.faces:
+ for i in range(len(f.verts)):
+ v=f.verts[i]
+ if not v.uv:
+ v.uv=f.uv[i]
+ elif f.uv[i]!=v.uv:
+ if v.index not in copies:
+ copies[v.index]=[]
+
+ vt=None
+ for w in copies[v.index]:
+ if w.uv==f.uv[i]:
+ vt=w
+ break
+
+ if not vt:
+ vt=Vertex(v)
+ vt.index=len(self.verts)
+ vt.uv=f.uv[i]
+ self.verts.append(vt)
+ copies[v.index].append(vt)
+
+ f.verts[i]=vt
+
+ def create_edges(self):
+ edge_map={}
+ for f in self.faces:
+ vert_map=dict([(v.orig_index, v) for v in f.verts])
+ for i in range(len(f.edges)):
+ v1=vert_map[f.edges[i].v1.index]
+ v2=vert_map[f.edges[i].v2.index]
+ key=tuple(sorted((v1.index, v2.index)))
+
+ if key in edge_map:
+ e=edge_map[key]
+ else:
+ e=Edge(f.edges[i])
+ edge_map[key]=e
+ e.v1=v1
+ e.v2=v2
+ e.key=key
+
+ f.edges[i]=e
+ e.faces.append(f)
+
+
+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)
+
+ smooth_limit=math.cos(m.degr*math.pi/180)
+ 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, debug=False):
+ 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(self.find_group(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"%v.index
+
+ 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)
+
+ old=e
+ if not e.smooth:
+ if 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)
+ if not e.smooth:
+ 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 find_group(self, vert, face):
+ face_indices=[f.index for f in vert.faces]
+
+ 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:
+ continue
+
+ if e.smooth:
+ if not other.flag:
+ other.flag=True
+ queue.append(other)
+
+ return queue
+
+ def compute_normals(self):
+ for v in self.verts:
+ if not v.faces:
+ print "WTF? Vertex %s without faces?"%v
+ v.no=Blender.Mathutils.Vector()
+ for f in v.faces:
+ v.no+=f.no
+ v.no.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.get_vertices_from(reverse, edge.v1, edge.v2)
+ if len(verts)==3:
+ result=[verts[-1], verts[0]]
+ else:
+ result=[verts[-2], verts[-1]]
+
+ while 1:
+ verts=face.get_vertices_from(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
+
+