Comments on: Googling myself with Voronoi http://nodename.com/blog/2009/08/22/googling-myself-with-voronoi/ Thu, 05 Jan 2012 17:15:00 +0000 hourly 1 http://wordpress.org/?v=3.0 By: gfxnews http://nodename.com/blog/2009/08/22/googling-myself-with-voronoi/comment-page-1/#comment-183855 gfxnews Thu, 14 Apr 2011 15:38:00 +0000 http://nodename.com/blog/?p=264#comment-183855 very nice <a href="http://gfxne.ws/2011/03/game-studio-commericial-edition-programming-software/" rel="nofollow">computer game studios</a> software i am useing this one thanks very nice computer game studios software i am useing this one thanks

]]> By: alan http://nodename.com/blog/2009/08/22/googling-myself-with-voronoi/comment-page-1/#comment-168753 alan Tue, 01 Sep 2009 16:43:42 +0000 http://nodename.com/blog/?p=264#comment-168753 Then I create thee Duke of Delaunay. Then I create thee Duke of Delaunay.

]]> By: Mario Klingemann http://nodename.com/blog/2009/08/22/googling-myself-with-voronoi/comment-page-1/#comment-168752 Mario Klingemann Tue, 01 Sep 2009 11:47:34 +0000 http://nodename.com/blog/?p=264#comment-168752 OMG - I didn't realize that you are that OLD! ;-) I guess I have to address you with Lord Voronoi from now on. OMG – I didn’t realize that you are that OLD! ;-) I guess I have to address you with Lord Voronoi from now on.

]]> By: alan http://nodename.com/blog/2009/08/22/googling-myself-with-voronoi/comment-page-1/#comment-168688 alan Thu, 27 Aug 2009 18:54:39 +0000 http://nodename.com/blog/?p=264#comment-168688 Hi, Jake. Actually I'm not quite ready to share my Voronoi code. But if you take any algorithm (not necessarily Fortune's) and implement a data structure that is able to remember and traverse the vertices associated with each site, you'll get your polygons. I will admit that the biggest nuisance is clipping the polygons at the boundaries, so it will be easier if you choose a wraparound view! Hi, Jake. Actually I’m not quite ready to share my Voronoi code. But if you take any algorithm (not necessarily Fortune’s) and implement a data structure that is able to remember and traverse the vertices associated with each site, you’ll get your polygons. I will admit that the biggest nuisance is clipping the polygons at the boundaries, so it will be easier if you choose a wraparound view!

]]> By: Weekly Shared Items – 25. August, 2009 | TOXIN LABS - weblog of a german design student from wuerzburg http://nodename.com/blog/2009/08/22/googling-myself-with-voronoi/comment-page-1/#comment-168553 Weekly Shared Items – 25. August, 2009 | TOXIN LABS - weblog of a german design student from wuerzburg Tue, 25 Aug 2009 04:12:03 +0000 http://nodename.com/blog/?p=264#comment-168553 [...] Googling myself with Voronoi [...] [...] Googling myself with Voronoi [...]

]]> By: jake http://nodename.com/blog/2009/08/22/googling-myself-with-voronoi/comment-page-1/#comment-168489 jake Sun, 23 Aug 2009 08:46:30 +0000 http://nodename.com/blog/?p=264#comment-168489 Holy crud! You have been in the Voronoi diagram business forever! I need a fast as3 10 algorithm to return to me some point data for the convex polygons in a Voronoi. I've tried the Fortune algorithm implementation at: http://blog.controul.com/2009/05/speedy-voronoi-diagrams-in-as3flash/ ,and I really like it, but I'm not sure I should try to derive 'sets' of convex polygons from the line sweep parabolas used there. I admit that I've only been investigating the problem for a few days, but the few solutions I've found are too slow, or do not return 'sets' of points in the right order to fill convex polygons in a Voronoi diagram in AS3.. You have obviously solved this problem -see Mona Voronita-. If you feel like sharing some of your source, I would explode with glee like crowded, deformable, circular objects pressed together and then released! Thanks, -Jake P.S. I need to make destructible obstacles for my hobby flash game at: http://jaketastic.com/game/NewProject.swf (click 'play', then click 'load test level' then 'WASD' = move and SPACEBAR=shoot.) As you can see if you checked out the link: Horrible polygon breakage! So lousy! Any feedback is appreciated. -Jake Holy crud!

You have been in the Voronoi diagram business forever!

I need a fast as3 10 algorithm to return to me some point data for the convex polygons in a Voronoi.
I’ve tried the Fortune algorithm implementation at:
http://blog.controul.com/2009/05/speedy-voronoi-diagrams-in-as3flash/
,and I really like it, but I’m not sure I should try to derive ‘sets’ of convex polygons from the line sweep parabolas used there. I admit that I’ve only been investigating the problem for a few days, but the few solutions I’ve found are too slow, or do not return ‘sets’ of points in the right order to fill convex polygons in a Voronoi diagram in AS3..
You have obviously solved this problem -see Mona Voronita-. If you feel like sharing some of your source, I would explode with glee like crowded, deformable, circular objects pressed together and then released!

Thanks,

-Jake

P.S.
I need to make destructible obstacles for my hobby flash game at:
http://jaketastic.com/game/NewProject.swf
(click ‘play’, then click ‘load test level’ then ‘WASD’ = move and SPACEBAR=shoot.)
As you can see if you checked out the link:
Horrible polygon breakage!
So lousy!

Any feedback is appreciated.

-Jake

]]>