research-article

Accurate multidimensional Poisson-disk sampling

Authors:

Manuel N. Gamito,

Steve C. MaddockAuthors Info & Claims

ACM Transactions on Graphics (TOG), Volume 29, Issue 1

Article No.: 8, Pages 1 - 19

https://doi.org/10.1145/1640443.1640451

Published: 15 December 2009 Publication History

Abstract

We present an accurate and efficient method to generate samples based on a Poisson-disk distribution. This type of distribution, because of its blue noise spectral properties, is useful for image sampling. It is also useful for multidimensional Monte Carlo integration and as part of a procedural object placement function. Our method extends trivially from 2D to 3D or to any higher dimensional space. We demonstrate results for up to four dimensions, which are likely to be the most useful for computer graphics applications. The method is accurate because it generates distributions with the same statistical properties of those generated with the brute-force dart-throwing algorithm, the archetype against which all other Poisson-disk sampling methods are compared. The method is efficient because it employs a spatial subdivision data structure that signals the regions of space where the insertion of new samples is allowed. The method has O(N log N) time and space complexity relative to the total number of samples. The method generates maximal distributions in which no further samples can be inserted at the completion of the algorithm. The method is only limited in the number of samples it can generate and the number of dimensions over which it can work by the available physical memory.

References

[1]

Arvo, J. 1990. A simple method for box-sphere intersection testing. In Graphics Gems, A. S. Glassner, Ed. Academic Press Professional, San Diego, CA, 335--339.

Digital Library

[2]

Baddeley, A. and Møller, J. 1989. Nearest-Neighbour Markov point processes and random sets. Int. Statist. Rev. 57, 2, 89--121.

[3]

Bartlett, M. S. 1974. The statistical analysis of spatial pattern. Adv. App. Probab. 6, 2, 336--358.

[4]

Bridson, R. 2007. Fast Poisson disk sampling in arbitrary dimensions. In ACM SIGGRAPH'07 Sketches and Applications. ACM Press, 22.

Digital Library

[5]

Cline, D., Jeschke, S., White, K., Razdan, A., and Wonka, P. 2009. Dart throwing on surfaces. Comput. Graph. Forum 28, 4, 1217--1226.

Digital Library

[6]

Cohen, M. F., Shade, J., Hiller, S., and Deussen, O. 2003. Wang tiles for image and texture generation. ACM Trans. Graph. 22, 3, 287--294.

Digital Library

[7]

Cook, R. L. 1986. Stochastic sampling in computer graphics. ACM Trans. Graph. 5, 1, 51--72.

Digital Library

[8]

Deussen, O., Hanrahan, P., Lintermann, B., Mech, R., Pharr, M., and Prusinkiewicz, P. 1998. Realistic modelling and rendering of plant ecosystems. In Proceedings of the SIGGRAPH'98 Conference, M. Cohen, Ed. Vol. 22. ACM Press, 275--286.

Digital Library

[9]

Deussen, O., Hiller, S., van Overveld, C., and Strothotte, T. 2000. Floating points: A method for computing stipple drawings. Comput. Graph. Forum 19, 3, 40--51.

[10]

Dickman, R., Wang, J.-S., and Jensen, I. 1991. Random sequential adsorption: Series and virial expansions. J. Chem. Phy. 94, 12, 8252--8257.

[11]

Diggle, P. J., Besag, J., and Gleaves, J. T. 1976. Statistical analysis of spatial point patterns by means of distance methods. Biometrics 32, 3, 659--667.

[12]

Dippé, M. A. Z. and Wold, E. H. 1985. Antialiasing through stochastic sampling. In Proceedings of the SIGGRAPH'85 Conference, B. A. Barsky, Ed. Vol. 19, 69--78.

Digital Library

[13]

Donev, A., Torquato, S., and Stillinger, F. H. 2005. Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. I. Algorithmic details. J. Comput. Phys. 202, 2, 737--764.

Digital Library

[14]

Dunbar, D. and Humphreys, G. 2006. A spatial data structure for fast Poisson-disk sample generation. ACM Trans. Graph. 25, 3, 503--508.

Digital Library

[15]

Dutré, P., Bala, K., and Bekaert, P. 2006. Advanced Global Illumination, 2nd Ed. AK Peters Ltd, Wellesley, MA.

Digital Library

[16]

Feng, L., Hotz, I., Hamman, B., and Joy, K. I. 2008. Anisotropic noise samples. IEEE Trans. Visualiz. Comput. Graph. 14, 2, 342--354.

