G# - the computational geometry namespace extends the V# - VectorGeometry namespace providing fast and robust solutions for the following common computational geometry tasks:

• The computation of a 2d Delaunay triangulation of a set of n points in O(n * log(n)) time.
• The computation of a 2d conforming Delaunay triangulation of a set of n points.
• Surface reconstruction based on a set of n triangular or quadrilateral wireframe edges in O(n * log(n)) time.
• The computation of a 2d convex hull of a set of n points in O(n * log(n)) time.
• The computation of a 3d convex hull of a set of n points in O(n * log(n)) time.
• The computation of 3d polylines from unordered edges.

In addition, it provides

• a couple of very efficient floating point and exact arithmetic geometric predicates,
• minimum area and minimum perimeter 2d bounding boxes,
• minimum and maximum 2d point cloud diameters,
• smallest enclosing circles of planar point sets,
• a fast approximation for a minimal 3d bounding box and
• an approximate solution of a 3d convex container loading problem.

The exact arithmetic predicates are due to the work of Jonathan Richard Shewchuk. The C-implementation of the exact arithmetic predicates is in the public domain. ceometric can not guarantee that the ported predicates work correctly. Nevertheless, they never failed in numerous tests. If you have problems using them, please report.

You need to reference the ceometric.VectorGeometry namespace to use this library!