.png){kind=icon}
返回
Efficient Maximal Poisson-Disk Sampling
.png){kind=icon}
OA
AI
DOI：10.1145/1964921.1964944.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We solve the problem of generating a uniform Poisson-disk sampling that is both maximal and unbiased over bounded non-convex domains. To our knowledge this is the first provably correct algorithm with time and space dependent only on the number of points produced. Our method has two phases, both based on classical dart-throwing. The first phase uses a background grid of square cells to rapidly create an unbiased, near-maximal covering of the domain. The second phase completes the maximal covering by calculating the connected components of the remaining uncovered voids, and by using their geometry to efficiently place unbiased samples that cover them. The second phase converges quickly, overcoming a common difficulty in dart-throwing methods. The deterministic memory is O(n) and the expected running time is O (n log n), where n is the output size, the number of points in the final sample. Our serial implementation verifies that the log n dependence is minor, and nearly O(n) performance for both time and memory is achieved in practice. We also present a parallel implementation on GPUs to demonstrate the parallel-friendly nature of our method, which achieves 2.4X the performance of our serial version.
Keyword:
Poisson disk
maximal
provable convergence
linear complexity
sampling
blue noise
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.5
论文数:
4.7K
被引数:
3.6W
机构
引用论文
Is Parkinson's disease acquired? Evidence from a geographic comparison with multiple sclerosis.png)
Neurology
NeurologyIF0
PREAI
分享收藏
Performance evaluation of solar still using evacuated tube collector with and without nanoparticles
PREAI
分享收藏
查看更多内容