Details

This optimized version of the algorithm is from Robert Bridson, University of British Columbia [1].

It takes parameter , the minimum distance between samples, and parameter , the number of tries to accept or reject a sample.

For storing samples and accelerating spatial searches, the method uses two additional arrays: grid and active.

Use the drop-down menu to select the shape.

Select the checkboxes to "show disks" and "show active" array.

The algorithm is not without drawbacks. It is interesting to observe when sometimes sampling of a two-part area goes wrong.

Reference

[1] R. Bridson. "Fast Poisson Disk Sampling in Arbitrary Dimensions." (Sep 1, 2023) www.cs.ubc.ca/~rbridson/docs/bridson-siggraph07-poissondisk.pdf.