Free .NET geometry downloads


The following libraries come along with full source code and documentation. Use it however you like!



Delaunay triangulator

This is our version of Paul Bourkes Delaunay triangulator. It comes with an enhanced 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. If you are dealing with small point sets, this might be the piece of code you were looking for! Get it here.