Jump to content
  • Advertisement
Sign in to follow this  
Koroljov

Points on a sphere

This topic is 5100 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

I wish to place N points on a sphere, so that the distance between a point and his "neighbours" is constant for all the points. If N=2, there should be 2 points: the intersection between the sphere and a line trough its center. If N=3, there should be 3 points on the sphere. These 3 points should form an equal-sided triangle. If N=4, there should be 4 points on the sphere. These points should form a tetraedron. Is there a way to calculate the points for any value of N? If yes, how? If no, why not? I need something like this for generating realistic trees.

Share this post


Link to post
Share on other sites
Advertisement
I think the answer is no.
A close approximation is a relaxation technique (place them at random and then move them as if they all repelled each other).
A good way to make trees is an L-system (google it) :o)

Share this post


Link to post
Share on other sites
Guest Anonymous Poster
or this :

http://astronomy.swin.edu.au/~pbourke/geometry/spherepoints/

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

Participate in the game development conversation and more when you create an account on GameDev.net!

Sign me up!