X-Git-Url: http://git.tdb.fi/?a=blobdiff_plain;f=mesh_export.py;h=eecd5a69835595faaa99c876c88be666c0a18cbf;hb=b8b06a0ff96763ba7e188d9fcacbd8c0e3dcd515;hp=932433360f93649db45d61b6c63b290990a37f0b;hpb=b31a5873556fe046488587568fe35236227e3606;p=libs%2Fgl.git

diff --git a/mesh_export.py b/mesh_export.py
index 93243336..eecd5a69 100644
--- a/mesh_export.py
+++ b/mesh_export.py
@@ -9,24 +9,36 @@ Group: 'Export'
 
 import sys
 import math
+import bpy
 import Blender
 
+def make_edge_key(i1, i2):
+	return (min(i1, i2), max(i1, i2))
+
+
 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 __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=1
+			self.smooth=True
 
 	def other_face(self, f):
 		if f.index==self.faces[0].index:
@@ -42,26 +54,66 @@ 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.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):
+	def __init__(self, index):
+		self.index=index
 		self.faces=[]
 		self.verts=[]
 
@@ -72,13 +124,231 @@ 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 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
 
 
 class Exporter:
@@ -88,31 +358,120 @@ class Exporter:
 			self.out_file=sys.stdout
 		else:
 			self.out_file=file(fn, "w")
-
-	def find_smooth_group(self, face, sg):
+		self.use_strips=True
+		self.use_degen_tris=True
+		self.optimize_locality=True
+		self.debug=False
+		self.strip_debug=False
+		self.smooth_debug=False
+
+	"""def find_smooth_group(self, face, sg):
 		face.smooth_group=sg
 		sg.faces.append(face)
 		queue=[face]
 		while queue:
-			f=queue.pop(0)
-			for e in f.edges:
+			cur=queue.pop(0)
+			for e in cur.edges:
 				if e.smooth:
-					f2=e.other_face(f)
-					if f2 and not f2.smooth_group:
-						f2.smooth_group=sg
-						sg.faces.append(f2)
-						queue.append(f2)
+					other=e.other_face(cur)
+					if other and not other.smooth_group:
+						other.smooth_group=sg
+						sg.faces.append(other)
+						queue.append(other)"""
+
+	"""def create_strip(self, face, reverse):
+		edge=None
+		for e in face.edges:
+			other=e.other_face(face)
+			if other and "other.smooth_group.index==face.smooth_group.index" and not other.flag:
+				edge=e
+				break
+
+		if not edge:
+			return None
+
+		if self.strip_debug:
+			print "Starting strip from %s, edge %s, reverse=%s"%([v.index for v in face.verts], edge.key, 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 self.strip_debug:
+				print "  Adding %s"%[v.index for v in verts]
+
+			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 self.strip_debug:
+				print "  Next edge is %s"%((edge.v1.index, edge.v2.index), )
+
+			next=edge.other_face(face)
+			if not next or next.flag:
+				break
+			face=next
+
+		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=Blender.Scene.GetCurrent()
+		scene=bpy.data.scenes.active
 
-		obj=scene.getActiveObject()
+		obj=scene.objects.active
 		if obj.getType()!="Mesh":
 			raise Exception, "Can only export Mesh data"
 
-		mesh=obj.getData(mesh=True)
+		mesh=Mesh(obj.getData(mesh=True))
+
+		if self.debug:
+			ntris=sum([len(f.verts)-2 for f in mesh.faces])
+			print "Starting with %d vertices, %d faces (%d triangles) and %d edges"%(len(mesh.verts), len(mesh.faces), ntris, len(mesh.edges))
+
+		mesh.split_vertices(self.smooth_debug)
+
+		if self.debug:
+			ntris=sum([len(f.verts)-2 for f in mesh.faces])
+			print "After splitting %d vertices, %d faces (%d triangles) and %d edges"%(len(mesh.verts), len(mesh.faces), ntris, len(mesh.edges))
+
+		mesh.compute_normals()
+
+		#return
 
-		faces=[Face(f) for f in mesh.faces]
+		"""faces=[Face(f) for f in mesh.faces]
 
 		edges=dict([(e.key, Edge(e)) for e in mesh.edges])
 		for f in faces:
