Quote:
Agrajag said:
I'd be interested in a link to an explanation of how to properly implement a good algorithm for Delaunay 
|
It's a very popular problem in Algorithmic / Computational Geometry. One popular algorithm by Fortune uses a sweepline, which you might have seen elsewhere, e.g. in a course on Efficient Algorithms. Understanding how the algorithm works is not that hard. Understanding why it really works and actually implementing it might be a little trickier.
