Stochastic sampling in computer graphics
ACM Transactions on Graphics (TOG)
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Wang Tiles for image and texture generation
ACM SIGGRAPH 2003 Papers
Bilateral Filtering for Gray and Color Images
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Fast hierarchical importance sampling with blue noise properties
ACM SIGGRAPH 2004 Papers
Recursive Wang tiles for real-time blue noise
ACM SIGGRAPH 2006 Papers
ACM SIGGRAPH 2007 papers
Parallel Poisson disk sampling
ACM SIGGRAPH 2008 papers
Capacity-constrained point distributions: a variant of Lloyd's method
ACM SIGGRAPH 2009 papers
On centroidal voronoi tessellation—energy smoothness and fast computation
ACM Transactions on Graphics (TOG)
Bilateral Filtering
Anisotropic blue noise sampling
ACM SIGGRAPH Asia 2010 papers
Spectral sampling of manifolds
ACM SIGGRAPH Asia 2010 papers
Blue-noise point sampling using kernel density model
ACM SIGGRAPH 2011 papers
Efficient maximal poisson-disk sampling
ACM SIGGRAPH 2011 papers
Differential domain analysis for non-uniform sampling
ACM SIGGRAPH 2011 papers
Farthest-point optimized point sets with maximized minimum distance
Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics
Efficient and good Delaunay meshes from random points
Computer-Aided Design
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
Least squares quantization in PCM
IEEE Transactions on Information Theory
A Low-Memory, Straightforward and Fast Bilateral Filter Through Subsampling in Spatial Domain
Computer Graphics Forum
A Simple Algorithm for Maximal Poisson-Disk Sampling in High Dimensions
Computer Graphics Forum
Parallel Blue-noise Sampling by Constrained Farthest Point Optimization
Computer Graphics Forum
Blue noise through optimal transport
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
A fast algorithm for well-spaced points and approximate delaunay graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry
Hi-index | 0.00 |
We explore the notion of a Well-spaced Blue-noise Distribution (WBD) of points, which combines two desirable properties. First, the point distribution is random, as measured by its spectrum having blue noise. Second, it is well-spaced in the sense that the minimum separation distance between samples is large compared to the maximum coverage distance between a domain point and a sample, i.e. its Voronoi cell aspect ratios 2@b^i are small. It is well known that maximizing one of these properties destroys the other: uniform random points have no aspect ratio bound, and the vertices of an equilateral triangular tiling have no randomness. However, we show that there is a lot of room in the middle to get good values for both. Maximal Poisson-disk sampling provides @b=1 and blue noise. We show that a standard optimization technique can improve the well-spacedness while preserving randomness. Given a random point set, our Opt-@b^i algorithm iterates over the points, and for each point locally optimizes its Voronoi cell aspect ratio 2@b^i. It can improve @b^i to a large fraction of the theoretical bound given by a structured tiling: improving from 1.0 to around 0.8, about half-way to 0.58, while preserving most of the randomness of the original set. In terms of both @b and randomness, the output of Opt-@b^i compares favorably to alternative point improvement techniques, such as centroidal Voronoi tessellation with a constant density function, which do not target @b directly. We demonstrate the usefulness of our output through meshing and filtering applications. An open problem is constructing from scratch a WBD distribution with a guarantee of @b