Rewriting Barnes-Hut as a telescoping sum yields an unbiased stochastic kernel-sum estimator that runs faster than deterministic Barnes-Hut on a GPU at low sample counts.
InProceedings of the 27th Spring Conference on Computer Graphics
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GR 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Stochastic Barnes-Hut Approximation for Fast Summation on the GPU
Rewriting Barnes-Hut as a telescoping sum yields an unbiased stochastic kernel-sum estimator that runs faster than deterministic Barnes-Hut on a GPU at low sample counts.