D# - Delaunay triangulator for .NET

D# - Delaunay triangulator for .NET

D# is a Delaunay triangulator for .NET.

The highly efficient Delaunay triangulation algorithm has O(n·log(n)) running time and uses exact arithmetic.

PLUS: Visualize the triangulations via dxf™!

2D Delaunay triangulations

A 2d triangulation of a 3d set of points is the triangulation of the projection of the points onto the XY plane. This simply says that the Z-coordinate is ignored for the triangulation.

A Delaunay triangulation maximizes the minimum angle of all triangles in the triangulation. This property makes it the triangulation of choice for projectable point sets as they occur - for example - in a Digital Terrain Model (DTM) or a Digital Elevation Model (DEM).

D# implements a fast O(n·log(n)) randomized incremental algorithm which enables you to triangulate even very large point sets very fast. D# implements exact arithmetic thus providing ultimate robustness.

Click here to see an example. Click here to see a performance chart.

It's graphic!

D# includes a powerful visualization tool that lets you output all triangles and vertices in an AC1009-dxf™ format compatible file in just one line of code! 

This format is probably one of the most widely supported vector formats and can be read by most professional CAD systems like Autodesk™ AutoCAD™ (release 12 or higher). There are many freely available viewers like Autodesk™ TrueView™.

Use this tool to quickly visualize your computations or even to create complex drawings!


Field of application

Scholar
Academic
Engineering
Graphics
System requirements

D# is a stand-alone.

.NET Framework 2.0