Fantastic! Question: how does the algorithm that you used compare to Fortune's algorithm in the 2D case?
By the way, since we're on the topic of Voronoi diagrams: I happened across this algorithm <http://www.inf.uni-konstanz.de/~nocaj/publications/nb-cvt-12.pdf> for quickly computing Voronoi treemaps by Arlind Nocaj and Ulrik Brandes. Java implementation here <https://github.com/ArlindNocaj/Voronoi-Treemap-Library>, JavaScript version here <http://www.jasondavies.com/voronoi-treemap/>. Might make a cool plotting addition? On Monday, 13 October 2014 22:47:26 UTC+2, Ariel Keselman wrote: > > The Delaunay/Voronoi package is almost ready. All functionality is in > place, in a few days I'll publish (when I manage to write some basic > documentation and better tests) > > Weighted Voronoi is definitely in the todo list :) > > See attached image created with this package, and this post > <https://gist.github.com/skariel/3d2018f9341a058e00fc> for some more info > > > <https://lh4.googleusercontent.com/-IgYX-OYyDzA/VDw6FARD9cI/AAAAAAAALCg/UfreY7y2mY4/s1600/2v5lGp2.png> > >
