Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.
|
|
|
|
Re: Voronoi Regions from Fortune's algorithm
Posted:
Jul 27, 2007 1:10 PM
|
|
> Hey all,
>
> So I've seen Steven Fortune's algorithm for generating Voronoi
> regions, but the algorithm (or at least the implementations I have
> seen) are only concerned with finding the edges of the regions, so
> that they can do the Delauney triangulation. I actually want the
> Voronoi regions. So, does anyone know of an implementation that
> gives me the polygons for each region? Or, how do I modify the
> algorithm to generate the regions?
Hi Dave,
you have to work with a DCEL (doubly connectect edge list), then you
will have a data structure that also provides region (i.e. polygon)
data.
All the best,
Ulli Kortenkamp
On 27.07.2007, at 16:10, Dave wrote:
>
> In case you're curious, here is the implementation upon which I am
> basing my own, although it's messy, so I don't blame you if you
> don't read it: )
>
> http://www.cs.hmc.edu/~mbrubeck/voronoi.html
>
> Thanks.
>
> Dave
|
|
|
|
