The following libraries come along with full source code and documentation. Use it however you like!
This is our version of Paul Bourkes Delaunay triangulator. Morton Nielson was first to provide a C# 2.0 version of this algorithm. We significantly enhanced the performance of this algorithm by adding an improved point-in-circle predicate for counterclockwise oriented triangles and a couple of other modifications. It's very easy to use and also easy to understand.
The running time of this algorithm is O(n2) against O(n*log(n)) running time of G#'s Delaunay triangulator. With increasing numer of points, G# may be several hundreds of times faster.
However, if you are only dealing with small point sets, this might be the piece of code you were looking for! Get it here.
