Parallel and accurate Poisson disk sampling on arbitrary surfaces
SIGGRAPH Asia 2011 Sketches
Hi-index | 0.00 |
This paper presents a simple yet effective algorithm to improve an arbitrary Poisson disk sampling in R2 and R3 to reach the maximal property, i.e., no more Poisson disk can be inserted. Taking a non-maximal Poisson disk sampling as input, our algorithm efficiently detects the regions allowing additional samples and then generates Poisson disks in these regions. The key idea is to convert the complicated plane or space searching problem into a simple searching on circles or spheres, which is one dimensional lower than the original sampling domain. Our algorithm is memory efficient, fully parallel and highly fast by using modern graphics card.