我真的AP preciate，如果有人谁曾经处理财富的算法生成Delauney-三角preseted我一个相当低级的伪$​​ C $的算法了C！我读了一个在维基百科，但它是一个有点混乱，并期待高级别和任何一件code，我能找到有原始的C实现的inconvniences。

I'd really appreciate if someone who ever dealt with Fortune's algorithm for generating Delauney-triangulations preseted 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 inconvniences.

我想用C ++实现，但在某种程度上产生的输出是在（我自己）班，我将使用（顶点，边和三角形作为对象）的形式。所以，我需要了解的一切，从头开始inmplement它。

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 inmplement it from scratch.

我也读了算法的描述，我知道它做什么和怎么样，但是这仍然是抽象的，我现在。不过，我也很高兴有类似的描述进入的（实现）的细节，它并没有为code-喜欢！

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!

感谢你在前进，

文森特

推荐答案

我花了大约一个月的时间充分了解财富的算法，我写的是我的研讨会学校工作。当你得到它，它似乎很容易：）

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

下面是我的财富的算法的描述，用命令式的伪code和实施详细信息。

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