dorzey:
> Found this python implementation:
> http://www.oxfish.com/python/voronoi.py
Looks very nice, and it may be ShedSkin-compilable too.
Bye,
bearophile
--
http://mail.python.org/mailman/listinfo/python-list
On Jun 11, 2:01 pm, Robert Kern wrote:
> On 2009-06-11 14:56, Captain___nemo wrote:
> > Please advice me very simple implementation of voronoi diagram (given
> > coordinates). Please advice me simple python code preferably without-
> > hash, multi-threading, Delaunay Traingulation,
>
> You can't r
Found this python implementation:
http://www.oxfish.com/python/voronoi.py
>From what I understand, not my area of expertise, it would seem to be
correct.
--
http://mail.python.org/mailman/listinfo/python-list
Found this python implementation:
http://www.oxfish.com/python/voronoi.py
>From what I understand, not my area of expertise, it would seem to be
correct.
--
http://mail.python.org/mailman/listinfo/python-list
Found this python implementation:
http://www.oxfish.com/python/voronoi.py
>From what I understand, not my area of expertise, it would seem to be
correct.
--
http://mail.python.org/mailman/listinfo/python-list
Robert Kern:
> You can see a mild modification of Fortune's original C code here:
>
> http://svn.scipy.org/svn/scikits/trunk/delaunay/scikits/delaunay/Voro...
That's C++; C++ makes simple things hard and hard things possible :-)
In Python that code may become much shorter (and slower).
Bye,
bearo
Captain___nemo:
> Isn't it possible to implement Voronoi diagram using Fortune's
> algorithm without multithreading or hash map?
Multi-threading isn't part of Fortune's algorithm.
Multi-threading can be confusing, but it's better for you to learn to
feel at home using hash maps (named dicts in Pyt
Hi,
I am implementing Voronoi diagram to find out the nearest location in
a map visually. Right now I want to do this using integer coordinates
(x,y) only in a canvas.
Problem is- I am really confused about this algorithm. I read the
Computational Geometry book, few more theory on Fortune's algori
