Some tidying and commenting of LOD code.

library/PolyVoxCore/include/SurfaceVertex.h

@@ -51,6 +51,7 @@ namespace PolyVox
 		float getMaterial(void) const;
 		const Vector3DFloat& getNormal(void) const;
 		const Vector3DFloat& getPosition(void) const;	
+		unsigned int getNoOfGeometryEdges(void) const;
 
 		bool isOnEdge(void) const;
 		bool isOnGeometryEdge(void) const;

library/PolyVoxCore/source/IndexedSurfacePatch.cpp

@@ -28,6 +28,7 @@ freely, subject to the following restrictions:
 #include "progmesh.h"
 
 #include <cstdlib>
+#include <list>
 
 using namespace std;
 
@@ -469,53 +470,52 @@ namespace PolyVox
 
 	uint32_t IndexedSurfacePatch::performDecimationPass(float fMinDotProductForCollapse)
 	{
-		/*
+		// I'm using a vector of lists here, rather than a vector of sets,
-		Note for after holiday - breaking this function down into sub functions will
+		// because I don't believe that duplicaes should occur. But this
-		likely help identify where the problem is...
+		// might be worth checking if we have problems in the future.
-		*/
+		vector< list<uint32_t> > trianglesUsingVertex(m_vecVertices.size());
-
-		//Do we need a set? Do we actually get duplications?
-		vector< set<uint32_t> > trianglesUsingVertex(m_vecVertices.size());
 		for(int ct = 0; ct < m_vecTriangleIndices.size(); ct++)
 		{
 			int triangle = ct / 3;
 
-			trianglesUsingVertex[m_vecTriangleIndices[ct]].insert(triangle);
+			trianglesUsingVertex[m_vecTriangleIndices[ct]].push_back(triangle);
 		}
 
-
+		// Count how many edges we have collapsed
 		uint32_t noOfEdgesCollapsed = 0;
 
-		/*
+		// The vertex mapper track whick vertices collapse onto which.
-		Note for after holiday - Check the use of this vertex mapper, and make
-		sure that when we access a vertex we go through the mapper if necessary.
-		*/
 		vector<uint32_t> vertexMapper(m_vecVertices.size());
+
+		// Once a vertex is involved in a collapse (either because it
+		// moves onto a different vertex, or because a different vertex
+		// moves onto it) it is forbidden to take part in another collapse
+		// this pass. We enforce this by setting the vertex locked flag.
 		vector<bool> vertexLocked(m_vecVertices.size());
 
-		//Initialise the mapper.
+		// Initialise the vectors
-		for(uint32_t ct = 0; ct < vertexMapper.size(); ct++)
+		for(uint32_t ct = 0; ct < m_vecVertices.size(); ct++)
 		{
+			// Initiall all vertices points to themselves
 			vertexMapper[ct] = ct;
-		}
+			// All vertices are initially unlocked
-
-		for(uint32_t ct = 0; ct < vertexLocked.size(); ct++)
-		{
 			vertexLocked[ct] = false;
 		}
 
-		//It *may* be beneficial to do this randomisation of the order in which we process the triangles
+		
-		//in order to help the resulting vertices/triangles be more uniformly distributed. As a reminder,
+		// Each triangle exists in this vector once.
-		//comment out the shuffle line to see what it does.
+		vector<int> vecOfTriCts(m_vecTriangleIndices.size() / 3);
-		vector<int> vecOfTriCts;
+		for(int triCt = 0; triCt < vecOfTriCts.size(); triCt++)
-		for(int triCt = 0; triCt < m_vecTriangleIndices.size() / 3; triCt++)
 		{
-			vecOfTriCts.push_back(triCt);
+			vecOfTriCts[triCt] = triCt;
 		}
+
+		// It *may* be beneficial to randomise the order in which triangles
+		// are processed to get a more uniform distribution off collapses and 
+		// more equally sized triangles at the end. This need more testing really.
 		random_shuffle(vecOfTriCts.begin(), vecOfTriCts.end());
 
-		//For each triange
+		//For each triange...
-		//for(int triCt = 0; triCt < m_vecTriangleIndices.size() / 3; triCt++)
 		for(int ctIter = 0; ctIter < vecOfTriCts.size(); ctIter++)
 		{
 			int triCt = vecOfTriCts[ctIter];
@@ -526,9 +526,6 @@ namespace PolyVox
 				int v0 = m_vecTriangleIndices[triCt * 3 + (edgeCt)];
 				int v1 = m_vecTriangleIndices[triCt * 3 + ((edgeCt +1) % 3)];
 
-				/*v0 = vertexMapper[v0];
-				v1 = vertexMapper[v1];*/
-
 				//A vertex will be locked if it has already been involved in a collapse this pass.
 				if(vertexLocked[v0] || vertexLocked[v1])
 				{
@@ -542,15 +539,23 @@ namespace PolyVox
 				}
 
 				//...or those on geometry (region) edges.
-				if(m_vecVertices[v0].isOnGeometryEdge() || m_vecVertices[v1].isOnGeometryEdge())
+				/*if(m_vecVertices[v0].isOnGeometryEdge() || m_vecVertices[v1].isOnGeometryEdge())
 				{
 					continue;
-				}
+				}*/
+
+				// In theory it seems we should also allow edge vertices to collapse onto other edge vertices,
+				// and also onto corner vertices.But a corner vertex shouldn't collapse onto another corner?
 
 				//After holiday, consider using the following line so that 'internal' vertices can collapse onto
 				//edges (but not vice-versa) and edges can collapse onto corners (but not vice-versa).
 				//FIXME - Stop corners collapsing onto corners!
-				/*if(isSubset(m_vecVertices[v0].m_bFlags, m_vecVertices[v1].m_bFlags) == false)
+				if(isSubset(m_vecVertices[v0].m_bFlags, m_vecVertices[v1].m_bFlags) == false)
+				{
+					continue;
+				}
+
+				/*if((m_vecVertices[v0].getNoOfGeometryEdges()) >= (m_vecVertices[v1].getNoOfGeometryEdges()))
 				{
 					continue;
 				}*/
@@ -565,13 +570,13 @@ namespace PolyVox
 				//The last test is whether we will flip any of the faces
 
 				bool faceFlipped = false;
-				set<uint32_t> triangles = trianglesUsingVertex[v0];
+				list<uint32_t> triangles = trianglesUsingVertex[v0];
 				/*set<uint32_t> triangles;
 				std::set_union(trianglesUsingVertex[v0].begin(), trianglesUsingVertex[v0].end(),
 					trianglesUsingVertex[v1].begin(), trianglesUsingVertex[v1].end(),
 					std::inserter(triangles, triangles.begin()));*/
 
-				for(set<uint32_t>::iterator triIter = triangles.begin(); triIter != triangles.end(); triIter++)
+				for(list<uint32_t>::iterator triIter = triangles.begin(); triIter != triangles.end(); triIter++)
 				{
 					uint32_t tri = *triIter;
 					

library/PolyVoxCore/source/SurfaceVertex.cpp

@@ -61,6 +61,15 @@ namespace PolyVox
 	{
 		return position;
 	}
+	
+	//Returns a value between 0-3, for how many geometry edges (X,Y,Z) this vertex is on.
+	unsigned int SurfaceVertex::getNoOfGeometryEdges(void) const
+	{
+		unsigned int uIsOnEdgeX = static_cast<unsigned int>(isOnGeometryEdgeX());
+		unsigned int uIsOnEdgeY = static_cast<unsigned int>(isOnGeometryEdgeY());
+		unsigned int uIsOnEdgeZ = static_cast<unsigned int>(isOnGeometryEdgeZ());
+		return uIsOnEdgeX + uIsOnEdgeY + uIsOnEdgeZ;
+	}
 
 	bool SurfaceVertex::isOnEdge(void) const
 	{