G# provides fast and robust .NET methods to compute 2d Delaunay triangulations, 2d and 3d convex hulls and minimum enclosing rectangles and circles. 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.
G# also supports meshes, mesh reduction, 3d polylines and surface reconstruction from wireframe edges.
Using the inbuilt AutoCAD dxf file format writer, you can easily visualize your computations or even generate complex drawings.