Digital Library

[17]

Fu, Y. and Zhou, B. 2008. Direct sampling on surfaces for high quality remeshing. In Proceedings of the ACM Symposium on Solid and Physical Modeling, E. Haines and M. McGuire, Eds. ACM Press, 115--124.

Digital Library

[18]

Glassner, A. S. 1995. Principles of Digital Image Synthesis. The Morgan Kaufmann Series in Computer Graphics. Morgan Kaufmann Publishers, San Francisco, CA.

Digital Library

[19]

Hachisuka, T., Jarosz, W., Weistroffer, R. P., Dale, K., Humphreys, G., Zwicker, M., and Jensen, H. W. 2008. Multi-Dimensional adaptive sampling and reconstruction for ray tracing. ACM Trans. Graph. 27, 3, 33:1--33:10.

Digital Library

[20]

Hiller, S., Deussen, O., and Keller, A. 2001. Tiled blue noise samples. In Vision, Modeling and Visualization 2001, B. Girod, G. Greiner, H. Niemann, and H.-P. Seidel, Eds. Akademische Verlagsgesellschaft Aka GmbH, Berlin, 256--272.

Digital Library

[21]

Jaeger, H. M. and Nagel, S. R. 1992. Physics of the granular state. Sci. 255, 5051, 1523--1531.

[22]

Jones, T. R. 2006. Efficient generation of Poisson-disk sampling patterns. J. Graph. Tools 11, 2, 27--36.

[23]

Kopf, J., Cohen-Or, D., Deussen, O., and Lichinsky, D. 2006. Recursive Wang tiles for real-time blue noise. ACM Trans. Graph. 25, 3, 509--518.

Digital Library

[24]

Lagae, A. and Dutré, P. 2005. A procedural object distribution function. ACM Trans. Graph. 24, 4, 1442--1461.

Digital Library

[25]

Lagae, A. and Dutré, P. 2006a. An alternative for Wang tiles: Colored edges versus colored corners. ACM Trans. Graph. 25, 4, 1442--1459.

Digital Library

[26]

Lagae, A. and Dutré, P. 2006b. Poisson sphere distributions. In Vision, Modeling and Visualization 2006, L. Kobbelt, T. Kuhlen, T. Aach, and R. Westermann, Eds. Akademische Verlagsgesellschaft Aka GmbH, Berlin, 373--379.

[27]

Lagae, A. and Dutré, P. 2008. A comparison of methods for generating Poisson disk distributions. Comput. Graph. Forum 27, 1, 114--129.

[28]

Larsson, T., Akenine-Möller, T., and Lengyel, E. 2007. On faster sphere-box overlap testing. J. Graph. Tools 12, 1, 3--8.

[29]

Lehtinen, J., Zwicker, M., Turquin, E., Kontkanen, J., Durand, F., Sillion, F. X., and Aila, T. 2008. A meshless hierarchical representation for light transport. ACM Trans. Graph. 27, 3, 37.

Digital Library

[30]

Leneman, O. A. Z. 1966. Random sampling of random processes: Impulse processes. Inf. Control 9, 4, 347--363.

[31]

Lewis, J.-P. 1989. Algorithms for solid noise synthesis. In Proceedings of the SIGGRAPH'89 Conference, J. Lane, Ed. Vol. 23. ACM Press, 263--270.

Digital Library

[32]

Li, H., Lo, K.-Y., Leung, M.-K., and Fu, C.-W. 2008. Dual Poisson-disk tiling: An efficient method for distributing features on arbitrary surfaces. IEEE Trans. Visualiz. Comput. Graph. 14, 5, 982--998.

Digital Library

[33]

Lloyd, S. P. 1982. Least squares quantization in PCM. IEEE Trans. Inf. Theory 28, 2, 129--137.

Digital Library

[34]

Lubachevsky, B. D. and Stillinger, F. H. 1990. Geometric properties of random disk packings. J. Statist. Phys. 60, 5-6, 561--583.

[35]

Lubachevsky, B. D., Stillinger, F. H., and Pinson, E. N. 1991. Disks vs. spheres: Contrasting properties of random packings. J. Statist. Phys. 64, 3-4, 501--524.

[36]

Matérn, B. 1960. Spatial variation. Meddelanden från Statens Skogsforskningsinstitut 49, 1--144.

[37]

