- #1
Gerenuk
- 1,034
- 5
What is the most convenient way to get a set of unit vectors in N dimensions, such that the angle between two neighboring vectors is about a fixed value?
To be more precise I'd like to find a small number of vectors so that all possible other unit vectors are at most at a certain angle from a vector of this set.
It doesn't have to be precise, which probably would work for platonic solids like cubes only. Some rough method is to take all points on a N-dimensional cube and normalize the vectors. A whacky idea would be to do the same with a cross-polytope, but I don't know how to parametrize that.
But maybe one can do better?
To be more precise I'd like to find a small number of vectors so that all possible other unit vectors are at most at a certain angle from a vector of this set.
It doesn't have to be precise, which probably would work for platonic solids like cubes only. Some rough method is to take all points on a N-dimensional cube and normalize the vectors. A whacky idea would be to do the same with a cross-polytope, but I don't know how to parametrize that.
But maybe one can do better?