Stochastic Barnes-Hut Approximation for Fast Summation on the GPU
Stochastic Barnes-Hut Approximation for Fast Summation on the GPU
We present a novel stochastic version of the Barnes-Hut approximation. Regarding the level-of-detail (LOD) family of approximations as control variates, we construct an unbiased estimator of the kernel sum being approximated. Through several examples in graphics applications such as winding number computation and smooth distance evaluation, we demonstrate that our method is well-suited for GPU computation, capable of outperforming a GPU-optimized implementation of the deterministic Barnes-Hut approximation by achieving equal median error in up to 9.4x less time.
Abhishek Madan、Nicholas Sharp、Francis Williams、Ken Museth、David I. W. Levin
计算技术、计算机技术
Abhishek Madan,Nicholas Sharp,Francis Williams,Ken Museth,David I. W. Levin.Stochastic Barnes-Hut Approximation for Fast Summation on the GPU[EB/OL].(2025-06-02)[2025-06-19].https://arxiv.org/abs/2506.02219.点此复制
评论