D# - Delaunay triangulator for .NET

Main feature of D# is a fast O(n*log(n)) randomized incremental 2d Delaunay triangulation algorithm written in C# enabling you to triangulate even very large projectable point sets in almost no time. Projectable point sets occur - for example - in a Digital Terrain Model or a Digital Elevation Model. D# implements exact arithmetic for ultimate robustness. You can easily visualize the triangulated surfaces using the in-built dxfÃ???? writer.
LicenseFree to try
File Size211.82 kB
Operating System Windows 2000 Windows Vista Windows NT Windows XP Windows