Compute the minimum convex polygon that encloses all points in a vector layer.
Returns the smallest convex polygon containing all input geometries.
Files are processed in your browser and are not uploaded to servers.
Results are exported as standard GeoJSON FeatureCollections.
Upload the GeoJSON layer to compute the convex hull.
Convex Hull computes the smallest convex polygon that encloses every geometry in a layer. Feed it scattered points, lines, or polygons and it returns one tight boundary polygon — the minimal convex "rubber band" stretched around all your data.
Convex hulls are used to delineate study areas from occurrence points (for example, species observation ranges), to estimate the footprint of a set of assets, and as a fast preprocessing step before more expensive spatial analyses. The hull is computed in the browser with Turf.js, with no data uploaded anywhere.
Upload the GeoJSON or Shapefile layer whose extent you want to enclose — point clouds, lines, and polygons all work.
Run the convex hull analysis; the tool computes the minimum convex polygon containing all input geometries locally in your browser.
Inspect the resulting hull polygon in the preview and download it as a GeoJSON FeatureCollection.
AOne hull for the entire layer: the output is a single polygon that encloses all input geometries combined. If you need per-group hulls, split the layer by attribute first with the Vector Split or Vector Extract tools, then compute a hull for each part.
AA convex hull is always convex, so bays, peninsulas, and concave gaps in your data distribution are bridged by straight edges. Even a few outlier points can greatly enlarge the hull — remove outliers first if you need a tighter fit, or consider the minimum bounding geometry tool for comparison.
APoints, lines, and polygons are all accepted, including mixed-geometry layers. Every vertex of every feature participates in the hull computation.