I’m just tossing out some code for generating a “Spherical Fibonacci point set” on a spherical cap of height $h$ with some minimal notes:

• Cap is oriented around $+\mathbf{z}$
• Internal computation is incremental and performed in doubles to limit compounding of errors from skewing the distribution. The assumption is $n$ is large.
• Not generally suited for performance testing since the sequences of $z$ values is linear (assuming that matters)
• The specific SFPS variant is NOT skipping logical element zero which is typically the case.