java.lang.Object
de.lmu.ifi.dbs.elki.math.geometry.SweepHullDelaunay2D
Compute the Convex Hull and/or Delaunay Triangulation, using the sweep-hull
approach of David Sinclair.
Note: This implementation does not check or handle duplicate points!
- Author:
- Erich Schubert
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionstatic class
Class representing a triangle, by referencing points in a list. -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionvoid
Add a single point to the list (this does not compute or update the triangulation!)Get the Delaunay triangulation.getHull()
Get the convex hull only.static void
static double
quadraticEuclidean
(Vector v1, Vector v2) Squared euclidean distance. 2d.
-
Constructor Details
-
SweepHullDelaunay2D
public SweepHullDelaunay2D()Constructor. -
SweepHullDelaunay2D
Constructor.- Parameters:
points
- Existing points
-
-
Method Details
-
add
Add a single point to the list (this does not compute or update the triangulation!)- Parameters:
point
- Point to add
-
getHull
Get the convex hull only. Note: if you also want the Delaunay Triangulation, you should get that first!- Returns:
- Convex hull
-
getDelaunay
Get the Delaunay triangulation.- Returns:
- Triangle list
-
quadraticEuclidean
Squared euclidean distance. 2d.- Parameters:
v1
- First vectorv2
- Second vector- Returns:
- Quadratic distance
-
main
-