class Edge:
def __init__(self, me):
- self._medge=me
+ if me.__class__==Edge:
+ self._medge=me._medge
+ self.smooth=me.smooth
+ else:
+ self._medge=me
+ self.smooth=False
self.faces=[]
- self.smooth=False
def __getattr__(self, attr):
return getattr(self._medge, attr)
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
def __getattr__(self, attr):
return getattr(self._mvert, attr)
def __getattr__(self, attr):
return getattr(self._mface, attr)
- def get_vertices_from(self, *vt):
+ 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 self.verts]
- l=len(self.verts)
+ 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 self.verts[i:]+self.verts[:i]
+ return verts[i:]+verts[:i]
+
+ def get_edge(self, v1, v2):
+ i1=v1.index
+ i2=v2.index
+ for e in self.edges:
+ if (e.v1.index==i1 or e.v1.index==i2) and (e.v2.index==i1 or e.v2.index==i2):
+ return e
class SmoothGroup:
v=f.verts[i]
if v.index not in vert_map:
vt=Vertex(v)
- if not f.smooth:
- vt.no=f.no
+ 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:
- f.verts[i]=vert_map[v.index]
+ 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 Exporter:
self.out_file=file(fn, "w")
self.use_strips=True
self.use_degen_tris=True
+ self.optimize_locality=True
self.debug=False
+ self.strip_debug=False
def find_smooth_group(self, face, sg):
face.smooth_group=sg
sg.faces.append(other)
queue.append(other)
- def create_strip(self, face):
+ def create_strip(self, face, reverse):
edge=None
for e in face.edges:
other=e.other_face(face)
if not edge:
return None
- if self.debug:
- print "Starting strip from %s"%[v.index for v in face.verts]
+ if self.strip_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(edge.v1, edge.v2)
- result=[verts[-2], verts[-1]]
+ 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(*result[-2:])
+ verts=face.get_vertices_from(reverse, *result[-2:])
k=len(result)%2
- if self.debug:
- print " %d %s"%(len(result), [v.index for v in verts])
+ if self.strip_debug:
+ print " Adding %s"%[v.index for v in verts]
face.flag=True
if len(verts)==4 and not k:
if len(verts)==4 and k:
result.append(verts[3])
- i1=result[-2].index
- i2=result[-1].index
- ekey=(min(i1, i2), max(i1, i2))
- for e in face.edges:
- if e.key==ekey:
- edge=e
- break
+ edge=face.get_edge(*result[-2:])
+
+ if self.strip_debug:
+ print " Next edge is %s"%((edge.v1.index, edge.v2.index), )
next=edge.other_face(face)
if not next or next.smooth_group.index!=face.smooth_group.index or next.flag:
break
face=next
- if self.debug:
+ if self.strip_debug:
print " %s"%[v.index for v in result]
return result
+ def get_locality(self, strip):
+ total=0
+ for i in range(1, len(strip)):
+ if strip[i].index!=strip[i-1].index:
+ total+=1.0/(abs(strip[i].index-strip[i-1].index))
+ return total/len(strip)
+
+ def get_followers(self, strip):
+ result={}
+ for i in range(len(strip)-1):
+ v=strip[i]
+ n=strip[i+1]
+ if v.index!=n.index:
+ if v.index not in result:
+ result[v.index]={}
+ if n.index not in result[v.index]:
+ result[v.index][n.index]=1
+ else:
+ result[v.index][n.index]+=1
+ return result
+
def export(self):
scene=bpy.data.scenes.active
e.check_smooth(smooth_limit)
if self.debug:
- print "%d faces, %d edges"%(len(faces), len(edges))
+ ntris=sum([len(f.verts)-2 for f in faces])
+ print "%d faces (%d triangles), %d edges"%(len(faces), ntris, len(edges))
smooth_groups=[]
for f in faces:
for sg in smooth_groups:
sg.find_vertices()
+ if mesh.faceUV:
+ sg.separate_uv()
+ sg.create_edges()
+
+ verts=[]
+ for sg in smooth_groups:
+ for v in sg.verts:
+ v.index=len(verts)
+ verts.append(v)
if self.debug:
- print "%d smooth groups:"
+ print "%d smooth groups:"%len(smooth_groups)
for i in range(len(smooth_groups)):
sg=smooth_groups[i]
print " %d: %d faces, %d vertices"%(i, len(sg.faces), len(sg.verts))
+ print "%d vertices total"%len(verts)
strips=[]
if self.use_strips:
- for sg in smooth_groups:
- for f in sg.faces:
- if not f.flag:
- strip=self.create_strip(f)
- if strip:
- strips.append(strip)
+ while 1:
+ best=5
+ face=None
+ for f in faces:
+ if f.flag:
+ continue
+ score=0
+ for e in f.edges:
+ other=e.other_face(f)
+ if other and other.smooth_group.index==f.smooth_group.index and not other.flag:
+ score+=1
+ if score>0 and score<best:
+ face=f
+ best=score
+ if not face:
+ break
+ strip=self.create_strip(face, self.use_degen_tris and sum([len(s) for s in strips])%2)
+ if strip:
+ strips.append(strip)
+
+ if self.debug:
+ print "%d strips:"%len(strips)
+ for i in range(len(strips)):
+ print " %d: %d indices"%(i, len(strips[i]))
+ print "%d loose faces"%len([f for f in faces if not f.flag])
+ nind=sum([len(s) for s in strips])+sum([len(f.verts) for f in faces if not f.flag])
+ print "%d indices total"%nind
if self.use_degen_tris:
big_strip=[]
for f in faces:
if not f.flag:
+ if len(big_strip)%2:
+ order=(-1, -2, 0, 1)
+ else:
+ order=(0, 1, -1, -2)
if big_strip:
- big_strip+=[big_strip[-1], f.verts[0]]
- big_strip+=[f.verts[i] for i in (0, 1, -1)]
- if len(f.verts)==4:
- big_strip.append(f.verts[-2])
+ big_strip+=[big_strip[-1], f.verts[order[0]]]
+ big_strip+=[f.verts[i] for i in order[:len(f.verts)]]
f.flag=True
strips=[big_strip]
+
+ if self.debug:
+ nind=len(big_strip)
+ print "Big strip has %d indices"%len(big_strip)
- verts=[]
- for sg in smooth_groups:
- for v in sg.verts:
- v.index=len(verts)
- verts.append(v)
+ if self.debug:
+ print "%.2f indices per triangle"%(float(nind)/ntris)
+ print "Locality before optimization: "+" ".join(["%.3f"%self.get_locality(s) for s in strips])
+
+ if self.optimize_locality and self.use_strips:
+ followers={}
+ for s in strips:
+ followers.update(self.get_followers(s))
+
+ verts2=[]
+ vert=strips[0][0]
+ while 1:
+ vert.flag=True
+ verts2.append(vert)
+
+ next=None
+ if vert.index in followers:
+ flw=followers[vert.index]
+ best=0
+ for n in flw:
+ if flw[n]>best and not verts[n].flag:
+ next=verts[n]
+ best=flw[n]+0.9/abs(vert.index-n)
+
+ if not next:
+ for v in verts:
+ if not v.flag:
+ next=v
+ break
+ if not next:
+ break
+
+ vert=next
+
+ verts=verts2
+
+ for i in range(len(verts)):
+ verts[i].index=i
+
+ if self.debug:
+ print "Locality after optimization: "+" ".join(["%.3f"%self.get_locality(s) for s in strips])
- self.out_file.write("vertices NORMAL3_VERTEX3\n{\n")
+ self.out_file.write("vertices NORMAL3")
+ if mesh.faceUV:
+ self.out_file.write("_TEXCOORD2")
+ self.out_file.write("_VERTEX3\n{\n")
norm=None
+ uv=None
for v in verts:
if v.no!=norm:
self.out_file.write("\tnormal3 %f %f %f;\n"%tuple(v.no))
norm=v.no
+ if v.uv!=uv:
+ self.out_file.write("\ttexcoord2 %f %f;\n"%tuple(v.uv))
+ uv=v.uv
self.out_file.write("\tvertex3 %f %f %f;\n"%tuple(v.co))
self.out_file.write("};\n")
for s in strips:
class FrontEnd:
def run(self):
- #self.export(None)
- Blender.Window.FileSelector(self.export, "Export MSP GL mesh", Blender.sys.makename(ext='.mesh'))
+ self.use_strips=Blender.Draw.Create(True)
+ self.use_degen_tris=Blender.Draw.Create(True)
+ self.optimize_locality=Blender.Draw.Create(True)
+ self.debug=Blender.Draw.Create(False)
+ self.strip_debug=Blender.Draw.Create(False)
+ ret=Blender.Draw.PupBlock("Export MSP GL mesh",
+ [("Use strips", self.use_strips, "Generage OpenGL triangle strips"),
+ ("Use degen tris", self.use_degen_tris, "Use degenerate triangles to combine triangle strips"),
+ ("Optimize locality", self.optimize_locality),
+ ("Debugging options"),
+ ("Debug", self.debug),
+ ("Debug strips", self.strip_debug)])
+ if ret:
+ Blender.Window.FileSelector(self.export, "Export MSP GL mesh", Blender.sys.makename(ext='.mesh'))
+
+ def draw(self):
+ pass
def export(self, fn):
exp=Exporter(fn)
- #exp.use_degen_tris=False
+ exp.use_strips=self.use_strips.val
+ exp.use_degen_tris=self.use_degen_tris.val
+ exp.optimize_locality=self.optimize_locality.val
+ exp.debug=self.debug.val
+ exp.strip_debug=self.strip_debug.val
exp.export()
projects / libs / gl.git / blobdiff