Great point. Here's a visualization of what you're talking about: http://bl.ocks.org/mbostock/fe3f75700e70416e37cd http://bl.ocks.org/mbostock/fe3f75700e70416e

Great point. Here's a visualization of what you're talking about: http://bl.ocks.org/mbostock/fe3f75700e70416e37cd http://bl.ocks.org/mbostock/fe3f75700e70416e37cd >Uniform random is pretty terrible. There is both severe under- and oversampling: many samples are densely-packed, even overlapping, leading to large empty areas. (Uniform random sampling also represents the lower bound of quality for the best-candidate algorithm, as when the number of candidates per sample is set to one.) Taken from: http://bost.ocks.org/mike/algorithms/ http://bost.ocks.org/mike/algorithms/