Package org.locationtech.jts.algorithm
Class ConvexHull
java.lang.Object
org.locationtech.jts.algorithm.ConvexHull
Computes the convex hull of a
Geometry
.
The convex hull is the smallest convex Geometry that contains all the
points in the input Geometry.
Uses the Graham Scan algorithm.
- Version:
- 1.7
-
Constructor Summary
ConstructorsConstructorDescriptionConvexHull
(Coordinate[] pts, GeometryFactory geomFactory) Create a new convex hull construction for the inputCoordinate
array.ConvexHull
(Geometry geometry) Create a new convex hull construction for the inputGeometry
. -
Method Summary
Modifier and TypeMethodDescriptionReturns aGeometry
that represents the convex hull of the input geometry.protected Coordinate[]
toCoordinateArray
(Stack stack) An alternative to Stack.toArray, which is not present in earlier versions of Java.
-
Constructor Details
-
ConvexHull
Create a new convex hull construction for the inputGeometry
. -
ConvexHull
Create a new convex hull construction for the inputCoordinate
array.
-
-
Method Details
-
getConvexHull
Returns aGeometry
that represents the convex hull of the input geometry. The returned geometry contains the minimal number of points needed to represent the convex hull. In particular, no more than two consecutive points will be collinear.- Returns:
- if the convex hull contains 3 or more points, a
Polygon
; 2 points, aLineString
; 1 point, aPoint
; 0 points, an emptyGeometryCollection
.
-
toCoordinateArray
An alternative to Stack.toArray, which is not present in earlier versions of Java.
-