Get the latest tech news
Non-random uniform disk sampling
Consider the problem of generating N points on a disk of diameter D. The function must be deterministic and the points somewhat uniformly spread around on th...
Let's look at what values are possible for M. Using the reasonable constraint that we want α>1 this gives this quadratic inequality for choosing M: And since we obviously want a positive number of rings, this gives us bounds for M. Let's looks at the roots of this polynomial for integer values between 1 and 20: This is quick and easy, and the last ring is the one with the most points, making this choice hardly noticeable.
Or read this on Hacker News