c# - 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 only for small amount of points (up to 20,000).

I need something that can handle 500,000 points in reasonable time.

question from:https://stackoverflow.com/questions/7309538/efficient-delaunay-triangulation

Answer 1

If you want to construct the 2D Delaunay triangulation, use Triangle.Net. It is a direct C# port of Shewchuk's famous Triangle program.