Efficient Computation of Blue Noise Point Sets through Importance Sampling
| dc.contributor.author | Kalantari, Nima Khademi | en_US |
| dc.contributor.author | Sen, Pradeep | en_US |
| dc.contributor.editor | Ravi Ramamoorthi and Erik Reinhard | en_US |
| dc.date.accessioned | 2015-02-27T14:45:06Z | |
| dc.date.available | 2015-02-27T14:45:06Z | |
| dc.date.issued | 2011 | en_US |
| dc.description.abstract | Dart-throwing can generate ideal Poisson-disk distributions with excellent blue noise properties, but is very computationally expensive if a maximal point set is desired. In this paper, we observe that the Poisson-disk sampling problem can be posed in terms of importance sampling by representing the available space to be sampled as a probability density function (pdf). This allows us to develop an efficient algorithm for the generation of maximal Poisson-disk distributions with quality similar to naïve dart-throwing but without rejection of samples. In our algorithm, we first position samples in one dimension based on its marginal cumulative distribution function (cdf). We then throw samples in the other dimension only in the regions which are available for sampling. After each 2D sample is placed, we update the cdf and data structures to keep track of the available regions. In addition to uniform sampling, our method is able to perform variable-density sampling with small modifications. Finally, we also propose a new min-conflict metric for variable-density sampling which results in better adaptation of samples to the underlying importance field. | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.2011.01980.x | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2011.01980.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
| dc.title | Efficient Computation of Blue Noise Point Sets through Importance Sampling | en_US |