qgis.yaml 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257
  1. qgis:advancedpythonfieldcalculator: >
  2. This algorithm adds a new attribute to a vector layer, with values resulting from applying an expression to each feature. The expression is defined as a Python function.
  3. qgis:barplot: >
  4. This algorithm creates a bar plot from a category and a layer field.
  5. qgis:basicstatisticsforfields: >
  6. This algorithm generates basic statistics from the analysis of a values in a field in the attribute table of a vector layer. Numeric, date, time and string fields are supported.
  7. The statistics returned will depend on the field type.
  8. Statistics are generated as an HTML file.
  9. qgis:boxplot: >
  10. This algorithm creates a box plot from a category and a layer field.
  11. qgis:checkvalidity: >
  12. This algorithm performs a validity check on the geometries of a vector layer.
  13. The geometries are classified in three groups (valid, invalid and error), and a vector layer is generated with the features in each of these categories.
  14. By default the algorithm uses the strict OGC definition of polygon validity, where a polygon is marked as invalid if a self-intersecting ring causes an interior hole. If the "Ignore ring self intersections" option is checked, then this rule will be ignored and a more lenient validity check will be performed.
  15. The GEOS method is faster and performs better on larger geometries, but is limited to only returning the first error encountered in a geometry. The QGIS method will be slower but reports all errors encountered in the geometry, not just the first.
  16. qgis:climbalongline: >
  17. This algorithm calculates the total climb and descent along line geometries.
  18. Input layers must have Z values present. If Z values are not available, the "Drape" (set Z value from raster) algorithm may be used to add Z values from a DEM layer.
  19. The output layer is a copy of the input layer with additional fields that contain the total climb, total descent, the minimum elevation and the maximum elevation for each line geometry. If the input layer contains fields with the same names as these added fields, they will be renamed (field names will be altered to "name_2", "name_3", etc, finding the first non-duplicate name).
  20. qgis:concavehull: >
  21. This algorithm computes the concave hull of the features in an input layer.
  22. qgis:convertgeometrytype: >
  23. This algorithm generates a new layer based on an existing one, with a different type of geometry.
  24. Not all conversions are possible. For instance, a line layer can be converted to a point layer, but a point layer cannot be converted to a line layer.
  25. See the "Polygonize" or "Lines to polygons" algorithm for alternative options.
  26. qgis:definecurrentprojection: >
  27. This algorithm sets an existing Shapefile's projection to the provided CRS. Contrary to the "Assign projection" algorithm, it will not output a new layer.
  28. The .prj and .qpj files associated with the Shapefile will be overwritten - or created if missing - to match the provided CRS.
  29. qgis:distancematrix: >
  30. This algorithm creates a table containing a distance matrix, with distances between all the points in a points layer.
  31. qgis:distancetonearesthublinetohub: >
  32. Given an origin and a destination layers, this algorithm computes the distance between origin features and their closest destination one. Distance calculations are based on the features center.
  33. The resulting layer contains lines linking each origin point with its nearest destination feature.
  34. qgis:distancetonearesthubpoints: >
  35. Given an origin and a destination layers, this algorithm computes the distance between origin features and their closest destination one. Distance calculations are based on the features center.
  36. The resulting layer contains origin features center point with an additional field indicating the identifier of the nearest destination feature and the distance to it.
  37. qgis:eliminateselectedpolygons: >
  38. This algorithm combines selected polygons of the input layer with certain adjacent polygons by erasing their common boundary. The adjacent polygon can be either the one with the largest or smallest area or the one sharing the largest common boundary with the polygon to be eliminated.
  39. Eliminate is normally used to get rid of sliver polygons, i.e. tiny polygons that are a result of polygon intersection processes where boundaries of the inputs are similar but not identical.
  40. qgis:executesql: >
  41. Runs a simple or complex query with SQL syntax.
  42. Input data sources are identified with input1, input2, ..., inputN and a simple query will look like: SELECT * FROM input1
  43. The result of the query will be added as a new layer.
  44. qgis:exportaddgeometrycolumns: >
  45. This algorithm computes geometric properties of the features in a vector layer. It generates a new vector layer with the same content as the input one, but with additional attributes in its attributes table, containing geometric measurements.
  46. Depending on the geometry type of the vector layer, the attributes added to the table will be different.
  47. qgis:findprojection: >
  48. This algorithm allows creation of a shortlist of possible candidate coordinate reference systems for a layer with an unknown projection.
  49. The expected area which the layer should reside in must be specified via the target area parameter.
  50. The algorithm operates by testing the layer's extent in every known reference system and listing any in which the bounds would fall near the target area if the layer was in this projection.
  51. qgis:generatepointspixelcentroidsalongline: >
  52. This algorithm generates a point vector layer from an input raster and line layer.
  53. The points correspond to the pixel centroids that intersect the line layer.
  54. qgis:heatmapkerneldensityestimation: >
  55. Creates a density (heatmap) raster of an input point vector layer using kernel density estimation. Heatmaps allow easy identification of hotspots and clustering of points.
  56. The density is calculated based on the number of points in a location, with larger numbers of clustered points resulting in larger values.
  57. qgis:hypsometriccurves: >
  58. This algorithm computes hypsometric curves for an input Digital Elevation Model. Curves are produced as table files in an output folder specified by the user.
  59. qgis:idwinterpolation: >
  60. Generates an Inverse Distance Weighted (IDW) interpolation of a point vector layer.
  61. Sample points are weighted during interpolation such that the influence of one point relative to another declines with distance from the unknown point you want to create.
  62. qgis:importintospatialite: >
  63. This algorithm imports a vector layer into a SpatiaLite database, creating a new table.
  64. qgis:knearestconcavehull: >
  65. This algorithm generates a concave hull polygon from a set of points. If the input layer is a line or polygon layer, it will use the nodes.
  66. The number of neighbours to consider determines the concaveness of the output polygon. A lower number will result in a concave hull that follows the points very closely, while a higher number will have a smoother shape. The minimum number of neighbour points to consider is 3. A value equal to or greater than the number of points will result in a convex hull.
  67. If a field is selected, the algorithm will group the features in the input layer using unique values in that field and generate individual polygons in the output layer for each group.
  68. qgis:linestopolygons: >
  69. This algorithm generates a polygon layer using as polygon rings the lines from an input line layer.
  70. The attribute table of the output layer is the same as the one from of the input line layer.
  71. qgis:listuniquevalues: >
  72. This algorithm generates a report with information about the unique values found in a given attribute (or attributes) of a vector layer.
  73. qgis:meanandstandarddeviationplot: >
  74. This algorithm creates a box plot with mean and standard deviation values.
  75. qgis:minimumboundinggeometry: >
  76. This algorithm creates geometries which enclose the features from an input layer.
  77. Numerous enclosing geometry types are supported, including bounding boxes (envelopes), oriented rectangles, circles and convex hulls.
  78. 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.
  79. qgis:pointsdisplacement: >
  80. Offsets nearby point features by moving nearby points by a preset amount to minimize overlapping features.
  81. qgis:polarplot: >
  82. This algorithm generates a polar plot based on the value of an input vector layer.
  83. Two fields must be entered as parameters: one that define the category (to group features) and another one with the variable to plot (this has to be a numeric one)
  84. qgis:polygonstolines: >
  85. This algorithm takes a polygon layer and creates a line layer, with lines representing the rings of the polygons in the input layer.
  86. qgis:postgisexecuteandloadsql: >
  87. This algorithm performs a SQL database query on a PostGIS database connected to QGIS and loads the query results as a new layer.
  88. qgis:randomextractwithinsubsets: >
  89. This algorithm takes a vector layer and generates a new one that contains only a subset of the features in the input layer.
  90. The subset is defined randomly, using a percentage or count value to define the total number of features in the subset.
  91. The percentage/count value is not applied to the whole layer, but instead to each category. Categories are defined according to a given attribute, which is also specified as an input parameter for the algorithm.
  92. qgis:randompointsalongline: >
  93. This algorithm creates a point layer with a given "Number of points" placed on the lines of the "Input layer".
  94. The location of each point is determined by randomly selecting a feature, then a segment of the line geometry of that feature, and finally a random position on that segment. A minimum distance between the points can be specified (Euclidean distance).
  95. qgis:randompointsinlayerbounds: >
  96. This algorithm creates a new point layer with a given number of random points, all of them within the extent of a given layer. A distance factor can be specified, to avoid points being too close to each other.
  97. qgis:randompointsinsidepolygons: >
  98. This algorithm creates a new point layer with random points inside the polygons of a given layer.
  99. The number of points in each polygon can be defined as a fixed count or as a density value. The count/density value could also be taken from an attribute or an expression specified using the "Data defined override" functionality, so it can be different for each polygon in the input layer.
  100. A minimum distance can be specified, to avoid points being too close to each other.
  101. qgis:randomselection: >
  102. This algorithm takes a vector layer and selects a subset of its features. No new layer is generated by this algorithm.
  103. The subset is defined randomly, using a percentage or count value to define the total number of features in the subset.
  104. qgis:randomselectionwithinsubsets: >
  105. This algorithm takes a vector layer and selects a subset of its features. No new layer is generated by this algorithm.
  106. The subset is defined randomly, using a percentage or count value to define the total number of features in the subset.
  107. The percentage/count value is not applied to the whole layer, but instead to each category. Categories are defined according to a given attribute, which is also specified as an input parameter for the algorithm.
  108. qgis:rastercalculator: >
  109. This algorithm allows performing algebraic operations using raster layers.
  110. The resulting layer will have its values computed according to an expression. The expression can contain numerical values, operators and references to any of the layers in the current project. The following functions are also supported:
  111. - sin(), cos(), tan(), atan2(), ln(), log10()
  112. The extent, cell size, and output CRS can be defined by the user. If the extent is not specified, the minimum extent that covers selected reference layer(s) will be used. If the cell size is not specified, the minimum cell size of selected reference layer(s) will be used. If the output CRS is not specified, the CRS of the first reference layer will be used.
  113. The cell size is assumed to be the same in both X and Y axes.
  114. Layers are referred by their name as displayed in the layer list and the number of the band to use (based on 1), using the pattern 'layer_name@band number'. For instance, the first band from a layer named DEM will be referred as DEM@1.
  115. When using the calculator in the batch interface or from the console, the files to use have to be specified. The corresponding layers are referred using the base name of the file (without the full path). For instance, if using a layer at path/to/my/rasterfile.tif, the first band of that layer will be referred as rasterfile.tif@1.
  116. qgis:rasterlayerhistogram: >
  117. This algorithm generates a histogram with the values of a raster layer.
  118. The raster layer must have a single band.
  119. qgis:regularpoints: >
  120. This algorithm creates a point layer with a given number of regular points, all of them within a given extent.
  121. qgis:relief: >
  122. This algorithm creates a shaded relief layer from digital elevation data.
  123. qgis:scatter3dplot: >
  124. This algorithm creates a 3D scatter plot for a vector layer.
  125. qgis:selectbyattribute: >
  126. This algorithm creates a selection in a vector layer. The criteria for selected features is defined based on the values of an attribute from the input layer.
  127. qgis:selectbyexpression: >
  128. This algorithm creates a selection in a vector layer. The criteria for selecting features is based on a QGIS expression.
  129. For help with QGIS expression functions, see the inbuilt help for specific functions which is available in the expression builder.
  130. qgis:setstyleforrasterlayer: >
  131. This algorithm sets the style of a raster layer. The style must be defined in a QML file.
  132. qgis:setstyleforvectorlayer: >
  133. This algorithm sets the style of a vector layer. The style must be defined in a QML file.
  134. qgis:statisticsbycategories: >
  135. This algorithm calculates statistics of fields depending on a parent class.
  136. qgis:texttofloat: >
  137. This algorithm modifies the type of a given attribute in a vector layer, converting a text attribute containing numeric strings into a numeric attribute.
  138. qgis:tininterpolation: >
  139. Generates a Triangulated Irregular Network (TIN) interpolation of a point vector layer.
  140. With the TIN method you can create a surface formed by triangles of nearest neighbor points.
  141. To do this, circumcircles around selected sample points are created and their intersections are connected to a network of non overlapping and as compact as possible triangles.
  142. The resulting surfaces are not smooth.
  143. The algorithm creates both the raster layer of the interpolated values and the vector line layer with the triangulation boundaries.
  144. qgis:topologicalcoloring: >
  145. This algorithm assigns a color index to polygon features in such a way that no adjacent polygons share the same color index, whilst minimizing the number of colors required.
  146. An optional minimum distance between features assigned the same color can be set to prevent nearby (but non-touching) features from being assigned equal colors.
  147. The algorithm allows choice of method to use when assigning colors. The default method attempts to assign colors so that the count of features assigned to each individual color index is balanced.
  148. The 'by assigned area' mode instead assigns colors so that the total area of features assigned to each color is balanced. This mode can be useful to help avoid large features resulting in one of the colors appearing more dominant on a colored map.
  149. The 'by distance between colors' mode will assign colors in order to maximize the distance between features of the same color. This mode helps to create a more uniform distribution of colors across a map.
  150. A minimum number of colors can be specified if desired. The color index is saved to a new attribute named color_id.
  151. qgis:variabledistancebuffer: >
  152. This algorithm computes a buffer area for all the features in an input layer. The size of the buffer for a given feature is defined by an attribute, so it allows different features to have different buffer sizes.
  153. qgis:vectorlayerhistogram: >
  154. This algorithm generates a histogram with the values of the attribute of a vector layer.
  155. The attribute to use for computing the histogram must be a numeric attribute.
  156. qgis:vectorlayerscatterplot: >
  157. This algorithm creates a simple X - Y scatter plot for a vector layer.