G# provides fast and robust algorithms to compute 2d Delaunay triangulations and 2d and 3d convex hulls. All algorithms have O(n*log(n)) running time. G# implements exact arithmetic, and you can directly access the exact and floating point arithmetic predicates. The 3d convex hull object provides mass properties and a bounding box along the principal axes of inertia. Using the inbuilt AutoCAD dxf file format writer, you can easily visualize your computations or even generate complex drawings.