Deterministic Uniform Disk Sampling: A Novel Algorithm

This article presents a deterministic algorithm for generating N uniformly distributed points on a disk with diameter D. The algorithm divides the disk into M concentric rings, proportionally allocating points based on ring circumference. It then samples in polar coordinates, converting to Cartesian coordinates for the final point locations. The algorithm cleverly handles the relationship between point count and ring radius, and provides a simple integerization method, ensuring exactly N points are generated.