Basic information about the different types of primitives used by the algorithms can be found in Primitives.

Detailed description in Convex Hull Algorithms.

Convex hull of a set of point can be created using the constructor like this:

var pts = new List<Point2>()
{
    new(0, 0),
    new(1, 0),
    new(0, 1),
    new(0.1, 0.1)
};

var ch = new ConvexHull(pts);

Which uses a divide and conquer algorightm.

Once the convex hull is created, the points on the hull can either be accessed using an indexer or iterated through with IEnumerable.

var pt = ch[0]; //returns (0, 0)
foreach (var point in ch)
{
    //...
}

Detailed description in Delaunay Triangulation.

Delaunay triangulation of set of points can be created using the constructor:

var p1 = new Point2(0, 0);
var p2 = new Point2(1, 0);
var p3 = new Point2(0, 1);
var p4 = new Point2(1, 1);

var dt = new DelaunayTriangulation(new Point2[] { p1, p2, p3 });

If you provide an empty set of points, or create the class instance using a parameterless constructor, the resulting Delaunay triangulation will be empty. Points can be added to a pre-existing Delaunay triangulation using a dedicated method. For adding a new point into a triangulation, it does not matter how it was created or if it contains any other points.

dt.Add(new Point2(0.1, 0.1));

• Refactoring the code with ReSharper.
• Some of the algorithms implemented in this library were inspired by the materials published by Prof. Ivana Kolingerova from Universy of West Bohemia, if you are interested in this stuff and speak Czech, go czech them out.