Distributing points on the sphere by electrostatic repulsion, ported from Bulatov’s C++ code.
[September 19, 2008]
4 Comments »
RSS feed for comments on this post. TrackBack URI
Distributing points on the sphere by electrostatic repulsion, ported from Bulatov’s C++ code.
RSS feed for comments on this post. TrackBack URI
Entire contents copyright © Alan Shaw 2005-2009. All rights reserved. You may not reprint or repost the contents of this site without the express written permission of the author.
31 queries. 0.408 seconds. Powered by WordPress version 2.8.4
Bad Behavior has blocked 868 access attempts in the last 7 days.
WOW ! I’ve been trying to do that for while now.
congratulations(for your work) and thanks for the link :)
Comment by nicoptere — September 19, 2008 @ 7:15 am
[...] It happened quite often at work that I’ve been asked to ditribute a given number of objects on a sphere. When I had to do so, I usually performed a good ol’hack like counting the vertices of a sphere, then creating some temporary triangles every N face, reorient them to finally collect their centers to pin an object there… tiring. so I was extremely glad yesterday morning when I found this : nodename [...]
Pingback by Distributing N-points on a sphere | HIDIHO! — September 20, 2008 @ 2:47 pm
[...] veut (des images en général). hier matin au petit déjeuner je suis tombé là dessus: nodename où le gars fait précisément le truc en question. et hier matin en arrivant au boulot, mon DA [...]
Pingback by trop bien le blog » distribution de n-points sur une sphère — February 25, 2009 @ 3:15 pm
[...] the planar analog of my earlier post Distributing Points on the Sphere. This time I’ve ported Steve Fortune’s C implementation of his sweepline algorithm for [...]
Pingback by nodename » Relaxing in the Plane: A Voronoi Toy — May 11, 2009 @ 8:43 pm