We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
在计算关键的phi和theta值得算法里: phi = Math.acos(-1.0 + (2.0 * i - 1.0) / count); theta = Math.sqrt(count * Math.PI) * phi; 其中phi的我能理解,但是theta为什么是这么计算的呢?求教,查了很多资料,比如: https://www.cnblogs.com/dishuostec/archive/2011/10/25/2223703.html 都没有给出准确解答
The text was updated successfully, but these errors were encountered:
No branches or pull requests
在计算关键的phi和theta值得算法里:
phi = Math.acos(-1.0 + (2.0 * i - 1.0) / count);
theta = Math.sqrt(count * Math.PI) * phi;
其中phi的我能理解,但是theta为什么是这么计算的呢?求教,查了很多资料,比如:
https://www.cnblogs.com/dishuostec/archive/2011/10/25/2223703.html
都没有给出准确解答
The text was updated successfully, but these errors were encountered: