A New Computationally Efficient Method for Spacing n Points on a Sphere
Jonathan Kogan · Rose-Hulman Scholar (Rose–Hulman Institute of Technology) · 2017
The problem of equally spacing n points on a sphere is impossible in general, but there are methods that come close to spacing the points equally. The method introduced in this paper uses a spiral that was found using experimental evidence. The resulting spacings are close to theoretical bounds, and the method is computationally efficient for large numbers of points. The method's accuracy ranges from 70% to 86% of the upper bound as n changes.