用于多维网格可见性的超几何桥
Hypergeometric Bridges for Multidimensional Grid Visibility
AI总结:
本文提出统一数学框架,定义超几何桥,实现线性时间并行求解器,在三维网格可见性计算中,其OpenMP求解器在CPU对比中吞吐量最高。
摘要:
已有的基于插值的方法可利用距源更近的网格单元计算出的值,高效计算从单个源到所有网格单元的可见性。即使在仅包含自由单元或完全阻挡单元的二元网格上,插值也会产生分数值。二维路径计数理论将这些值解释为无阻挡网格路径的分数,但三维方法使用不同的前驱结构。如何在所有维度以及非二元网格上一致地解释这些值,仍是未解决的问题。本文提供了一个统一的数学框架,为任意维度下的每个可见性值赋予精确含义;确定了网格细化何时会最终与连续可见性一致,实现了并行求解器,并在精度和吞吐量方面比较了四种三维方法。本文定义了单元传输:0 表示阻挡可见性,1 表示保留可见性,中间值则按比例衰减可见性。本文证明,每个计算出的值等于有限多条源到单元网格路径上传输乘积的均匀有限路径平均;在二元网格上,该值为清晰路径的分数;在非二元网格上,该值为路径传输的均值。对于源-目标查询,每一步通过单元的路径分数在二维中形成超几何分布,本文将其称为超几何桥;在进入目标的最后一步,这些概率等于插值权重;更高维度的插值权重则由超几何桥的乘积产生。对于任意固定维度,全场算法的时间复杂度仍与网格大小呈线性关系;精确路径枚举可复现所有已检查的可见性值;NumPy、OpenMP 和 CUDA 的数值结果一致,且本文的 OpenMP 求解器在所有测试分辨率下的 CPU 四方法对比中实现了最高吞吐量。
英文摘要:
Established interpolation-based methods efficiently compute visibility from one source to every grid cell using values computed closer to the source. Interpolation yields fractional values even on binary grids of free or fully blocking cells. Two-dimensional path-counting theory interprets these values as fractions of unobstructed grid paths, but three-dimensional methods use different predecessor structures. Interpreting these values consistently across dimensions and on nonbinary grids remains unresolved. We provide a unified mathematical account that gives every visibility value a precise meaning in any dimension. We establish when grid refinement yields eventual agreement with continuous visibility, implement parallel solvers, and compare four three-dimensional methods in accuracy and throughput. We define cell transmission: zero blocks visibility, one preserves it, and intermediate values attenuate it proportionally. We prove each computed value equals the uniform finite-path average of transmission products over finitely many source-to-cell grid paths. It is the fraction of clear paths on binary grids and the mean path transmission on nonbinary grids. For a source--target query, the fractions of paths passing through cells at each step form a hypergeometric distribution in 2D, which we call the hypergeometric bridge. On the last step into the target, these probabilities equal the interpolation weights. Higher-dimensional interpolation weights arise from products of hypergeometric bridges. For any fixed dimension, the full-field algorithm remains linear in grid size. Exact path enumeration reproduces every checked visibility value. NumPy, OpenMP, and CUDA agree numerically, and our OpenMP solver achieves the highest throughput in the four-method CPU comparison at every tested resolution.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。