@@ -124,39 +483,204 @@ class Exporter:
 		for e in edges.itervalues():
 			e.check_smooth(smooth_limit)
 
+		if self.debug:
+			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:
 			if not f.smooth_group:
-				sg=SmoothGroup()
+				sg=SmoothGroup(len(smooth_groups))
 				smooth_groups.append(sg)
 				self.find_smooth_group(f, sg)
 
-		verts=[]
 		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)
 
-		self.out_file.write("vertices NORMAL3_VERTEX3\n{\n")
-		for v in verts:
-			self.out_file.write("\tnormal3 %g %g %g;\n"%tuple(v.no))
-			self.out_file.write("\tvertex3 %g %g %g;\n"%tuple(v.co))
-		self.out_file.write("};\n")
-		self.out_file.write("batch TRIANGLES\n{\n")
-		for f in faces:
-			for i in range(2, len(f.verts)):
-				self.out_file.write("\tindices %u %u %u;\n"%(f.verts[0].index, f.verts[i-1].index, f.verts[i].index))
+		if self.debug:
+			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 f in mesh.faces:
+				f.flag=False
+
+			while 1:
+				best=5
+				face=None
+				for f in mesh.faces:
+					if f.flag:
+						continue
+					score=0
+					for e in f.edges:
+						other=e.other_face(f)
+						if other and not other.flag:
+							score+=1
+					if score>0 and score<best:
+						face=f
+						best=score
+
+				if not face:
+					break
+
+				strip=mesh.create_strip(face, self.use_degen_tris and sum([len(s) for s in strips])%2, self.strip_debug)
+				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 mesh.faces if not f.flag])
+				nind=sum([len(s) for s in strips])+sum([len(f.verts) for f in mesh.faces if not f.flag])
+				print "%d indices total"%nind
+
+			if self.use_degen_tris:
+				big_strip=[]
+				for s in strips:
+					if big_strip:
+						big_strip+=[big_strip[-1], s[0]]
+					big_strip+=s
+
+				for f in mesh.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[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)
+
+		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 mesh.verts[n].flag:
+							next=mesh.verts[n]
+							best=flw[n]+0.9/abs(vert.index-n)
+
+				if not next:
+					for v in mesh.verts:
+						if not v.flag:
+							next=v
+							break
+					if not next:
+						break
+
+				vert=next
+
+			mesh.verts=verts2
+
+			for i in range(len(mesh.verts)):
+				mesh.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")
+		if mesh.faceUV:
+			self.out_file.write("_TEXCOORD2")
+		self.out_file.write("_VERTEX3\n{\n")
+		norm=None
+		uv=None
+		for v in mesh.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:
+			self.out_file.write("batch TRIANGLE_STRIP\n{\n\tindices")
+			n=0
+			for v in s:
+				self.out_file.write(" %u"%v.index)
+				n+=1;
+				if n%32==0:
+					self.out_file.write(";\n\tindices")
+			self.out_file.write(";\n};\n")
+
+		first=True
+		for f in mesh.faces:
+			if not f.flag:
+				if first:
+					self.out_file.write("batch TRIANGLES\n{\n")
+					first=False
+				for i in range(2, len(f.verts)):
+					self.out_file.write("\tindices %u %u %u;\n"%(f.verts[0].index, f.verts[i-1].index, f.verts[i].index))
+		if not first:
+			self.out_file.write("};\n")
 
 
 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)
+		self.smooth_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),
+				("Debug smoothing", self.smooth_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_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.smooth_debug=self.smooth_debug.val
 		exp.export()