private static void MergeMeshes(Kn5Node root, List <Tuple <Kn5Node, double, Mat4x4> > children, CarLodGeneratorMergeRules mergeRules,
CarLodGeneratorStageParams stage)
{
if (children.Count == 0)
{
return;
}
var mesh = children[0].Item1;
var priority = children[0].Item2;
var considerDetails = mesh.MaterialId != uint.MaxValue;
var builder = new Kn5MeshBuilder(considerDetails, considerDetails);
// AcToolsLogging.Write($"Merging together: {children.Select(x => $"{x.Item1.Name} [{x.Item2}]").JoinToString(", ")}");
var extraCounter = 0;
foreach (var child in children)
{
var transform = child.Item3 * Mat4x4.CreateScale(new Vec3((float)priority)) * Mat4x4.CreateTranslation(MoveAsideDistance(priority, stage));
var offset = mergeRules.GetOffsetAlongNormal(child.Item1);
for (var i = 0; i < child.Item1.Indices.Length; ++i)
{
builder.AddVertex(child.Item1.Vertices[child.Item1.Indices[i]].Transform(transform, offset));
if (i % 3 == 2 && builder.IsCloseToLimit)
{
builder.SetTo(mesh);
root.Children.Add(mesh);
mesh.Tag = priority;
builder.Clear();
mesh = Kn5MeshUtils.Create(children[0].Item1.Name + $"___$extra:{extraCounter}", children[0].Item1.MaterialId);
++extraCounter;
}
}
}
if (builder.Count > 0)
{
builder.SetTo(mesh);
root.Children.Add(mesh);
mesh.Tag = priority;
}
}
private static async Task PrepareForGenerationAsync(Kn5NodeFilterContext filterContext, IKn5 kn5, CarLodGeneratorStageParams stage, bool printNodes)
{
var mergeRules = new CarLodGeneratorMergeRules(filterContext, stage);
var toMerge = new Dictionary <Kn5Node, List <Tuple <Kn5Node, double, Mat4x4> > >();
var nodeIndices = new Dictionary <Kn5Node, int>();
MergeNode(kn5.RootNode, kn5.RootNode, 1d);
foreach (var pair in toMerge)
{
var mergeData = pair.Value.GroupBy(x => mergeRules.MergeGroup(x.Item1, x.Item2))
.OrderBy(v => mergeRules.GroupOrder(kn5, v, nodeIndices)).Select(v => v.ToList()).ToList();
await Task.Run(() => {
foreach (var group in mergeData)
{
MergeMeshes(pair.Key, group, mergeRules, stage);
}
});
}
foreach (var node in kn5.Nodes.Where(x => x.Children?.Count > 1).ToList())
{
var meshesList = node.Children
.Where(x => x.NodeClass != Kn5NodeClass.Base)
.Select((x, i) => new { x, i = OrderIndex(x, i) })
.OrderBy(x => x.i)
.Select(x => x.x).ToList();
if (meshesList.Count > 0)
{
if (node.Children.Any(x => x.NodeClass == Kn5NodeClass.Base))
{
node.Children = node.Children.Where(x => x.NodeClass == Kn5NodeClass.Base)
.Prepend(Kn5Node.CreateBaseNode($"__{meshesList[0].Name}_wrap_", meshesList, true))
.Select((x, i) => new { x, i = OrderIndex(x, i) })
.OrderBy(x => x.i)
.Select(x => x.x).ToList();
}
else
{
node.Children = meshesList;
}
}
}
if (printNodes)
{
PrintNode(kn5.RootNode, 0, 0);
}
mergeRules.FinalizeKn5(kn5);
var duplicateNames = kn5.Nodes.GroupBy(x => $"{x.NodeClass}/{x.Name}")
.Select(x => x.ToList()).Where(x => x.Count > 1).ToList();
foreach (var group in duplicateNames)
{
AcToolsLogging.Write($"Duplicate name: {group[0].Name} ({group[0].NodeClass})");
foreach (var toRename in group.Skip(1).Select((x, i) => new { x, i }))
{
toRename.x.Name = $"{toRename.x.Name}___$unique:{toRename.i}";
}
}
int OrderIndex(Kn5Node node, int index)
{
return(index + (AnyTransparent(node) ? 1 << 10 : 0));
}
void PrintNode(Kn5Node node, int level, int index)
{
var postfix = node.NodeClass == Kn5NodeClass.Base ? "" :
$"{(node.IsTransparent ? ", transparent" : "")}, material: {kn5.GetMaterial(node.MaterialId)?.Name}";
AcToolsLogging.Write(
$"{new string('\t', level)}{node.Name} [{node.NodeClass}{postfix}, index: {OrderIndex(node, index)}, aabb: {filterContext.GetAabb3(node)}]");
if (node.NodeClass == Kn5NodeClass.Base)
{
for (var i = 0; i < node.Children.Count; i++)
{
PrintNode(node.Children[i], level + 1, i);
}
}
}
bool AnyTransparent(Kn5Node node)
{
return(node.NodeClass == Kn5NodeClass.Base
? node.Children.Any(AnyTransparent)
: node.IsTransparent || kn5.GetMaterial(node.MaterialId)?.BlendMode == Kn5MaterialBlendMode.AlphaBlend);
}
void ApplyPriority(Kn5Node mesh, double priority)
{
var offset = MoveAsideDistance(priority, stage);
for (var i = 0; i < mesh.Vertices.Length; i++)
{
Apply(ref mesh.Vertices[i]);
}
mesh.Tag = priority;
void Apply(ref Kn5Node.Vertex v)
{
v.Position[0] = v.Position[0] * (float)priority + offset.X;
v.Position[1] = v.Position[1] * (float)priority + offset.Y;
v.Position[2] = v.Position[2] * (float)priority + offset.Z;
}
}
bool MergeNode(Kn5Node node, Kn5Node mergeRoot, double priority)
{
nodeIndices[node] = nodeIndices.Count;
if (node != mergeRoot)
{
if (mergeRules.CanSkipNode(node))
{
if (node.NodeClass == Kn5NodeClass.Base && !mergeRules.HasParentWithSameName(node) && !mergeRules.CanRemoveEmptyNode(node))
{
node.Children.Clear();
return(true);
}
return(false);
}
var priorityAdjustment = mergeRules.CalculateReductionPriority(node);
if (priorityAdjustment != 1d && (priorityAdjustment < priority || priority == 1d || node.NodeClass == Kn5NodeClass.Mesh))
{
priority = priorityAdjustment;
}
if (node.NodeClass == Kn5NodeClass.Mesh)
{
if (mergeRoot != null && mergeRules.CanMerge(node))
{
if (!toMerge.ContainsKey(mergeRoot))
{
toMerge[mergeRoot] = new List <Tuple <Kn5Node, double, Mat4x4> >();
}
toMerge[mergeRoot].Add(Tuple.Create(node, priority, node.CalculateTransformRelativeToParent(mergeRoot)));
return(false);
}
if (priority != 1d)
{
ApplyPriority(node, priority);
}
return(true);
}
if (node.NodeClass == Kn5NodeClass.SkinnedMesh)
{
return(true);
}
if (mergeRoot != null)
{
if (!mergeRules.CanMerge(node))
{
mergeRoot = null;
}
else if (node.Name != mergeRoot.Name && mergeRules.IsNodeMergeRoot(node))
{
mergeRoot = node;
}
}
}
for (var i = 0; i < node.Children.Count; ++i)
{
if (!MergeNode(node.Children[i], mergeRoot, priority))
{
node.Children.RemoveAt(i);
--i;
}
}
return(node.Children.Count > 0 || mergeRoot == node || !mergeRules.CanRemoveEmptyNode(node));
}
}
