Active point
Dead (full neighborhood)
Accepted candidate
Rejected candidate
This 2D companion runs the real, grid-accelerated Bridson algorithm step by step on a plain canvas instead of a decorative dot field: a background grid sized r/√2 drives O(1) neighbor checks, an active list of growable points is drawn from at random each step, up to k candidates are tried in the annulus between r and 2r around the chosen point, and the minimum-distance constraint is enforced exactly — no accepted point ever sits closer than r to another.