G# - computational geometry for .NET

Compute 2D Delaunay triangulations and 2D and 3D convex hulls in .NET environment.
Download

G# - computational geometry for .NET Ranking & Summary

Advertisement

  • Rating:
  • License:
  • Free to try
  • Price:
  • Free to try
  • Publisher Name:
  • By Ceometric
  • Publisher web site:
  • http://www.ceometric.com/
  • Operating Systems:
  • Windows Vista, Windows XP, Windows 2000
  • Additional Requirements:
  • Microsoft .NET Framework 2.0
  • File Size:
  • 497.8K
  • Total Downloads:
  • 142

G# - computational geometry for .NET Tags


G# - computational geometry for .NET Description

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.


G# - computational geometry for .NET Related Software