The G# computational geometry namespace for .NET provides fast and robust classes to compute 2D Delaunay triangulations and 2D and 3D convex hulls. The algorithms have O(n*log(n)) running time and implement exact arithmetic, which makes them very robust. G# also supports 2D conforming Delaunay triangulations, 2d minimum area and perimeter enclosing rectangles, point cloud diameters, 3d principal axes bounding boxes and minimum enclosing circles. G# is perfectly suitable for large-scale computations with hundreds of thousands of points. Every method is well documented and almost self-explaining. The 3D convex hull provides mass properties and a tight bounding box along the principal axes of inertia of the convex hull. You can also access some basic floating point and exact arithmetic predicates.
What is new in this release:
Version 2.0.0 provides an enhanced conforming Delaunay triangulation algorithm and point cloud diameter computation.
Requirements:
Microsoft .NET Framework 2.0
Limitations:
30-day trial
Comments not found