Click here to Skip to main content
15,440,991 members
Articles / Programming Languages / C#
Posted 10 Aug 2005


51 bookmarked

Fortune's Voronoi algorithm implemented in C#

Rate me:
Please Sign up or sign in to vote.
2.91/5 (30 votes)
21 Apr 2013MPL2 min read
A C# implementation of the Fortune algorithm to compute 2D Voronoi graphs.

NOTE: Code has moved to Google Code! 


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 ArrayLists and HashSets.

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 doubles 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 doubles.

A VoronoiGraph is a class that only contains a HashSet of vertices (as 2D vectors) and a HashSet of VoronoiEdges - 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.


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).


This article, along with any associated source code and files, is licensed under The Mozilla Public License 1.1 (MPL 1.1)

Written By
Software Developer (Senior)
Germany 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.

Comments and Discussions

AnswerRe: Finding distance for VoronoiGraph vertizes representing Medial Axis of closed boundary Pin
Kenneth Haugland17-Jul-12 9:31
mvaKenneth Haugland17-Jul-12 9:31 
GeneralRe: Finding distance for VoronoiGraph vertizes representing Medial Axis of closed boundary Pin
Member 917583217-Jul-12 16:11
MemberMember 917583217-Jul-12 16:11 
QuestionIs there a way to construct polygons from all the edges ? And how ? Pin
seb.493-Jun-12 21:36
Memberseb.493-Jun-12 21:36 
QuestionPossible issue. When I draw 2 points I haven't 2 area Pin
seb.4930-May-12 23:59
Memberseb.4930-May-12 23:59 
AnswerRe: Possible issue. When I draw 2 points I haven't 2 area Pin
BenDi31-May-12 3:11
MemberBenDi31-May-12 3:11 
GeneralRe: Possible issue. When I draw 2 points I haven't 2 area Pin
seb.4931-May-12 4:44
Memberseb.4931-May-12 4:44 
GeneralRe: Possible issue. When I draw 2 points I haven't 2 area Pin
BenDi31-May-12 7:00
MemberBenDi31-May-12 7:00 
GeneralRe: Possible issue. When I draw 2 points I haven't 2 area Pin
seb.4931-May-12 9:53
Memberseb.4931-May-12 9:53 
I am really sorry to disturb you but where do this adjustments ?
QuestionThis code is shitted Pin
Member 868370514-May-12 4:42
MemberMember 868370514-May-12 4:42 
AnswerRe: This code is shitted Pin
TheMaa29-Jun-13 5:42
MemberTheMaa29-Jun-13 5:42 
QuestionAny way to handle boundaries and holes? Pin
James Maeding16-Dec-10 11:03
MemberJames Maeding16-Dec-10 11:03 
AnswerRe: Any way to handle boundaries and holes? Pin
xinaesthetic30-Sep-11 7:38
Memberxinaesthetic30-Sep-11 7:38 
GeneralMy vote of 5 Pin
maurice.calvert31-Aug-10 23:08
Membermaurice.calvert31-Aug-10 23:08 
GeneralRe: My vote of 5 Pin
Member 868370514-May-12 4:45
MemberMember 868370514-May-12 4:45 
GeneralRe: My vote of 5 Pin
maurice.calvert14-May-12 5:32
Membermaurice.calvert14-May-12 5:32 
GeneralRe: My vote of 5 Pin
Member 868370514-May-12 21:38
MemberMember 868370514-May-12 21:38 
GeneralRe: My vote of 5 Pin
maurice.calvert15-May-12 4:56
Membermaurice.calvert15-May-12 4:56 
Generalplease help soon Pin
daskan8-Aug-09 1:55
Memberdaskan8-Aug-09 1:55 
QuestionVoronoi Cells Pin
C-Bl27-Jul-09 23:08
MemberC-Bl27-Jul-09 23:08 
Answer3 data points case Pin
SOAD_21-Jun-09 6:08
MemberSOAD_21-Jun-09 6:08 
GeneralRe: 3 data points case Pin
rhill-ca26-Jun-09 6:45
Memberrhill-ca26-Jun-09 6:45 
GeneralThiessen Polygons Pin
SOAD_19-Jun-09 14:46
MemberSOAD_19-Jun-09 14:46 
GeneralAnother wrong vertex Pin
Sunil Terkar11-May-09 2:04
MemberSunil Terkar11-May-09 2:04 
GeneralRe: Another wrong vertex Pin
BenDi11-May-09 10:03
MemberBenDi11-May-09 10:03 
GeneralRe: Another wrong vertex Pin
Sunil Terkar12-May-09 0:37
MemberSunil Terkar12-May-09 0:37 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Praise Praise    Rant Rant    Admin Admin   

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