GoKawiilBridson's 2007 one-page paper still powers modern Poisson disk sampling algorithms
The piece revisits Robert Bridson's 2007 single-page paper, which offers a fast algorithm for placing random points—like trees in a procedurally generated forest—so no two fall closer than a set minimum distance. It contrasts this compact, widely-cited solution with a nearly 1,000-page 2024 proof of the geometric Langlands conjecture, highlighting the range of scales in mathematical work. The algorithm uses a grid and an active-point list to sample points efficiently in an annulus around existing points, avoiding the slowdown of naive rejection sampling.