Convex hulls

### 25.9.5 Convex hulls

The convexhull command uses the Graham scanning algorithm to find the convex hull of a set of points.

- convexhull takes points, a sequence or list of points.
- convexhull(points) returns the vertices of the convex hull of the points.

#### Example

convexhull(0,1,1+i,1+2i,-1-i,1-3i,-2+i)

1−3 i,1+2 i,−2+i,−1−i |  |  |  |  |  |  |  |  |  |

To draw the hull, use the polygon command with the output of convexhull (see Section 25.9.3).

polygon(convexhull(0,1,1+i,1+2i,-1-i,1-3i,-2+i))