[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

Capacity-constrained point distributions: a variant of Lloyd's method

Published: 27 July 2009 Publication History

Abstract

We present a new general-purpose method for optimizing existing point sets. The resulting distributions possess high-quality blue noise characteristics and adapt precisely to given density functions. Our method is similar to the commonly used Lloyd's method while avoiding its drawbacks. We achieve our results by utilizing the concept of capacity, which for each point is determined by the area of its Voronoi region weighted with an underlying density function. We demand that each point has the same capacity. In combination with a dedicated optimization algorithm, this capacity constraint enforces that each point obtains equal importance in the distribution. Our method can be used as a drop-in replacement for Lloyd's method, and combines enhancement of blue noise characteristics and density function adaptation in one operation.

Supplementary Material

JPG File (tps089_09.jpg)
Zip (86-196.zip)
CONTACT The full paper can be obtained from the ACM Digital Library or as a preliminary draft from our website http://graphics.uni-konstanz.de. Feel free to contact us via e-mail: [email protected] and [email protected].
MP4 File (tps089_09.mp4)

References

[1]
Aurenhammer, F., Hoffmann, F., and Aronov, B. 1998. Minkowski-type theorems and least-squares clustering. Algorithmica 20, 1, 61--76.
[2]
Balzer, M., and Heck, D. 2008. Capacity-constrained Voronoi diagrams in finite spaces. In Proceedings of the 5th Annual International Symposium on Voronoi Diagrams in Science and Engineering, vol. 2, 44--56.
[3]
Chen, L. 2004. Mesh smoothing schemes based on optimal Delaunay triangulations. In Proceedings of the 13th International Meshing Roundtable, 109--120.
[4]
Cook, R. L. 1986. Stochastic sampling in computer graphics. In Computer Graphics (Proceedings of SIGGRAPH 86), ACM, vol. 5, 51--72.
[5]
Dippé, M. A. Z., and Wold, E. H. 1985. Antialiasing through stochastic sampling. In Computer Graphics (Proceedings of SIGGRAPH 85), ACM, vol. 19, 69--78.
[6]
Du, Q., and Emelianenko, M. 2006. Acceleration schemes for computing centroidal Voronoi tessellations. Numerical Linear Algebra with Applications 13, 2--3, 173--192.
[7]
Du, Q., Faber, V., and Gunzburger, M. 1999. Centroidal Voronoi tessellations: Applications and algorithms. SIAM Review 41, 4, 637--676.
[8]
Dunbar, D., and Humphreys, G. 2006. A spatial data structure for fast Poisson-disk sample generation. In ACM Transactions on Graphics (Proceedings of SIGGRAPH 2006), ACM, vol. 25, 503--508.
[9]
Halton, J. H. 1970. A retrospective and perspective survey of the Monte Carlo method. SIAM Review 12, 1, 1--63.
[10]
Hiller, S., Deussen, O., and Keller, A. 2001. Tiled blue noise samples. In Proceedings of the Vision Modeling and Visualization Conference 2001, IOS Press, 265--272.
[11]
Jones, T. R. 2006. Efficient generation of Poisson-disk sampling patterns. Journal of Graphics Tools 11, 2, 27--36.
[12]
Kollig, T., and Keller, A. 2003. Efficient illumination by high dynamic range images. In Proceedings of the 14th Eurographics Workshop on Rendering, Eurographics Association, vol. 44, 45--50.
[13]
Kopf, J., Cohen-Or, D., Deussen, O., and Lischinski, D. 2006. Recursive Wang tiles for real-time blue noise. In ACM Transactions on Graphics (Proceedings of SIGGRAPH 2006), ACM, vol. 25, 509--518.
[14]
Lagae, A., and Dutré, P. 2006. An alternative for Wang tiles: Colored edges versus colored corners. ACM Transactions on Graphics 25, 4, 1442--1459.
[15]
Lagae, A., and Dutré, P. 2008. A comparison of methods for generating Poisson disk distributions. Computer Graphics Forum 27, 1, 114--129.
[16]
Liu, Y., Wang, W., Lévy, B., Sun, F., Yan, D.-M., Lu, L., and Yang, C. 2008. On centroidal Voronoi tessellation --- energy smoothness and fast computation. Tech. rep., Hong-Kong University and INRIA-ALICE Project Team.
[17]
Lloyd, S. P. 1982. Least square quantization in PCM. IEEE Transactions on Information Theory 28, 2, 129--137.
[18]
McCool, M., and Fiume, E. 1992. Hierarchical Poisson disk sampling distributions. Graphics Interface '92, 94--105.
[19]
Mitchell, D. P. 1987. Generating antialiased images at low sampling densities. In Computer Graphics (Proceedings of SIGGRAPH 87), ACM, vol. 21, 65--72.
[20]
Okabe, A., Boots, B., Sugihara, K., and Chiu, S. N. 2000. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 2nd ed. John Wiley and Sons Ltd.
[21]
Ostromoukhov, V., Donohue, C., and Jodoin, P.-M. 2004. Fast hierarchical importance sampling with blue noise properties. In ACM Transactions on Graphics (Proceedings of SIGGRAPH 2004), ACM, vol. 23, 488--495.
[22]
Ostromoukhov, V. 2007. Sampling with polyominoes. In ACM Transactions on Graphics (Proceedings of SIGGRAPH 2007), ACM, vol. 26, 78.
[23]
Pharr, M., and Humphreys, G. 2004. Physically Based Rendering: From Theory to Implementation. Morgan Kaufmann.
[24]
Secord, A. 2002. Weighted Voronoi stippling. In Proceedings of the Second International Symposium on Non-photorealistic Animation and Rendering, ACM, 37--43.
[25]
Surazhsky, V., Alliez, P., and Gotsman, C. 2003. Isotropic remeshing of surfaces: A local parameterization approach. In Proceedings of the 12th International Meshing Roundtable, 215--224.
[26]
Szabó, P. G., Markót, M. C., Csendes, T., Specht, E., Casado, L. G., and García, I. 2007. New Approaches to Circle Packing in a Square. Springer.
[27]
Ulichney, R. 1987. Digital halftoning. MIT Press.
[28]
Wei, L.-Y. 2008. Parallel Poisson disk sampling. In ACM Transactions on Graphics (Proceedings of SIGGRAPH 2008), ACM, vol. 27, 1--9.
[29]
White, K., Cline, D., and Egbert, P. 2007. Poisson disk point sets by hierarchical dart throwing. In Proceedings of the IEEE Symposium on Interactive Ray Tracing, 129--132.
[30]
Yellott, Jr., J. 1983. Spectral consequences of photoreceptor sampling in the rhesus retina. Science 12, 1, 382--385.

Cited By

View all
  • (2024)Differentiable Owen ScramblingACM Transactions on Graphics10.1145/368776443:6(1-12)Online publication date: 19-Dec-2024
  • (2024)Non‐Euclidean Sliced Optimal Transport SamplingComputer Graphics Forum10.1111/cgf.1502043:2Online publication date: 30-Apr-2024
  • (2024)An efficient approach of meshless node placement in three-dimensional subsurface flow modelingEngineering Analysis with Boundary Elements10.1016/j.enganabound.2024.105997169(105997)Online publication date: Dec-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Transactions on Graphics
ACM Transactions on Graphics  Volume 28, Issue 3
August 2009
750 pages
ISSN:0730-0301
EISSN:1557-7368
DOI:10.1145/1531326
Issue’s Table of Contents
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: 27 July 2009
Published in TOG Volume 28, Issue 3

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Lloyd's method
  2. Poisson disk point sets
  3. Voronoi tessellations
  4. blue noise
  5. capacity constraint
  6. importance sampling

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)52
  • Downloads (Last 6 weeks)7
Reflects downloads up to 31 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Differentiable Owen ScramblingACM Transactions on Graphics10.1145/368776443:6(1-12)Online publication date: 19-Dec-2024
  • (2024)Non‐Euclidean Sliced Optimal Transport SamplingComputer Graphics Forum10.1111/cgf.1502043:2Online publication date: 30-Apr-2024
  • (2024)An efficient approach of meshless node placement in three-dimensional subsurface flow modelingEngineering Analysis with Boundary Elements10.1016/j.enganabound.2024.105997169(105997)Online publication date: Dec-2024
  • (2023)Voronoi treemap in Manhattan distance and Chebyshev distanceInformation Visualization10.1177/1473871623116718122:3(246-264)Online publication date: 20-Apr-2023
  • (2023)Example-Based Sampling with Diffusion ModelsSIGGRAPH Asia 2023 Conference Papers10.1145/3610548.3618243(1-11)Online publication date: 10-Dec-2023
  • (2023)Curl Noise JitteringSIGGRAPH Asia 2023 Conference Papers10.1145/3610548.3618163(1-11)Online publication date: 10-Dec-2023
  • (2023)Patternshop: Editing Point Patterns by Image ManipulationACM Transactions on Graphics10.1145/359241842:4(1-14)Online publication date: 26-Jul-2023
  • (2023)Graphical Perception of Saliency-based Model ExplanationsProceedings of the 2023 CHI Conference on Human Factors in Computing Systems10.1145/3544548.3581320(1-15)Online publication date: 19-Apr-2023
  • (2023)Enhanced Digital Halftoning via Weighted Sigma-Delta ModulationSIAM Journal on Imaging Sciences10.1137/22M151786X16:3(1727-1761)Online publication date: 29-Aug-2023
  • (2022)Gaussian Blue NoiseACM Transactions on Graphics10.1145/3550454.355551941:6(1-15)Online publication date: 30-Nov-2022
  • Show More Cited By

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media