mccool@dgp.toronto.edu (Michael McCool) (02/17/90)
About the problem of generating points on the surface of a sphere: I would too be interested if anybody could give me a reference to an algorithm that generates points that are equally distributed across the surface of a sphere (or at least to a close approximation). Each point has a "patch" of points on the surface that are closer to that point than any other. By "equally distributed" I mean that all the patches should have approximately the same size. I need a number of points that is a power of two. And I don't really need an algorithm, just a distribution for, say, 256, 512, or 1024 points. I can only figure out a really good one for 32 points. (duodecaheron + centers). Everything else based on platonic solids seems to not give a power of 2. Thanks a lot! -- ======================================================================== Michael McCool (mccool@csri.toronto.edu or mccool@csri.utoronto.ca)