# Optimal distribution of points over the surface of a sphere

How can one generate a distribution of N points over the surface of a sphere so that the all N voronoi cells have the same area? Which is the best algorithm for this?

-
You need to describe this rather more precisely. Do you want the points randomly distributed or as far apart as possible? For example, if you had two points you might want the second to be exactly opposite the first, with no randomness in that relationship. And what do you mean by distance between each pair of points to be as long as possible? For example the shortest distance between any two points, or the total sum of the squares of the distances between all pairs of points? – Henry Sep 21 '11 at 13:54
thanks, now I guess it is more clear – flow Sep 21 '11 at 14:10
I doubt that this measures what you want it to measure. For instance, if you have three points, the maximal sum of squared distances is achieved if two points are the same and the third is opposite to them (for a sum of $2(\pi r)^2$), whereas what I suspect you'd want is for the three points to form an equilateral triangle on a great circle (for a sum of $(4/3)(\pi r)^2$). – joriki Sep 21 '11 at 14:31
Related to math.stackexchange.com/questions/31619/… – lhf Sep 21 '11 at 14:32
ok, I reedited it again – flow Sep 21 '11 at 14:43