5 ms·
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 fr
by cbisnett 6y ago
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]
[1] https://bl.ocks.org/mbostock/dbb02448b0f93e4c82c3 https://bl.ocks.org/mbostock/dbb02448b0f93e4c82c3
- BubRoss 6y agoPoisson disc sampling is a brute force technique and isn't an analytic method for packing. Any sample pattern can be relaxed if you are finding neighbor points and using multiple iterations. Poisson sampling is just trying and rejecting many samples based on their neighbors' distances, there aren't any deep principles being used. 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)
- deleted 6y ago[deleted]