Looking for Pseudo-code for Fortune's algorithm

Question

I'd really appreciate if someone who ever dealt with Fortune's algorithm for generating Delaunay-triangulations presented me a rather low-level pseudo-code of the algorithm! I read the one on wikipedia but it's a bit confusing and looks high-level, and any piece of code I could find had the original C implementation's inconveniences.

I'd like to implement it in C++, but in a way that the output generated is in the form of (my own) classes I'm going to use (vertices, edges and triangles as objects). So I need to understand everything and implement it from scratch.

I also read the description of the algorithm, and I know what it does and how, but this is still to abstract for me right now. However, I'd also be happy with a similar description going into the (implementation) details, it doesn't have to be code-like!

Answer 1

it took me about a month to fully understand Fortune's algorithm, I wrote my seminar school work about it. When you get it, it seems very easy :)

Here is my description of Fortune's algorithm, with imperative pseudocode and implementation details.