12,953,263 members (47,876 online)
alternative version

#### Stats

274.6K views
50 bookmarked
Posted 10 Aug 2005

# Fortune's Voronoi algorithm implemented in C#

, 21 Apr 2013 MPL
 Rate this:
A C# implementation of the Fortune algorithm to compute 2D Voronoi graphs.

## Introduction

Given a set of two dimensional vectors (or data points), a Voronoi graph is a separation of those points into compartments where all points inside one compartment are closer to the contained data point than to any other data point. I won't give any demonstration here, but if you want to know more about Voronoi graphs, check out this.

The applications of Voronoi graphs are quite broad. Very useful for a lot of optimization problems (in most cases, the Delaunay Triangulation which can be easily derived from a Vononoi graph is used there), it ranges to computing topological maps from bitmaps.

[This is an article for freaks. After a rather painful experience writing the thing I hope it will benefit everyone who is looking for this algorithm in a civilized language (or simply does not want to use Fortune's original C implementation).]

In 1987, Steve Fortune described an algorithm to compute such a graph by using a sweep line in combination with a binary tree. A PowerPoint explanation of the algorithm (the one I used to implement it) can be found here. Note that I did not use the linked data structure to represent a graph - I think that is an unnecessary difficulty in the age of `ArrayList`s and `HashSet`s.

## The Implementation

Data points are represented by my own `Vector` class. It can do much more than needed here (but there was no reason to strip it before bringing it) but I won't explain it here. The most important fact is that although working with `double`s the Vector class automatically rounds values to 10 digits (or whatever is set in the `Vector.Precision` field). Yes, sadly, this is very important if you want to sort of compare `double`s.

A `VoronoiGraph` is a class that only contains a `HashSet` of vertices (as 2D vectors) and a `HashSet` of `VoronoiEdge`s - each with references to the left and right data point and (of course) the two vertices that bound the edge. If the edge is (partially or completely) unbounded, the vector `Fortune.VVUnknown` is used.

`BinaryPriorityQueue` is used for the sweep line event queue.

## Usage

The algorithm itself (`Fortune.ComputeVoronoiGraph(IEnumerable)`) takes any `IEnumerable` containing only two dimensional vectors. It will return a `VoronoiGraph`. The algorithm's complexity is O(n ld(n)) with a factor of about 10 microseconds on my machine (2GHz).

## Share

 Software Developer (Senior) Germany
I did my diploma in Dresden and Sydney where I dealt with algorithms, agents and other cool AI stuff. Now I moved to Frankfurt to work on my PhD dealing with software structures for artificial intelligence systems. If I can, I do things in C# and ASP.NET, but if I have to, my C++, Java and SQL are not that bad.
Long Live .NET.

## You may also be interested in...

 Pro

 Re: Another wrong vertex rhill-ca26-Jun-09 6:34 rhill-ca 26-Jun-09 6:34
 Short of one edge and one vertex Sunil Terkar5-May-09 23:11 Sunil Terkar 5-May-09 23:11
 Re: Short of one edge and one vertex rhill-ca26-Jun-09 6:31 rhill-ca 26-Jun-09 6:31
 medial axis led16-Apr-09 9:38 led 16-Apr-09 9:38
 Thanks! Reconstructivism30-Mar-09 2:48 Reconstructivism 30-Mar-09 2:48
 Rays Wayne Romer22-Mar-09 20:55 Wayne Romer 22-Mar-09 20:55
 Re: Rays Reconstructivism30-Mar-09 2:56 Reconstructivism 30-Mar-09 2:56
 Re: Rays BenDi30-Mar-09 8:57 BenDi 30-Mar-09 8:57
 Hi! For (partly) infinite edges I provided two properties do make drawing easier: FixedPoint and DirectionVector. FixedPoint is either the (one) Vertex that exists or the middle between the two data points. DirectionVector is orthogonal to the connecting line between the data points (this is a property of all voronoi edges). The secret to getting the direction of an infinite edge is in the voronoi algorithm itself - it provides edges with 'left' and 'right' data points. This gives a direct way to calculating the direction from the vertex. It goes in the direction where LeftData is left and RightData is right. Simple Cheers, Ben
 Re: Rays BenDi29-Apr-09 9:49 BenDi 29-Apr-09 9:49
 Re: Rays BenDi30-Apr-09 8:04 BenDi 30-Apr-09 8:04
 Re: Rays Slagh14-May-09 22:10 Slagh 14-May-09 22:10
 Re: Rays BenDi16-May-09 2:15 BenDi 16-May-09 2:15
 Re: Rays Slagh21-May-09 19:54 Slagh 21-May-09 19:54
 Re: Rays PehGuevara27-Feb-13 4:15 PehGuevara 27-Feb-13 4:15
 Re: Rays BenDi27-Feb-13 21:53 BenDi 27-Feb-13 21:53
 Re: Rays PehGuevara27-Feb-13 22:32 PehGuevara 27-Feb-13 22:32
 Re: Rays BenDi2-Mar-13 8:28 BenDi 2-Mar-13 8:28
 Re: Rays PehGuevara5-Mar-13 23:59 PehGuevara 5-Mar-13 23:59
 Re: Rays BenDi6-Mar-13 0:16 BenDi 6-Mar-13 0:16
 Re: Rays PehGuevara7-Mar-13 6:44 PehGuevara 7-Mar-13 6:44
 Re: Rays Ray Hidayat7-Jun-11 18:06 Ray Hidayat 7-Jun-11 18:06
 Re: Rays ckaut30-Jan-10 4:20 ckaut 30-Jan-10 4:20
 Last Visit: 31-Dec-99 18:00     Last Update: 27-May-17 12:44 Refresh « Prev123456 Next »

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.

Web02 | 2.8.170525.1 | Last Updated 22 Apr 2013