D# developer
December 9th, 2009
D# provides a fast and robust algorithm to compute 2d Delaunay triangulations. It has O(n*log(n)) running time and implements exact arithmetic. You can directly access the exact and floating point arithmetic predicates. The triangulations can easily be visualized via the inbuilt dxf format file writer. Download now