Algorithms from computational geometry.
Interface Summary Interface Description PrimsMinimumSpanningTree.Adapter<T>Adapter interface to allow use with different data representations. PrimsMinimumSpanningTree.CollectorInterface for collecting edges.
Class Summary Class Description AlphaShapeCompute the alpha-shape of a point set, using Delaunay triangulation. FilteredConvexHull2DAccelerate computing the convex hull with a simple filter. GrahamScanConvexHull2DClasses to compute the convex hull of a set of points in 2D, using the classic Grahams scan. PrimsMinimumSpanningTreePrim's algorithm for finding the minimum spanning tree. PrimsMinimumSpanningTree.Array2DAdapterAdapter for a simple 2d double matrix. SweepHullDelaunay2DCompute the Convex Hull and/or Delaunay Triangulation, using the sweep-hull approach of David Sinclair. SweepHullDelaunay2D.TriangleClass representing a triangle, by referencing points in a list. XYCurveAn XYCurve is an ordered collection of 2d points, meant for chart generation. XYPlotAn XYCurve is an ordered collection of 2d
XYPlot.Curves, meant for chart generation.
Enum Summary Enum Description SweepHullDelaunay2D.OrientationThe possible orientations two triangles can have to each other.