PixelPie: maximal Poisson-disk sampling with rasterization

CY Ip, MA Yalçin, D Luebke, A Varshney - Proceedings of the 5th High …, 2013 - dl.acm.org
Proceedings of the 5th High-Performance Graphics Conference, 2013dl.acm.org
We present PixelPie, a highly parallel geometric formulation of the Poisson-disk sampling
problem on the graphics pipeline. Traditionally, generating a distribution by throwing darts
and removing conflicts has been viewed as an inherently sequential process. In this paper,
we present an efficient Poisson-disk sampling algorithm that uses rasterization in a highly
parallel manner. Our technique is an iterative two step process. The first step of each
iteration involves rasterization of random darts at varying depths. The second step involves …
We present PixelPie, a highly parallel geometric formulation of the Poisson-disk sampling problem on the graphics pipeline. Traditionally, generating a distribution by throwing darts and removing conflicts has been viewed as an inherently sequential process. In this paper, we present an efficient Poisson-disk sampling algorithm that uses rasterization in a highly parallel manner. Our technique is an iterative two step process. The first step of each iteration involves rasterization of random darts at varying depths. The second step involves culling conflicted darts. Successive iterations identify and fill in the empty regions to obtain maximal distributions. Our approach maps well to the parallel and optimized graphics functions on the GPU and can be easily extended to perform importance sampling. Our implementation can generate Poisson-disk samples at the rate of nearly 7 million samples per second on a GeForce GTX 580 and is significantly faster than the state-of-the-art maximal Poisson-disk sampling techniques.
ACM Digital Library