I want to find $m$ unit vectors on the surface of a $n$-sphere, where $m > n$ and the cosine angle amongst the $m$ vectors is maximal. There are a few posts on this particular problem (ref 1, ref 2, ref 3, ref 4, ref 5), and it seems to be a well-studied problem. But, I am interested in only an approximate solution to the problem. I believe the Thompson problem and the Tammes problem are the closest problems with a formal definition to my problem but for a 2-sphere. I found this paper that suggests an iterative algorithm to my problem. Is there a better and faster approach, possibility with a publicly available implementation? Also, is there a formal definition/problem name for this other than saying that it is a generalization of the Tammes problem?
Asked
Active
Viewed 116 times
