Quasi-uniform designs from random candidates: optimal candidate complexity and farthest-point sampling

We study randomized constructions of quasi-uniform designs on a compact metric-measure space satisfying two-sided polynomial ball-growth conditions. Given integers $N\le M$, we first draw $M$ independent candidate points and then retain the first $N$ points of a farthest-point traversal of the candi