Efficient Delaunay triangulation

Question

I\'m looking for a .NET implementation which builds Delaunay triangulation from set of points.

I have already tested couple of implementations but they all worked on

Answer 1

There is a solution called G#.

It has Delaunay triangulations (also with breaklines). From the performance graph on their website you should be able to triangulate 500k points in about 30s.