Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I'm a software engineer and have been asked to research a Voronoi implementation in four dimensions. I'm not asking for "teh codez" but am interested in approachable tutorials on Voronoi decomposition and/or implementations in any dimension. Any help here would be greatly appreciated!

share|cite|improve this question
up vote 5 down vote accepted

The standard survey is Aurenhammer and Klein. Have you looked at that?

[This would be a comment, but I don't have enough rep on this site yet]

share|cite|improve this answer

Even though you didn't ask for 'teh codez' :), qvoronoi is a pretty good implementation of Voronoi diagrams for low dimensions (i.e 4). It actually computes the Delaunay triangulation, which in turn is constructed by a convex hull algorithm (qhull) one dimension higher.

The convex hull algorithm itself is a combination of "the 2-d Quickhull algorithm with the n-d beneath-beyond algorithm [c.f., Preparata & Shamos '85]"

share|cite|improve this answer
A very helpful implementation, thank you! – fbrereto Sep 15 '10 at 16:46

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.