高效的Delaunay三角剖分 [英] Efficient Delaunay triangulation

问题描述

我正在寻找一个.NET实现，它可以从一组点构建Delaunay三角剖分.

我已经测试了几个实现，但是它们都只适用于少量的点(最多20,000点).

我需要可以在合理时间内处理500,000点的东西.

解决方案

如果要构建2D Delaunay三角剖分，请使用 三角形.净 .这是Shechchuk著名的 Triangle 程序的直接C#端口.>

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.

解决方案

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

这篇关于高效的Delaunay三角剖分的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！