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

Algorithms from computational geometry.

See: Description

Class Summary

Class	Description
AlphaShape	Compute the alpha-Shape of a point set, using Delaunay triangulation.
GrahamScanConvexHull2D	Classes to compute the convex hull of a set of points in 2D, using the classic Grahams scan.
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.

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.