A 1D convex hull mesh:

The region is the smallest convex region that includes the points:

A 2D convex hull mesh:

The region is the smallest convex region that includes the points:

A 3D convex hull mesh:

The region is the smallest convex region that includes the points:

Create a 1D convex hull mesh from a set of points:

Basic properties:

Convex hull meshes are bounded:

Convex hull meshes are full dimensional:

Find its area and centroid:

Test for point membership:

Find the nearest point and its distance:

Create a 2D convex hull mesh from a set of points:

Basic properties:

Convex hull meshes are bounded:

Convex hull meshes are full dimensional:

Find its area and centroid:

Test for point membership:

Find the nearest point and its distance:

Create a 3D convex hull mesh from a set of points:

Basic properties:

Convex hull meshes are bounded:

Convex hull meshes are full dimensional:

Find its volume and centroid:

Find its surface area:

Find the nearest point and its distance:

The convex hull of a compound of five tetrahedra is a dodecahedron:

Compute the convex hull of a cow:

Visualize convex hull and cow:

ConvexHullMesh is effectively the BoundaryMesh of a DelaunayMesh:

In 3D:

Use DelaunayMesh to get a Delaunay triangulation of the interior of the convex hull:

Use TriangulateMesh to control the triangulation of the interior:

ConvexHullMesh returns full–dimensional mesh regions only:

Use ConvexHullRegion to get the convex hull: