Comments on: Speedy Voronoi diagrams in as3/flash http://blog.controul.com/2009/05/speedy-voronoi-diagrams-in-as3flash/ Elaborations on flash. Tue, 27 Jul 2010 09:31:06 -0700 hourly 1 http://wordpress.org/?v=3.0 By: blog.alumican.net » Blog Archive » トップページ更新 Cells http://blog.controul.com/2009/05/speedy-voronoi-diagrams-in-as3flash/comment-page-1/#comment-240 blog.alumican.net » Blog Archive » トップページ更新 Cells Mon, 12 Jul 2010 11:44:39 +0000 http://blog.controul.com/?p=321#comment-240 [...] » アルゴリズム解説 » C++版 » AS3版 [...] [...] » アルゴリズム解説 » C++版 » AS3版 [...]

]]> By: hristo http://blog.controul.com/2009/05/speedy-voronoi-diagrams-in-as3flash/comment-page-1/#comment-229 hristo Thu, 17 Jun 2010 10:27:42 +0000 http://blog.controul.com/?p=321#comment-229 Hey Matt! Actually, I'm seeing that, except for the link, I haven't really explicitly credited you for the code in the post - sorry for that, will fix it. Meanwhile, have you got any clues about the math problems we're seeing here? Is it my interpretation of your math that's off? Thanks! Hey Matt!
Actually, I’m seeing that, except for the link, I haven’t really explicitly credited you for the code in the post – sorry for that, will fix it.
Meanwhile, have you got any clues about the math problems we’re seeing here? Is it my interpretation of your math that’s off?
Thanks!

]]> By: Matt Brubeck http://blog.controul.com/2009/05/speedy-voronoi-diagrams-in-as3flash/comment-page-1/#comment-208 Matt Brubeck Fri, 04 Jun 2010 16:04:03 +0000 http://blog.controul.com/?p=321#comment-208 Very cool! I'm happy to see somebody managed to do something awesome based on my old hastily-written C++ code. Very cool! I’m happy to see somebody managed to do something awesome based on my old hastily-written C++ code.

]]> By: hristo http://blog.controul.com/2009/05/speedy-voronoi-diagrams-in-as3flash/comment-page-1/#comment-165 hristo Fri, 19 Mar 2010 10:04:01 +0000 http://blog.controul.com/?p=321#comment-165 Hey Li! If you want to get the Delaunay Triangulation out of this code, right now, you simply have to do all the math yourself. What I had and still have to do, is to make it output actual geometry, not a bunch of anonymous segments, so that you can run whatever processing you want on the polygons later. Right now, best go to Nicoptere's experimentorium, you have both Voronoi and Delaunay there produced by the same algo. Cheers and sorry for my late reply, Hristo Hey Li!

If you want to get the Delaunay Triangulation out of this code, right now, you simply have to do all the math yourself.

What I had and still have to do, is to make it output actual geometry, not a bunch of anonymous segments, so that you can run whatever processing you want on the polygons later.

Right now, best go to Nicoptere’s experimentorium, you have both Voronoi and Delaunay there produced by the same algo.

Cheers and sorry for my late reply,
Hristo

]]> By: hristo http://blog.controul.com/2009/05/speedy-voronoi-diagrams-in-as3flash/comment-page-1/#comment-161 hristo Mon, 22 Feb 2010 19:39:27 +0000 http://blog.controul.com/?p=321#comment-161 Thanks! And point taken ... one day I'll have to come back to this code, it needs a lot of work unFortunately hihi Thanks! And point taken … one day I’ll have to come back to this code, it needs a lot of work unFortunately hihi

]]> By: Justin Everett-Church http://blog.controul.com/2009/05/speedy-voronoi-diagrams-in-as3flash/comment-page-1/#comment-160 Justin Everett-Church Mon, 22 Feb 2010 08:30:33 +0000 http://blog.controul.com/?p=321#comment-160 Hi Hristo, Great library! I'm really enjoying working with it. I found a small issue, and wanted to let you know about it. If there are two or more points with exactly the same x value that are the furthest point to the left, you will see a lot of strange artifacts, with overlapping surfaces. The issue appears to be in the intersection function in Fortune.as in the if statement where p0.x == p1.x. It looks like there needs to be another condition there. Its late here, so I took the easy way out and added a new point so far to the extreme left that the issue never surfaces. I feel so lazy. ;) Justin Hi Hristo,

Great library! I’m really enjoying working with it. I found a small issue, and wanted to let you know about it. If there are two or more points with exactly the same x value that are the furthest point to the left, you will see a lot of strange artifacts, with overlapping surfaces. The issue appears to be in the intersection function in Fortune.as in the if statement where p0.x == p1.x. It looks like there needs to be another condition there.

Its late here, so I took the easy way out and added a new point so far to the extreme left that the issue never surfaces. I feel so lazy. ;)

