Package de.lmu.ifi.dbs.elki.math.geometry

Algorithms from computational geometry

See: Description

Interface Summary

Interface	Description
PrimsMinimumSpanningTree.Adapter<T>	Adapter interface to allow use with different data representations.
PrimsMinimumSpanningTree.Collector	Interface for collecting edges.

Class Summary

Class	Description
AlphaShape	Compute the alpha-Shape of a point set, using Delaunay triangulation.
FilteredConvexHull2D	Accelerate computing the convex hull with a simple filter.
GrahamScanConvexHull2D	Classes to compute the convex hull of a set of points in 2D, using the classic Grahams scan.
PrimsMinimumSpanningTree	Prim's algorithm for finding the minimum spanning tree.
PrimsMinimumSpanningTree.Array2DAdapter	Adapter for a simple 2d double matrix.
SweepHullDelaunay2D	Compute the Convex Hull and/or Delaunay Triangulation, using the sweep-hull approach of David Sinclair.
SweepHullDelaunay2D.Triangle	Class representing a triangle, by referencing points in a list.
XYCurve	An XYCurve is an ordered collection of 2d points, meant for chart generation.
XYPlot	An XYCurve is an ordered collection of 2d XYPlot.Curves, meant for chart generation.

Enum Summary

Enum	Description
SweepHullDelaunay2D.Orientation	The possible orientations two triangles can have to each other.

Package de.lmu.ifi.dbs.elki.math.geometry Description

Algorithms from computational geometry