McCool, M. and Fiume, E. 1992. Hierarchical Poisson disk sampling distributions. In Proceedings of Graphics Interface'92. Canadian Information Processing Society, 94--105.

Digital Library

[38]

Mitchell, D. P. 1987. Generating antialiased images at low sampling densities. In Proceedings of the SIGGRAPH'87 Conference, M. C. Stone, Ed. Annual Conference Series, vol. 21. ACM Press, 65--72.

Digital Library

[39]

Mitchell, D. P. 1991. Spectrally optimal sampling for distribution ray tracing. In Proceedings of the SIGGRAPH'91 Conference, T. W. Sederberg, Ed. Vol. 25. ACM Press, 157--164.

Digital Library

[40]

Ostromoukhov, V. 2007a. Building 2D low-discrepancy sequences for hierarchical importance sampling using dodecagonal aperiodic tiling. In Proceedings of GraphiCon'07. 139--142.

[41]

Ostromoukhov, V. 2007b. Sampling with polyominoes. ACM Trans. Graph. 26, 3, 78.

Digital Library

[42]

Ostromoukhov, V., Donohue, C., and Jodoin, P.-M. 2004. Fast hierarchical importance sampling with blue noise properties. ACM Trans. Graph. 23, 3, 488--495.

Digital Library

[43]

Press, W. H., Teukolsky, S. A., Vetterling, W. T., and Flannery, B. P. 1992. Numerical Recipes in C: The Art of Scientific Computing 2nd Ed. Cambridge University Press.

Digital Library

[44]

Ripley, B. D. 1977. Modelling spatial patterns. J. Royal Statist. Soc. Series B 39, 172--212.

[45]

Samet, H. 1990. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA.

Digital Library

[46]

Secord, A., Heidrich, W., and Streit, L. 2002. Fast primitive distribution for illustration. In Proceedings of the 13th Eurographics Workshop on Rendering Techniques, S. Gibson and P. Debevec, Eds. Eurographics Association, 215--226.

Digital Library

[47]

Shirley, P. 1992. Nonuniform random point sets via warping. In Graphics Gems III, D. Kirk, Ed. Academic Press, San Diego, CA, 80--83.

Digital Library

[48]

Skoge, M., Donev, A., Stillinger, F. H., and Torquato, S. 2006. Packing hyperspheres in high-dimensional Euclidean spaces. Phys. Rev. E 74, 4, 041127.

[49]

Snyder, D. L. 1991. Random Point Processes in Time and Space, 2nd Ed. Springer-Verlag, Berlin.

[50]

Ulichney, R. A. 1988. Dithering with blue noise. Proc. IEEE 76, 1, 56--79.

[51]

Wei, L.-Y. 2008. Parallel poisson disk sampling. ACM Trans. Graphi. 27, 3, 20.

Digital Library

[52]

Weisstein, E. W. Hypersphere packing. From MathWorld—A Wolfram Web Resource.

[53]

White, K. B., Cline, D., and Egbert, P. K. 2007. Poisson disk point sets by hierarchical dart throwing. In Proceedings of the IEEE/Eurographics Symposium on Interactive Ray Tracing, A. Keller and P. Christensen, Eds. IEEE Press, 129--132.

Digital Library

[54]

Worley, S. P. 1996. A cellular texture basis function. In Proceedings of the SIGGRAPH'96 Conference, H. Rushmeier, Ed. Vol. 30. ACM Press, 291--294.

Digital Library

[55]

Yellot, Jr, J. I. 1983. Spectral consequences of photoreceptor sampling in the rhesus retina. Sci. 221, 382--395.

Cited By

Margerit WCharpentier AMaugis-Rabusseau CSchön JTarrat NCortés J(2023)IGLOO: An Iterative Global Exploration and Local Optimization Algorithm to Find Diverse Low-Energy Conformations of Flexible MoleculesAlgorithms10.3390/a1610047616:10(476)Online publication date: 12-Oct-2023
https://doi.org/10.3390/a16100476
Doignies BBonneel NCoeurjolly DDigne JPaulin LIehl JOstromoukhov V(2023)Example-Based Sampling with Diffusion ModelsSIGGRAPH Asia 2023 Conference Papers10.1145/3610548.3618243(1-11)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.1145/3610548.3618243
Monasse PDjahel RVallet B(2023)Registration for Urban Modeling Based on Linear and Planar Features2023 11th European Workshop on Visual Information Processing (EUVIP)10.1109/EUVIP58404.2023.10323059(1-8)Online publication date: 11-Sep-2023
https://doi.org/10.1109/EUVIP58404.2023.10323059
Show More Cited By

