Merge pull request #5111 from nyalldawson/min_bounding_geom_alg

[FEATURE] New processing algorithm "minimum bounding geometry"

python/plugins/processing/algs/help/qgis.yaml

@@ -43,9 +43,6 @@ qgis:basicstatisticsforfields: >
 qgis:boundary: >
   Returns the closure of the combinatorial boundary of the input geometries (ie the topological boundary of the geometry). For instance, a polygon geometry will have a boundary consisting of the linestrings for each ring in the polygon. Only valid for polygon or line layers.
 
-qgis:boundingboxes: >
-  This algorithm calculates the bounding box (envelope) of each feature in an input layer.
-
 qgis:buildvirtualvector: >
   This algorithm creates a virtual layer that contains a set of vector layer.
 
@@ -76,11 +73,6 @@ qgis:convertgeometrytype: >
 
   See the "Polygonize" or "Lines to polygons" algorithm for alternative options.
 
-qgis:convexhull: >
-  This algorithm computes the convex hull of features in a layer.
-
-  If a field is specified, it will divide the features into classes based on that field, and compute a separate convex hull for the features in each class.
-
 qgis:countpointsinpolygon: >
   This algorithm takes a points layer and a polygon layer and counts the number of points from the first one in each polygons of the second one.
 
@@ -324,6 +316,13 @@ qgis:mergevectorlayers: >
 
   The layers will all be reprojected to match the coordinate reference system of the first input layer.
 
+qgis:minimumboundinggeometry: >
+  This algorithm creates geometries which enclose the features from an input layer.
+
+  Numerous enclosing geometry types are supported, including bounding boxes (envelopes), oriented rectangles, circles and convex hulls.
+
+  Optionally, the features can be grouped by a field. If set, this causes the output layer to contain one feature per grouped value with a minimal geometry covering just the features with matching values.
+
 qgis:multiparttosingleparts: >
   This algorithm takes a vector layer with multipart geometries and generates a new one in which all geometries contain a single part. Features with multipart geometries are divided in as many different features as parts the geometry contain, and the same attributes are used for each of them.
 
@@ -349,11 +348,6 @@ qgis:offsetline: >
 
   The miter limit parameter is only applicable for miter join styles, and controls the maximum distance from the offset curve to use when creating a mitered join.
 
-qgis:orientedminimumboundingbox: >
-  This algorithm takes a vector layer and generate a new one with the minimum rectangle that covers all the input features.
-
-  As an alternative, the output layer can contain not just a single rectangle, but one for each input feature, representing the minimum rectangle that covers each of them.
-
 qgis:minimalenclosingcircle: >
   This algorithm takes a vector layer and generate a new one with the minimum enclosing circle that covers all the input features.
 
@@ -408,12 +402,7 @@ qgis:polygoncentroids: >
   NOTE: This algorithm is deprecated and the generic "centroids" algorithm (which works for line and multi geometry layers) should be used instead.
 
 qgis:polygonfromlayerextent: >
-  This algorithm takes a vector layer and generates a new one with the minimum bounding box (rectangle with N-S orientation) that covers all the input features.
-
-  As an alternative, the output layer can contain not just a single bounding box, but one for each input feature, representing the bounding box of each of them.
-
-qgis:polygonfromrasterextent: >
-  This algorithm takes a raster layer and generates a vector layer containing a feature with the minimum bounding box that covers the raster layer's extent.
+  This algorithm takes a map layer and generates a new vector layer with the minimum bounding box (rectangle with N-S orientation) that covers the input layer.
 
 qgis:polygonize:  >
   This algorithm takes a lines layer and creates a polygon layer, with polygons generated from the lines in the input layer.