GEOS
3.9.0dev

Computes the convex hull of a Geometry. More...
#include <ConvexHull.h>
Public Member Functions  
ConvexHull (const geom::Geometry *newGeometry)  
std::unique_ptr< geom::Geometry >  getConvexHull () 
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.
Last port: algorithm/ConvexHull.java rev. 1.26 (JTS1.7)
geos::algorithm::ConvexHull::ConvexHull  (  const geom::Geometry *  newGeometry  ) 
Create a new convex hull construction for the input Geometry.
std::unique_ptr<geom::Geometry> geos::algorithm::ConvexHull::getConvexHull  (  ) 
Returns a Geometry 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.