60 points•7 comments•2h ago•by vismit2000•stripeacross.com ↗

Poisson Disk Sampling

Bridson’s 2007 algorithm partitions the space into a grid with cell size r^d to ensure at most one point per cell and builds samples by selecting points from an active list and drawing points from an annulus around each, up to k=30 attempts, with grid-based collision checks for efficiency. The article describes improvements including a 2D parental optimization to constrain sampling angles and a parameter c that adjusts the radius distribution to balance density and randomness, with empirical guidance such as c = -1.4 - 17/k. It also mentions applications like stippling and GPU-accelerated parallel implementations such as PixelPie and Poisson Cam.

Discussion (7)

No comments yet

Top
Trending
New
For You
Bookmarks
Dossier