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.
