Well I do have some familiarity with Java, but this version is a
direct port from
Fortune's original C code, which I have archived at the site along
with his paper,
and it did not go through a Java incarnation.
People have commented favorably about its speed, although I know that could
surely be improved by relaxing some of the clean-code aspects of it.
Anyway I'll have to leave it to your judgment whether to finish the port.
Do let us know what you decide and how it goes, eh?
-A
> --
> You received this message because you are subscribed to the Google
> Groups "as3delaunay" group.
> To post to this group, send email to as3de...@googlegroups.com
> To unsubscribe from this group, send email to
> as3delaunay...@googlegroups.com
> For more options, visit this group at
> http://groups.google.com/group/as3delaunay?hl=en
> Roll over, Delaunay, and tell Voronoi the news.
yeah, AS3Delaunay has great performance. and is easy to use. thanks for throwing it together! i actually rolled my own Voronoi implementation for this exhibit, using java/processing, but i'm not happy with the performance, so wanted to use something that uses Fortune's algorithm. however, while posting this message here, i came across lee byron's Mesh library, and it's working for me very nicely.
i'll probably still end up using AS3Delaunay for a web version of the exhibit, however, and will let you know when it's live. thanks alan!
-eric