Bridson's algorithm (2007) generates O(n) blue noise: points uniformly distributed with minimum separation r. No two points are closer than r, yet no region of size r is empty — unlike pure random sampling, this avoids clumping and gaps.
Parameters
Points n—
Min sep r—
Coverage—
Cell size—
Bridson's algorithm: 1. Pick random seed 2. Active list: [seed] 3. Pick from active list 4. Try k candidates in [r,2r] 5. Accept if no conflict 6. If none accepted, remove
O(n) time, O(n) space Grid cells: at most 1 pt/cell