This tool calculates the minimum convex hull, or the minimum convex polygon containing all of the points within a set of vector features. The vector features can be a group of points, polylines, or polygons. A polygon is convex if the straight line connecting each pair of points within the polygon is itself wholely contained within the polygon, i.e. the boundary of the polygon doesn't possess any inlets or bays.

If the input vector file contains polylines or polygons, the user can optionally choose to have the convex hull defined for individual features or the entire group of features. Vectors containing points can only have convex hulls defined for the set of points and not individual points.

- None

The following is an example of a Python script that uses this tool:

```
wd = pluginHost.getWorkingDirectory()
```

inputFile = wd + "input.shp"

outputFile = wd + "output.shp"

hullAroundIndividualFeatures = "false"

args = [inputFile, outputFile, hullAroundIndividualFeatures]

pluginHost.runPlugin("MinimumConvexHull", args, False)

This is a Groovy script also using this tool:

```
def wd = pluginHost.getWorkingDirectory()
```

def inputFile = wd + "input.shp"

def outputFile = wd + "output.shp"

def hullAroundIndividualFeatures = "true"

String[] args = [inputFile, outputFile, hullAroundIndividualFeatures]

pluginHost.runPlugin("MinimumConvexHull", args, false)

- John Lindsay (2012)