Fork me on GitHub

OL3-ext: Convex hull

The ol.coordinate.convexHull() function calculate a convex hull or convex envelope, ie. the smallest polygon that contains all points of a set.
It uses the Andrew's Monotone Chain Algorithm to complete the hull.

It can be used to display a polygon around the points of a cluster.

Click on the map to add features and calculate the convex hull.