internal override void Optimize()
{
// build a new vertex buffer and a new index buffer
var optimizedVertices = new List <UntexturedVertex>();
var optimizedIndices = new List <int>();
foreach (int index in indices_)
{
UntexturedVertex thisVertex = vertices_[index];
int thisVertexIndex = 0;
bool foundMatch = false;
foreach (UntexturedVertex optimizedVertex in optimizedVertices)
{
if ((thisVertex != optimizedVertex) && (UntexturedVertex.AreApproxEqual(thisVertex, optimizedVertex)))
{
optimizedIndices.Add(thisVertexIndex);
foundMatch = true;
break;
}
++thisVertexIndex;
}
if (!foundMatch)
{
// Add a new vertex to the optimized list
optimizedIndices.Add(optimizedVertices.Count);
optimizedVertices.Add(thisVertex);
}
}
vertices_ = optimizedVertices;
indices_ = optimizedIndices;
}
internal override void ParseAndTransformTriangle(Matrix4x4 nodeToModelMatrix,
XElement v0Element, XElement v1Element, XElement v2Element)
{
UntexturedVertex v0 = ParseAndTransformVertex(nodeToModelMatrix, v0Element);
UntexturedVertex v1 = ParseAndTransformVertex(nodeToModelMatrix, v1Element);
UntexturedVertex v2 = ParseAndTransformVertex(nodeToModelMatrix, v2Element);
vertices_.Add(v0);
indices_.Add(indices_.Count);
vertices_.Add(v1);
indices_.Add(indices_.Count);
vertices_.Add(v2);
indices_.Add(indices_.Count);
}
internal static bool AreApproxEqual(UntexturedVertex lhs, UntexturedVertex rhs)
{
return
(VertexComparer.PositionsAreApproxEqual(lhs.Position, rhs.Position) &&
VertexComparer.NormalsAreApproxEqual(lhs.Normal, rhs.Normal));
}