Index Terms

Accurate multidimensional Poisson-disk sampling
1. Computing methodologies
  1. Artificial intelligence
    1. Computer vision
      1. Image and video acquisition
  2. Computer graphics
    1. Image manipulation
      1. Texturing
    2. Rendering

Recommendations

Gap processing for adaptive maximal poisson-disk sampling

In this article, we study the generation of maximal Poisson-disk sets with varying radii. First, we present a geometric analysis of gaps in such disk sets. This analysis is the basis for maximal and adaptive sampling in Euclidean space and on manifolds. ...
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 ...
PixelPie: maximal Poisson-disk sampling with rasterization
HPG '13: Proceedings of the 5th High-Performance Graphics Conference

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 ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Graphics

ACM Transactions on Graphics Volume 29, Issue 1

December 2009

127 pages

ISSN:0730-0301

EISSN:1557-7368

DOI:10.1145/1640443

Issue’s Table of Contents

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 December 2009

Accepted: 01 September 2009

Revised: 01 August 2009

Received: 01 August 2007

Published in TOG Volume 29, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Fundação para a Ciência e a Tecnologia

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

71
Total Citations
View Citations
1,375
Total Downloads

Downloads (Last 12 months)57
Downloads (Last 6 weeks)6

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Margerit WCharpentier AMaugis-Rabusseau CSchön JTarrat NCortés J(2023)IGLOO: An Iterative Global Exploration and Local Optimization Algorithm to Find Diverse Low-Energy Conformations of Flexible MoleculesAlgorithms10.3390/a1610047616:10(476)Online publication date: 12-Oct-2023
https://doi.org/10.3390/a16100476
Doignies BBonneel NCoeurjolly DDigne JPaulin LIehl JOstromoukhov V(2023)Example-Based Sampling with Diffusion ModelsSIGGRAPH Asia 2023 Conference Papers10.1145/3610548.3618243(1-11)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.1145/3610548.3618243
Monasse PDjahel RVallet B(2023)Registration for Urban Modeling Based on Linear and Planar Features2023 11th European Workshop on Visual Information Processing (EUVIP)10.1109/EUVIP58404.2023.10323059(1-8)Online publication date: 11-Sep-2023
https://doi.org/10.1109/EUVIP58404.2023.10323059
Ahmed ARen JWonka P(2022)Gaussian Blue NoiseACM Transactions on Graphics10.1145/3550454.355551941:6(1-15)Online publication date: 30-Nov-2022
https://dl.acm.org/doi/10.1145/3550454.3555519
Giunchi DSztrajman ASteed A(2022)Fast Blue-Noise Generation via Unsupervised Learning2022 International Joint Conference on Neural Networks (IJCNN)10.1109/IJCNN55064.2022.9892330(1-6)Online publication date: 18-Jul-2022
https://doi.org/10.1109/IJCNN55064.2022.9892330
Jiang YZhao YChoi CChoo J(2022)Hybrid continuum–discrete simulation of granular impact dynamicsActa Geotechnica10.1007/s11440-022-01598-217:12(5597-5612)Online publication date: 11-Jun-2022
https://doi.org/10.1007/s11440-022-01598-2
Torres TAnselmi NNayeri PRocca PHaupt R(2021)Low Discrepancy Sparse Phased Array AntennasSensors10.3390/s2123781621:23(7816)Online publication date: 24-Nov-2021
https://doi.org/10.3390/s21237816
Ahmed AWonka P(2021)Optimizing dyadic netsACM Transactions on Graphics10.1145/3450626.345988040:4(1-17)Online publication date: 19-Jul-2021
https://dl.acm.org/doi/10.1145/3450626.3459880
Muniraju GKailkhura BThiagarajan JBremer PTepedelenlioglu CSpanias A(2021)Coverage-Based Designs Improve Sample Mining and Hyperparameter OptimizationIEEE Transactions on Neural Networks and Learning Systems10.1109/TNNLS.2020.298293632:3(1241-1253)Online publication date: Mar-2021
https://doi.org/10.1109/TNNLS.2020.2982936
Cadet CBesson JFlouriot SForest SKerfriden Pde Rancourt V(2021)Ductile fracture of materials with randomly distributed voidsInternational Journal of Fracture10.1007/s10704-021-00562-7Online publication date: 7-Jul-2021
https://doi.org/10.1007/s10704-021-00562-7
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents