Capacity-constrained point distributions
- 27 July 2009
- journal article
- conference paper
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 28 (3) , 1-8
- https://doi.org/10.1145/1531326.1531392
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.Keywords
This publication has 21 references indexed in Scilit:
- A Comparison of Methods for Generating Poisson Disk DistributionsComputer Graphics Forum, 2007
- An alternative for Wang tilesACM Transactions on Graphics, 2006
- Acceleration schemes for computing centroidal Voronoi tessellationsNumerical Linear Algebra with Applications, 2006
- Efficient Generation of Poisson-Disk Sampling PatternsJournal of Graphics Tools, 2006
- Centroidal Voronoi Tessellations: Applications and AlgorithmsSIAM Review, 1999
- Minkowski-Type Theorems and Least-Squares ClusteringAlgorithmica, 1998
- Stochastic sampling in computer graphicsACM Transactions on Graphics, 1986
- Spectral Consequences of Photoreceptor Sampling in the Rhesus RetinaScience, 1983
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982
- A Retrospective and Prospective Survey of the Monte Carlo MethodSIAM Review, 1970