Robert Bridson
ABSTRACT
In many applications in graphics, particularly rendering, generating samples from a blue noise distribution is important. However, existing efficient techniques do not easily generalize beyond two dimensions. Here I demonstrate a simple modification to dart throwing which permits generation of Poisson disk samples in O(N) time, easily implemented in arbitrary dimension.
Supplemental Material
Available for Download
- Cook, R. L. 1986. Stochastic sampling in computer graphics. ACM Trans. Graph. 5, 1. Google Scholar
Digital Library
- Dunbar, D., and Humphreys, G. 2006. A spatial data structure for fast poisson-disk sample generation. ACM Trans. Graph. 25, 3, 503--508. Google ScholarDigital Library
Index Terms
Fast Poisson disk sampling in arbitrary dimensions
Recommendations
Parallel Poisson disk sampling
Sampling is important for a variety of graphics applications include rendering, imaging, and geometry processing. However, producing sample sets with desired efficiency and blue noise statistics has been a major challenge, as existing methods are either ...
Efficient maximal poisson-disk sampling
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 ...
Efficient maximal poisson-disk sampling
SIGGRAPH '11: ACM SIGGRAPH 2011 papersWe 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 ...
Comments