Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

How could I write an algorithm to generate n points distributed 'evenly' on a sphere? I already wrote an algorithm to generate points distributed uniformly on the surface (here), but by 'evenly' distributed I mean the way a bunch of electric charges might settle on the surface of a sphere, i.e. the minimum distance between any pair of points should be maximised. For n=2, it would just return any pair of polar opposite points. For n=32 it would probably look something like a soccerball tiling. For something general like n=7, I have no idea what it would look like although the problem still seems to me to be well-defined.

Is the problem equivalent whether the distance is measured on the surface or in the 3d space?

share|cite|improve this question
Many related questions here, e.g.,…? and…? where several more pointers are given. – Gerry Myerson Feb 11 '13 at 4:39
lots of food for thought .. so is the general case an unsolved problem, then? – wim Feb 11 '13 at 5:26
That's my impression. I haven't checked to see whether any of the links on this site mention which has many links that may be of interest – Gerry Myerson Feb 11 '13 at 6:09
There are only a few regular solids (i.e., points separated by fixed distances on the sphere). – vonbrand Feb 11 '13 at 12:10
The user presently known as ℝⁿ. has a list of questions on this topic in his profile. – user53153 Feb 12 '13 at 0:23

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.