Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Optimizing the Arrangement of Points on the Unit Sphere

Joel Berman and Kit Hanes
Mathematics of Computation
Vol. 31, No. 140 (Oct., 1977), pp. 1006-1008
DOI: 10.2307/2006132
Stable URL: http://www.jstor.org/stable/2006132
Page Count: 3
  • Read Online (Free)
  • Download ($34.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Optimizing the Arrangement of Points on the Unit Sphere
Preview not available

Abstract

This paper is concerned with the problem of placing $N$ points on the unit sphere in $E^3$ so as to maximize the sum of their mutual distances. A necessary condition is proved which led to a computer algorithm. This in turn led to the apparent best arrangements for values of $N$ from 5 to 10 inclusive.

Page Thumbnails

  • Thumbnail: Page 
1006
    1006
  • Thumbnail: Page 
1007
    1007
  • Thumbnail: Page 
1008
    1008