I'm working on a computer algorithm that considers the relationships between data points in a theoretical n-dimensional space.
I am "looking" from the origin in all directions in a programmatic way that will help me cull out some of the unneeded data points. Each time I do this I will have an angle range that has been "covered". I will know that I am done when all possible angles have been covered.
What I need to know is how to determine if every direction has been covered. Intuitively I think that for each subdivision of one angle I have to have covered all subdivisions of the other possible angles but I need to know for certain before I start writing implementation for this program.
Edit: I noticed an ambiguity in my question after the first answer. I'm looking at this feature space using the description of the hyperspherical coordinate system as described on Wikipedia. It's similar to the spherical coordinate system but for each extra dimension you add another angle with a range [0, $\pi$). It seemed like the best option for my purposes.