Comments for Controul

Comment on Speedy Voronoi diagrams in as3/flash by hristo

hristo — Mon, 22 Feb 2010 19:39:27 +0000

Thanks! And point taken … one day I’ll have to come back to this code, it needs a lot of work unFortunately hihi

Comment on Speedy Voronoi diagrams in as3/flash by Justin Everett-Church

Justin Everett-Church — Mon, 22 Feb 2010 08:30:33 +0000

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

Comment on A diff/patch solution for Flash: a proof of concept Monte Carlo algorithm for comparing text versions in as3 by hristo

hristo — Thu, 21 Jan 2010 12:08:57 +0000

Thanks!
Let me know how it works, I’ve been wondering whether it’ll be good for structured text

Comment on A diff/patch solution for Flash: a proof of concept Monte Carlo algorithm for comparing text versions in as3 by Rich

Rich — Wed, 20 Jan 2010 21:25:51 +0000

This is beautiful. I plan on using your diff/patch algo to implement an undo mechanism in my XML-based tool. Again, great work!

Comment on Speedy Voronoi diagrams in as3/flash by jez

jez — Tue, 12 Jan 2010 19:51:57 +0000

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

Comment on Speedy Voronoi diagrams in as3/flash by planet-ape|blog

planet-ape|blog — Sun, 27 Dec 2009 02:34:30 +0000

超速ボロノイ図 (Fortune’s algorithm)…

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

Comment on Producing video with flash/air: png sequence rendering from swf playback by hristo

hristo — Sat, 26 Dec 2009 10:51:22 +0000

Which makes me think, that if one has access to the shell of a linux server, one could encode the pngs in the flash client, send the frames to the server via http and directly encode them with ffmpeg without the air app intermediary. This would eat up a lot of bandwidth though.

But here we go, web20 kids rejoice, this is user-contributed content television! ha

Comment on Producing video with flash/air: png sequence rendering from swf playback by ubi de feo

ubi de feo — Fri, 25 Dec 2009 11:27:03 +0000

hi.

last year in march we built a video renderer for Nokia’s retail spaces.
the system is based on a website to use a WYSIWYG interface to create content,
the newly generated piece is then fed to an off-site mac mini that renders the frames and passes them to ffmpeg through a series of perl scripts that after render update the DB and email the rendered video (or GIF) to the creator so it can be uploaded to a device running either S60 S60touch or S40 with the right screen format.
it was a very fun project to develop and it was nice to find all the workarounds.
we used Flash for the website, Air for the PNG renderer, a linux VM for ffmpeg.
all the system elements communicate over TCP sockets for handshaking, error and queue management and so on.

Comment on Speedy Voronoi diagrams in as3/flash by hristo

hristo — Fri, 25 Dec 2009 11:05:57 +0000

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.

Comment on Speedy Voronoi diagrams in as3/flash by edwin

edwin — Wed, 23 Dec 2009 15:33:54 +0000

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.