Parallel Poisson disk sampling
ACM SIGGRAPH 2008 papers
Direct sampling on surfaces for high quality remeshing
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Capacity-constrained point distributions: a variant of Lloyd's method
ACM SIGGRAPH 2009 papers
Direct sampling on surfaces for high quality remeshing
Computer Aided Geometric Design
Accurate multidimensional Poisson-disk sampling
ACM Transactions on Graphics (TOG)
Multi-class blue noise sampling
ACM SIGGRAPH 2010 papers
Parallel Poisson disk sampling with spectrum analysis on surfaces
ACM SIGGRAPH Asia 2010 papers
Anisotropic blue noise sampling
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
Efficient and good Delaunay meshes from random points
Computer-Aided Design
Statistical measures of two dimensional point set uniformity
Computational Statistics & Data Analysis
Applications of Geometry Processing: Blue noise sampling of surfaces
Computers and Graphics
A Simple Algorithm for Maximal Poisson-Disk Sampling in High Dimensions
Computer Graphics Forum
Fast Generation of Approximate Blue Noise Point Sets
Computer Graphics Forum
Analysis and synthesis of point distributions based on pair correlation
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
Efficient computation of blue noise point sets through importance sampling
EGSR'11 Proceedings of the Twenty-second Eurographics conference on Rendering
EGSR'09 Proceedings of the Twentieth Eurographics conference on Rendering
Implicit skinning: real-time skin deformation with contact modeling
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Line segment sampling with blue-noise properties
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
PixelPie: maximal Poisson-disk sampling with rasterization
Proceedings of the 5th High-Performance Graphics Conference
Gap processing for adaptive maximal poisson-disk sampling
ACM Transactions on Graphics (TOG)
k-d Darts: Sampling by k-dimensional flat searches
ACM Transactions on Graphics (TOG)
| Hi-index | 0.00 |
Poisson disk point sets are “ideally” generated through a process of dart throwing. The naive dart throwing algorithm is extremely expensive if a maximal set is desired, however. In this paper we present a hierarchical dart throwing procedure which produces point sets that are equivalent to naive dart throwing, but is very fast. The procedure works by intelligently excluding areas known to be fully covered by existing samples. By excluding covered regions, the probability of accepting a thrown dart is greatly increased. Our algorithm is conceptually simple, performs dart throwing in O(N) time and memory, and produces a maximal point set up to the precision of the numbers being used.