如何使用简单的高斯分布算法在平面上分布点？

Question

What I seek is to turn a grid into a somewhat "random" plane of tiles.

I tried just multiplying Math.random() individually with the width and height of the plane (in this case its 800 / 600). The circles you see there are points that intersect each other and have been removed from the scene.

As you can see, it looks very far from an "evenly distributed" field of points. There are large holes and just as bad, clusters of points can be seen.

What I am looking for is a way to distribute these points better to have a minimum amount of clusters and holes. Ideally, to have a value that is the minimum distance between any two points, while having the maximum number of points that can fit in the area. I am fine with approximations of all kinds, I just don't want to attempt to do a greedy distribution.

Whatever ecma solution you give its fine, I can convert it to Actionscript.

I have found a visual example. The left side is what I got and the right is what I aim for.

Answer 1

You can try Loyds algorithm, ie centroidal weighted voronoi diagrams. Compute the vd and then the center of gravity of each cell. Replace the old points and rinse and repeat: http://www-cs-students.stanford.edu/~amitp/game-programming/polygon-map-generation/ .