寻找Fortune算法的伪代码 [英] Looking for Pseudo-code for Fortune's algorithm

问题描述

我真的很感激，如果有人曾经处理过Fortune的生成Delaunay三角剖分的算法，为我提供了该算法的相当低级的伪代码！我在Wikipedia上阅读了这篇文章，但这有点令人困惑并且看起来很高级，而且我能找到的任何代码都有原始C实现的不便。

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.

我喜欢用C ++实现它，但是以某种方式生成的输出是我要使用的（我自己的）类的形式（顶点，边和三角形作为对象）。因此，我需要了解所有内容并从头开始实现。

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!

推荐答案

我花了大约一个月的时间才能完全了解Fortune的算法，我为此写了我的研讨会学校著作。当您获得它时，这似乎非常容易：）

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

这是我的 Fortune算法的说明，带有命令式伪代码和实现细节。

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

这篇关于寻找Fortune算法的伪代码的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！