Justin

]]> By: jez http://blog.controul.com/2009/05/speedy-voronoi-diagrams-in-as3flash/comment-page-1/#comment-151 jez Tue, 12 Jan 2010 19:51:57 +0000 http://blog.controul.com/?p=321#comment-151 marvellous monsieur ! delaunay/voronoi makes beautiful sense to me - check CGAL for inspiration (c++) - but i think real time 3d modelling through AR input in flash is coming! anyone interested? I think so ! I absolutely agree with the previous post - a double linked list (plus a nice dictionary object for keeping the whole thing tidy) is the way to go ....inline code is the new oop ... (only kidding!) - but yes, i think perhaps its time to get mr j. ebert into this conversation for some SERIOUS optimisations - this is a real case for pushin it to the max......lovin your work!...hope to ping pong a few files of my own to add to the conversation v soon. all power to your elbow - ancient alexandria had nothing on the new mathematical playground - we are all allowed to play now ! j marvellous monsieur !
delaunay/voronoi makes beautiful sense to me – check CGAL for inspiration (c++)
- but i think real time 3d modelling through AR input in flash is coming! anyone interested? I think so !
I absolutely agree with the previous post – a double linked list (plus a nice dictionary object for keeping the whole thing tidy) is the way to go ….inline code is the new oop … (only kidding!) – but yes, i think perhaps its time to get mr j. ebert into this conversation for some SERIOUS optimisations – this is a real case for pushin it to the max……lovin your work!…hope to ping pong a few files of my own to add to the conversation v soon. all power to your elbow – ancient alexandria had nothing on the new mathematical playground – we are all allowed to play now ! j

]]> By: planet-ape|blog http://blog.controul.com/2009/05/speedy-voronoi-diagrams-in-as3flash/comment-page-1/#comment-137 planet-ape|blog Sun, 27 Dec 2009 02:34:30 +0000 http://blog.controul.com/?p=321#comment-137 <strong>超速ボロノイ図 (Fortune’s algorithm)...</strong> ドロネー図を作ったのならボロノイ図も作るでしょうってことで、前回のものから間が空きましたがボロノイ図をwonderflにて作りました。 超速ボロノイ図（Fortune’s algorithm） – wonderfl build flash online ボロノイ図を描く方法はいくつかあるのですが、今回はFortune’s algorithmと呼ばれるアルゴリズムを用いて描画してみました。 ・Fortune’s ...... 超速ボロノイ図 (Fortune’s algorithm)…

ドロネー図を作ったのならボロノイ図も作るでしょうってことで、前回のものから間が空きましたがボロノイ図をwonderflにて作りました。 超速ボロノイ図（Fortune’s algorithm） – wonderfl build flash online ボロノイ図を描く方法はいくつかあるのですが、今回はFortune’s algorithmと呼ばれるアルゴリズムを用いて描画してみました。 ・Fortune’s ……

]]> By: hristo http://blog.controul.com/2009/05/speedy-voronoi-diagrams-in-as3flash/comment-page-1/#comment-132 hristo Fri, 25 Dec 2009 11:05:57 +0000 http://blog.controul.com/?p=321#comment-132 A double linked list. The underlying data-structure shouldn't be influencing your output really; there's another problem with the implementation which could yield some artefacts, Mario described it pretty well a few comments above. Choosing between double-linked and binary tree depends on what you want to achieve - if you're planning to render huge graphs with tens of thousands of vertices, a binary tree will probably speed things up. However, for real time stuff in flash, where you'd probably have less than a thousand vertices, a double linked list, with approximative lookup of a 'nearest' arc before intersection tests kick in could be cheaper than the tree reorganisation logic. This said, I have little to no experience with binary trees, so I might be wrong. A double linked list. The underlying data-structure shouldn’t be influencing your output really; there’s another problem with the implementation which could yield some artefacts, Mario described it pretty well a few comments above.

Choosing between double-linked and binary tree depends on what you want to achieve – if you’re planning to render huge graphs with tens of thousands of vertices, a binary tree will probably speed things up. However, for real time stuff in flash, where you’d probably have less than a thousand vertices, a double linked list, with approximative lookup of a ‘nearest’ arc before intersection tests kick in could be cheaper than the tree reorganisation logic.

This said, I have little to no experience with binary trees, so I might be wrong.

]]> By: edwin http://blog.controul.com/2009/05/speedy-voronoi-diagrams-in-as3flash/comment-page-1/#comment-128 edwin Wed, 23 Dec 2009 15:33:54 +0000 http://blog.controul.com/?p=321#comment-128 I am curious to know if you used the double linked list or the binary tree implementation? I actually did refer to the same double linked list reference implementation, tried to get some sample output, and I realized that it wasn't exactly giving all the edges as required. So I tried to do one in c\c++ with the binary tree instead since it was hard to visualize the double linked list. I won't say that the binary tree one is working completely well either. I managed to get some of the missing edges but just that not all the end points of the edges are correct at the moment. I am curious to know if you used the double linked list or the binary tree implementation?

I actually did refer to the same double linked list reference implementation, tried to get some sample output, and I realized that it wasn’t exactly giving all the edges as required.

So I tried to do one in c\c++ with the binary tree instead since it was hard to visualize the double linked list. I won’t say that the binary tree one is working completely well either. I managed to get some of the missing edges but just that not all the end points of the edges are correct at the moment.

]]>