Method BakedPathData

core/src/core/path_data.cpp:195–369

// --------------------------------------------------------------------------------------------------------------------

BakedPathData::BakedPathData(const IScene& scene,
                             const ProbeBatch& probes,
                             int numSamples,
                             float radius,
                             float threshold,
                             float visRange,
                             float visRangeRealTime,
                             float pathRange,
                             bool asymmetricVisRange,
                             const Vector3f& down,
                             bool pruneVisGraph,
                             int numThreads,
                             ThreadPool& threadPool,
                             std::atomic<bool>& cancel,
                             ProgressCallback progressCallback,
                             void* callbackUserData)
    : mBakedPathRefs(probes.numProbes(), probes.numProbes())
{
    // First, generate the visibility graph.
    ProbeVisibilityTester visTester(numSamples, asymmetricVisRange, down);

    JobGraph jobGraph{};
    mVisGraph = ipl::make_unique<ProbeVisibilityGraph>(scene, probes, visTester, radius, threshold, visRange,
                                                       numThreads, jobGraph, cancel, progressCallback, callbackUserData);

    threadPool.process(jobGraph, [progressCallback, callbackUserData](float percentComplete) { progressCallback(percentComplete, callbackUserData); });

    // Next, using multiple threads, calculate shortest paths between every pair of probes.
    PathFinder pathFinder(probes, numThreads);
    Array<ProbePath, 2> probePaths(probes.numProbes(), probes.numProbes());

    if (cancel)
    {
        cancel = false;
        return;
    }

    jobGraph.reset();

    for (auto i = 0; i < probes.numProbes(); i++)
    {
        jobGraph.addJob([this, i, &scene, &probes, &probePaths, &pathFinder, radius, threshold, pathRange](int threadIndex, std::atomic<bool>&)
        {
            PROFILE_ZONE("BakedPathData::bakeJob");

            for (auto j = 0; j < probes.numProbes(); ++j)
            {
                probePaths[i][j].nodes.clear();
            }

            pathFinder.findAllShortestPaths(scene, probes, *mVisGraph, i, radius, threshold, pathRange, threadIndex, probePaths[i]);
        });
    }

    threadPool.process(jobGraph, [progressCallback, callbackUserData](float percentComplete) { progressCallback(percentComplete, callbackUserData); });

    // Remove all data with j > i, since they can be reconstructed from the data with j < i due to symmetry.
    ProbePath invalidProbePath;