I was surprised to see the Wikipedia page didn’t mention any best-effort algorithms but I guess they can’t list everything.
I like the natural noise you get from Poisson Disc Sampling [1]
I like the natural noise you get from Poisson Disc Sampling [1]
It is a lot like a bubble sort in that it is O(n^2) and is useful in practice on tiny sets and as a benchmark.
(Also that link is very cool, but it looks closer to n-rooks / latin hypercube sampling in that it used a grid, which means it won't work in higher dimensions)