Esempio n. 1
0
 public CarLodGeneratorMergeRules(Kn5NodeFilterContext filterContext, CarLodGeneratorStageParams stage)
 {
     _filterContext      = filterContext;
     _mergeExceptions    = stage.MergeExceptions?.Select(filterContext.CreateFilter).ToArray();
     _mergeParents       = stage.MergeParents?.Select(filterContext.CreateFilter).ToArray();
     _mergeAsBlack       = stage.MergeAsBlack?.Select(filterContext.CreateFilter).ToArray();
     _elementToRemove    = stage.ElementsToRemove?.Select(filterContext.CreateFilter).ToArray();
     _emptyNodesToKeep   = stage.EmptyNodesToKeep?.Select(filterContext.CreateFilter).ToArray();
     _elementPriorities  = stage.ElementsPriorities?.Select(x => Tuple.Create(filterContext.CreateFilter(x.Filter), x.Priority)).ToArray();
     _offsetsAlongNormal = stage.OffsetsAlongNormal?.Select(x => Tuple.Create(filterContext.CreateFilter(x.Filter), x.Priority)).ToArray();
 }
Esempio n. 2
0
        public async Task SaveInputModelAsync(CarLodGeneratorStageParams stage, string filename)
        {
            var kn5           = Kn5.FromBytes(_originalKn5Data, SkippingTextureLoader.Instance);
            var filterContext = new Kn5NodeFilterContext(stage.DefinitionsData, stage.UserDefined, _carDirectory, _carData, kn5);

            await PrepareForGenerationAsync(filterContext, kn5, stage, true);

            if (stage.InlineGeneration?.Source != null)
            {
                var inlineHr = kn5.Nodes.FirstOrDefault(filterContext.CreateFilter(stage.InlineGeneration.Source).Test);
                if (inlineHr == null)
                {
                    throw new Exception($"{stage.InlineGeneration.Source} node is missing");
                }
                kn5.RootNode.Children = new List <Kn5Node> {
                    inlineHr
                };
            }

            kn5.Save(filename);
        }
Esempio n. 3
0
        private async Task <Tuple <string, string> > GenerateLodStageAsync(int index, CarLodGeneratorStageParams stage,
                                                                           IProgress <double?> progress, CancellationToken cancellationToken)
        {
            var kn5 = await Task.Run(() => Kn5.FromBytes(_originalKn5Data, SkippingTextureLoader.Instance));

            progress.Report(0.01);

            var filterContext = new Kn5NodeFilterContext(stage.DefinitionsData, stage.UserDefined, _carDirectory, _carData, kn5);

            await PrepareForGenerationAsync(filterContext, kn5, stage, false);

            progress.Report(0.02);
            cancellationToken.ThrowIfCancellationRequested();

            if (stage.InlineGeneration?.Source != null)
            {
                var inlineHr = kn5.Nodes.FirstOrDefault(filterContext.CreateFilter(stage.InlineGeneration.Source).Test);
                if (inlineHr == null)
                {
                    throw new Exception($"{stage.InlineGeneration.Source} node is missing");
                }
                kn5.RootNode.Children = new List <Kn5Node> {
                    inlineHr
                };
            }

            var temporaryFilenamePrefix = Path.Combine(_temporaryDirectory, $"{Path.GetFileName(_carDirectory)}_{index}");
            var preparedFbxFilename     = FileUtils.EnsureUnique($"{temporaryFilenamePrefix}_in.fbx");

            try {
                await Task.Run(() => kn5.ExportFbx(preparedFbxFilename));

                progress.Report(0.03);
                cancellationToken.ThrowIfCancellationRequested();

                var checksum = await CalculateChecksumAsync(kn5);

                progress.Report(0.04);
                cancellationToken.ThrowIfCancellationRequested();

                var generated = await GenerateLodAsync(preparedFbxFilename, kn5, stage, checksum,
                                                       progress.SubrangeDouble(0.04, 0.98), cancellationToken);

                cancellationToken.ThrowIfCancellationRequested();

                return(await Task.Run(() => {
                    if (stage.InlineGeneration?.Destination != null)
                    {
                        var inlineLr = generated.RootNode.Children[0].NodeClass == Kn5NodeClass.Mesh ? generated.RootNode : generated.RootNode.Children[0];
                        inlineLr.Active = false;
                        inlineLr.Name = stage.InlineGeneration.Destination;

                        generated = Kn5.FromBytes(_originalKn5Data);
                        IterateChildren(generated.RootNode);
                        if (inlineLr != null)
                        {
                            generated.RootNode.Children.Add(inlineLr);
                        }

                        void IterateChildren(Kn5Node node)
                        {
                            if (stage.InlineGeneration == null)
                            {
                                return;
                            }
                            for (var i = node.Children.Count - 1; i >= 0; i--)
                            {
                                var child = node.Children[i];
                                if (child.Name == stage.InlineGeneration.Destination)
                                {
                                    node.Children.RemoveAt(i);
                                }
                                else if (inlineLr != null && child.Name == stage.InlineGeneration.Source)
                                {
                                    node.Children.Insert(i + 1, inlineLr);
                                    inlineLr = null;
                                }
                                else
                                {
                                    IterateChildren(child);
                                }
                            }
                        }

                        cancellationToken.ThrowIfCancellationRequested();
                        progress.Report(0.99);
                    }

                    // This way it would kind of rename them all at once, allowing to swap names if necessary
                    stage.Rename?.Where(x => x.OldName != null).Select(x => new {
                        Nodes = generated.Nodes.Where(filterContext.CreateFilter(x.OldName ?? string.Empty).Test).ToList(),
                        x.NewName
                    }).Where(x => x.NewName != null).ToList()
                    .ForEach(x => x.Nodes.ForEach(y => y.Name = string.Format(x.NewName, y.Name)));

                    var resultFilename = FileUtils.EnsureUnique($"{temporaryFilenamePrefix}_out.kn5");
                    generated.Save(resultFilename);
                    generated.RemoveUnusedMaterials();
                    progress.Report(1d);
                    return Tuple.Create(resultFilename, CalculateChecksum(generated));
                }));
            } finally {
                if (!stage.KeepTemporaryFiles)
                {
                    FileUtils.TryToDelete(preparedFbxFilename);
                }
            }
        }
Esempio n. 4
0
        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));
            }
        }