Poisson disk sampling through disk packing

Abstract

Poisson disk sampling is an important problem in computer graphics and has a wide variety of applications in imaging, geometry, rendering, etc. In this paper, we propose a novel Poisson disk sampling algorithm based on disk packing. The key idea uses the observation that a relatively dense disk packing layout naturally satisfies the Poisson disk distribution property that each point is no closer to the others than a specified minimum distance, i.e., the Poisson disk radius. We use this property to propose a relaxation algorithm that achieves a good balance between the random and uniform properties needed for Poisson disk distributions. Our algorithm is easily adapted to image stippling by extending identical disk packing to unequal disks. Experimental results demonstrate the efficacy of our approaches.

Simulation of Motor Unit Action Potential Recordings From Intramuscular Multichannel Scanning Electrodes

“…FPS is a family of algorithms that fill a 2D domain by iteratively adding points that are maximally distant from the already added ones and from the region's borders. The FPS algorithms also permit to specify an arbitrary density function over the region [10], [11], [12].…”

Geometric remapping of particle distributions in the Discrete Element Model for Sea Ice (DEMSI v0.0)

“…Figure 1. Example of an element distribution generated with the algorithm of Liang et al (2015) showing the circular elements (grey), and the radical Voronoi tessellation (green).…”

Maximal Poisson-disk sampling by sampling radius optimization

“…这种基于均匀网格的方法被研 究者们在图形硬件单元上实现并行 Poisson 圆盘采样 (GPUs) [21∼23] , 该类方法比已有方法加速很多, 但是同样没有满足最大化性质. 最近, Liang 等 [24] 提出了一种基于圆盘填充 (disk packing) 的松弛算 法, 对于相同的 Poisson 圆盘半径, 在很好地平衡随机性和均匀性的情况下, 可以产生更多的采样点. 同样地, 该方法仍然不满足最大化采样性质.…”