Important
Traducerea este un efort al comunității, la care puteți să vă alăturați. În prezent, această pagină este tradusă 66.08%.
28.1.19. Analiza vectorilor
28.1.19.1. Basic statistics for fields
Generates basic statistics for a field of the attribute table of a vector layer.
Numeric, date, time and string fields are supported.
The statistics returned will depend on the field type.
Statistics are generated as an HTML file and are available in the
.Default menu:
Parametri
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Vector de intrare |
|
[vector: oricare] |
Vector layer to calculate the statistics on |
Field to calculate statistics on |
|
[tablefield: any] |
Any supported table field to calculate the statistics |
Statistici Opţional |
|
[html] Implicit: |
Specification of the file for the calculated statistics. One of:
|
Rezultat
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Statistici |
|
[html] |
HTML file with the calculated statistics |
Count |
|
[număr] |
|
Number of unique values |
|
[număr] |
|
Number of empty (null) values |
|
[număr] |
|
Number of non-empty values |
|
[număr] |
|
Minimum value |
|
[la fel ca intrarea] |
|
Maximum value |
|
[la fel ca intrarea] |
|
Minimum length |
|
[număr] |
|
Maximum length |
|
[număr] |
|
Mean length |
|
[număr] |
|
Coefficient of Variation |
|
[număr] |
|
Sum |
|
[număr] |
|
Mean value |
|
[număr] |
|
Standard deviation |
|
[număr] |
|
Range |
|
[număr] |
|
Median |
|
[număr] |
|
Minority (rarest occurring value) |
|
[la fel ca intrarea] |
|
Majority (most frequently occurring value) |
|
[la fel ca intrarea] |
|
First quartile |
|
[număr] |
|
Third quartile |
|
[număr] |
|
Interquartile Range (IQR) |
|
[număr] |
Cod Python
Algorithm ID: qgis:basicstatisticsforfields
import processing
processing.run("algorithm_id", {parameter_dictionary})
ID-ul algoritmului se afișează atunci când treceți peste algoritmul din caseta instrumentelor de procesare. Dicționarul parametrilor furnizează valorile și NUMELE parametrilor. Pentru detalii despre rularea algoritmilor de procesare din consola Python, parcurgeți Utilizarea algoritmilor de procesare din consolă.
28.1.19.2. Climb along line
Calculates the total climb and descent along line geometries. The input layer 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.
The output layer is a copy of the input layer with additional fields
that contain the total climb (climb
), total descent (descent
),
the minimum elevation (minelev
) and the maximum elevation
(maxelev
) 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).
Parametri
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Line layer |
|
[vector: linie] |
Line layer to calculate the climb for. Must have Z values |
Climb layer |
|
[vector: linie] Implicit: |
Specification of the output (line) layer. One of:
The file encoding can also be changed here. |
Rezultat
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Climb layer |
|
[vector: linie] |
Line layer containing new attributes with the results from climb calculations. |
Total climb |
|
[număr] |
The sum of the climb for all the line geometries in the input layer |
Total descent |
|
[număr] |
The sum of the descent for all the line geometries in the input layer |
Minimum elevation |
|
[număr] |
The minimum elevation for the geometries in the layer |
Maximum elevation |
|
[număr] |
The maximum elevation for the geometries in the layer |
Cod Python
Algorithm ID: qgis:climbalongline
import processing
processing.run("algorithm_id", {parameter_dictionary})
ID-ul algoritmului se afișează atunci când treceți peste algoritmul din caseta instrumentelor de procesare. Dicționarul parametrilor furnizează valorile și NUMELE parametrilor. Pentru detalii despre rularea algoritmilor de procesare din consola Python, parcurgeți Utilizarea algoritmilor de procesare din consolă.
28.1.19.3. Count points in polygon
Takes a point and a polygon layer and counts the number of points from the point layer in each of the polygons of the polygon layer.
A new polygon layer is generated, with the exact same content as the input polygon layer, but containing an additional field with the points count corresponding to each polygon.
An optional weight field can be used to assign weights to each point. Alternatively, a unique class field can be specified. If both options are used, the weight field will take precedence and the unique class field will be ignored.
Allows features in-place modification of polygon features
Default menu
:
Parametri
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Poligoane |
|
[vector: poligon] |
Polygon layer whose features are associated with the count of points they contain |
Puncte |
|
[vector: punct] |
Point layer with features to count |
Weight field Opţional |
|
[tablefield: any] |
A field from the point layer.
The count generated will be the sum of the weight field of the
points contained by the polygon.
If the weight field is not numeric, the count will be |
Class field Opţional |
|
[tablefield: any] |
Points are classified based on the selected attribute and if several points with the same attribute value are within the polygon, only one of them is counted. The final count of the points in a polygon is, therefore, the count of different classes that are found in it. |
Count field name |
|
[string] Implicit: «NUMPOINTS» |
The name of the field to store the count of points |
Count |
|
[vector: poligon] Implicit: |
Specification of the output layer. One of:
The file encoding can also be changed here. |
Rezultat
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Count |
|
[vector: poligon] |
Resulting layer with the attribute table containing the new column with the points count |
Cod Python
ID Algorithm: nativ:countpointsinpolygon
import processing
processing.run("algorithm_id", {parameter_dictionary})
ID-ul algoritmului se afișează atunci când treceți peste algoritmul din caseta instrumentelor de procesare. Dicționarul parametrilor furnizează valorile și NUMELE parametrilor. Pentru detalii despre rularea algoritmilor de procesare din consola Python, parcurgeți Utilizarea algoritmilor de procesare din consolă.
28.1.19.4. DBSCAN clustering
Clusters point features based on a 2D implementation of Density-based spatial clustering of applications with noise (DBSCAN) algorithm.
The algorithm requires two parameters, a minimum cluster size, and the maximum distance allowed between clustered points.
Vezi și
Parametri
Parametri de bază
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Strat de intrare |
|
[vector: punct] |
Layer to analyze |
Minimum cluster size |
|
[număr] Implicit: 5 |
Minimum number of features to generate a cluster |
Maximum distance between clustered points |
|
[număr] Implicit: 1.0 |
Distance beyond which two features can not belong to the same cluster (eps) |
Clusters |
|
[vector: punct] Implicit: |
Specify the vector layer for the result of the clustering. One of:
The file encoding can also be changed here. |
Parametri avansați
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Treat border points as noise (DBSCAN*) Opţional |
|
[boolean] Implicit: False |
If checked, points on the border of a cluster are themselves treated as unclustered points, and only points in the interior of a cluster are tagged as clustered. |
Cluster field name |
|
[string] Implicit: «CLUSTER_ID» |
Name of the field where the associated cluster number shall be stored |
Cluster size field name |
|
[string] Implicit: «CLUSTER_SIZE» |
Name of the field with the count of features in the same cluster |
Rezultat
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Clusters |
|
[vector: punct] |
Vector layer containing the original features with a field setting the cluster they belong to |
Number of clusters |
|
[număr] |
The number of clusters discovered |
Cod Python
ID Algorithm: nativ:dbscanclustering
import processing
processing.run("algorithm_id", {parameter_dictionary})
ID-ul algoritmului se afișează atunci când treceți peste algoritmul din caseta instrumentelor de procesare. Dicționarul parametrilor furnizează valorile și NUMELE parametrilor. Pentru detalii despre rularea algoritmilor de procesare din consola Python, parcurgeți Utilizarea algoritmilor de procesare din consolă.
28.1.19.5. Distance matrix
Calculates for point features distances to their nearest features in the same layer or in another layer.
Default menu:
Vezi și
Parametri
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Input point layer |
|
[vector: punct] |
Point layer for which the distance matrix is calculated (from points) |
Input unique ID field |
|
[tablefield: any] |
Field to use to uniquely identify features of the input layer. Used in the output attribute table. |
Target point layer |
|
[vector: punct] |
Point layer containing the nearest point(s) to search (to points) |
Target unique ID field |
|
[tablefield: any] |
Field to use to uniquely identify features of the target layer. Used in the output attribute table. |
Output matrix type |
|
[enumerare] Implicit: 0 |
Different types of calculation are available:
|
Use only the nearest (k) target points |
|
[număr] Implicit: 0 |
You can choose to calculate the distance to all the points in the target layer (0) or limit to a number (k) of closest features. |
Distance matrix |
|
[vector: punct] Implicit: |
Specification of the output vector layer. One of:
The file encoding can also be changed here. |
Rezultat
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Distance matrix |
|
[vector: punct] |
Point (or MultiPoint for the „Linear (N * k x 3)” case) vector layer containing the distance calculation for each input feature. Its features and attribute table depend on the selected output matrix type. |
Cod Python
Algorithm ID: qgis:distancematrix
import processing
processing.run("algorithm_id", {parameter_dictionary})
ID-ul algoritmului se afișează atunci când treceți peste algoritmul din caseta instrumentelor de procesare. Dicționarul parametrilor furnizează valorile și NUMELE parametrilor. Pentru detalii despre rularea algoritmilor de procesare din consola Python, parcurgeți Utilizarea algoritmilor de procesare din consolă.
28.1.19.6. Distance to nearest hub (line to hub)
Creates lines that join each feature of an input vector to the nearest feature in a destination layer. Distances are calculated based on the center of each feature.
Parametri
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Source points layer |
|
[vector: oricare] |
Vector layer for which the nearest feature is searched |
Destination hubs layer |
|
[vector: oricare] |
Vector layer containing the features to search for |
Hub layer name attribute |
|
[tablefield: any] |
Field to use to uniquely identify features of the destination layer. Used in the output attribute table |
Measurement unit |
|
[enumerare] Implicit: 0 |
Units in which to report the distance to the closest feature:
|
Hub distance |
|
[vector: linie] Implicit: |
Specify the output line vector layer connecting the matching points. One of:
The file encoding can also be changed here. |
Rezultat
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Hub distance |
|
[vector: linie] |
Line vector layer with the attributes of the input features, the identifier of their closest feature and the calculated distance. |
Cod Python
Algorithm ID: qgis:distancetonearesthublinetohub
import processing
processing.run("algorithm_id", {parameter_dictionary})
ID-ul algoritmului se afișează atunci când treceți peste algoritmul din caseta instrumentelor de procesare. Dicționarul parametrilor furnizează valorile și NUMELE parametrilor. Pentru detalii despre rularea algoritmilor de procesare din consola Python, parcurgeți Utilizarea algoritmilor de procesare din consolă.
28.1.19.7. Distance to nearest hub (points)
Creates a point layer representing the center of the input features with the addition of two fields containing the identifier of the nearest feature (based on its center point) and the distance between the points.
Parametri
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Source points layer |
|
[vector: oricare] |
Vector layer for which the nearest feature is searched |
Destination hubs layer |
|
[vector: oricare] |
Vector layer containing the features to search for |
Hub layer name attribute |
|
[tablefield: any] |
Field to use to uniquely identify features of the destination layer. Used in the output attribute table |
Measurement unit |
|
[enumerare] Implicit: 0 |
Units in which to report the distance to the closest feature:
|
Hub distance |
|
[vector: punct] Implicit: |
Specify the output point vector layer with the nearest hub. One of:
The file encoding can also be changed here. |
Rezultat
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Hub distance |
|
[vector: punct] |
Point vector layer representing the center of the source features with their attributes, the identifier of their closest feature and the calculated distance. |
Cod Python
Algorithm ID: qgis:distancetonearesthubpoints
import processing
processing.run("algorithm_id", {parameter_dictionary})
ID-ul algoritmului se afișează atunci când treceți peste algoritmul din caseta instrumentelor de procesare. Dicționarul parametrilor furnizează valorile și NUMELE parametrilor. Pentru detalii despre rularea algoritmilor de procesare din consola Python, parcurgeți Utilizarea algoritmilor de procesare din consolă.
28.1.19.8. Join by lines (hub lines)
Creates hub and spoke diagrams by connecting lines from points on the Spoke layer to matching points in the Hub layer.
Determination of which hub goes with each point is based on a match between the Hub ID field on the hub points and the Spoke ID field on the spoke points.
If input layers are not point layers, a point on the surface of the geometries will be taken as the connecting location.
Optionally, geodesic lines can be created, which represent the shortest path on the surface of an ellipsoid. When geodesic mode is used, it is possible to split the created lines at the antimeridian (±180 degrees longitude), which can improve rendering of the lines. Additionally, the distance between vertices can be specified. A smaller distance results in a denser, more accurate line.
Parametri
Parametri de bază
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Hub layer |
|
[vector: oricare] |
Strat de intrare |
Hub ID field |
|
[tablefield: any] |
Field of the hub layer with ID to join |
Hub layer fields to copy (leave empty to copy all fields) Opţional |
|
[tablefield: any] [list] |
The field(s) of the hub layer to be copied. If no field(s) are chosen all fields are taken. |
Spoke layer |
|
[vector: oricare] |
Additional spoke point layer |
Spoke ID field |
|
[tablefield: any] |
Field of the spoke layer with ID to join |
Spoke layer fields to copy (leave empty to copy all fields) Opţional |
|
[tablefield: any] [list] |
Field(s) of the spoke layer to be copied. If no fields are chosen all fields are taken. |
Create geodesic lines |
|
[boolean] Implicit: False |
Create geodesic lines (the shortest path on the surface of an ellipsoid) |
Hub lines |
|
[vector: linie] Implicit: |
Specify the output hub line vector layer. One of:
The file encoding can also be changed here. |
Parametri avansați
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Distance between vertices (geodesic lines only) |
|
[număr] Implicit: 1000.0 (kilometri) |
Distance between consecutive vertices (in kilometers). A smaller distance results in a denser, more accurate line |
Split lines at antimeridian (±180 degrees longitude) |
|
[boolean] Implicit: False |
Split lines at ±180 degrees longitude (to improve rendering of the lines) |
Rezultat
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Hub lines |
|
[vector: linie] |
The resulting line layer connecting matching points in input layers |
Cod Python
ID Algorithm: nativ:hublines
import processing
processing.run("algorithm_id", {parameter_dictionary})
ID-ul algoritmului se afișează atunci când treceți peste algoritmul din caseta instrumentelor de procesare. Dicționarul parametrilor furnizează valorile și NUMELE parametrilor. Pentru detalii despre rularea algoritmilor de procesare din consola Python, parcurgeți Utilizarea algoritmilor de procesare din consolă.
28.1.19.9. K-means clustering
Calculates the 2D distance based k-means cluster number for each input feature.
K-means clustering aims to partition the features into k clusters in which each feature belongs to the cluster with the nearest mean. The mean point is represented by the barycenter of the clustered features.
If input geometries are lines or polygons, the clustering is based on the centroid of the feature.
Vezi și
Parametri
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Strat de intrare |
|
[vector: oricare] |
Layer to analyze |
Number of clusters |
|
[număr] Implicit: 5 |
Number of clusters to create with the features |
Clusters |
|
[vector: oricare] Implicit: |
Specify the output vector layer for generated the clusters. One of:
The file encoding can also be changed here. |
Parametri avansați
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Cluster field name |
|
[string] Implicit: «CLUSTER_ID» |
Name of the field where the associated cluster number shall be stored |
Cluster size field name |
|
[string] Implicit: «CLUSTER_SIZE» |
Name of the field with the count of features in the same cluster |
Rezultat
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Clusters |
|
[vector: oricare] |
Vector layer containing the original features with fields specifying the cluster they belong to and their number in it |
Cod Python
ID Algorithm: nativ:kmeansclustering
import processing
processing.run("algorithm_id", {parameter_dictionary})
ID-ul algoritmului se afișează atunci când treceți peste algoritmul din caseta instrumentelor de procesare. Dicționarul parametrilor furnizează valorile și NUMELE parametrilor. Pentru detalii despre rularea algoritmilor de procesare din consola Python, parcurgeți Utilizarea algoritmilor de procesare din consolă.
28.1.19.10. List unique values
Lists unique values of an attribute table field and counts their number.
Default menu:
Parametri
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Strat de intrare |
|
[vector: oricare] |
Layer to analyze |
Target field(s) |
|
[tablefield: any] |
Field to analyze |
Valori unice Opţional |
|
[tabelă] Implicit: |
Specify the summary table layer with unique values. One of:
The file encoding can also be changed here. |
HTML report Opţional |
|
[html] Implicit: |
HTML report of unique values in the . One of:
|
Rezultat
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Valori unice |
|
[tabelă] |
Summary table layer with unique values |
HTML report |
|
[html] |
HTML report of unique values. Can be opened from the |
Total unique values |
|
[număr] |
The number of unique values in the input field |
Unique values concatenated |
|
[string] |
A string with the comma separated list of unique values found in the input field |
Cod Python
Algorithm ID: qgis:listuniquevalues
import processing
processing.run("algorithm_id", {parameter_dictionary})
ID-ul algoritmului se afișează atunci când treceți peste algoritmul din caseta instrumentelor de procesare. Dicționarul parametrilor furnizează valorile și NUMELE parametrilor. Pentru detalii despre rularea algoritmilor de procesare din consola Python, parcurgeți Utilizarea algoritmilor de procesare din consolă.
28.1.19.11. Mean coordinate(s)
Computes a point layer with the center of mass of geometries in an input layer.
An attribute can be specified as containing weights to be applied to each feature when computing the center of mass.
If an attribute is selected in the parameter, features will be grouped according to values in this field. Instead of a single point with the center of mass of the whole layer, the output layer will contain a center of mass for the features in each category.
Default menu:
Parametri
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Strat de intrare |
|
[vector: oricare] |
Stratul vectorial de intrare |
Weight field Opţional |
|
[tablefield: numeric] |
Field to use if you want to perform a weighted mean |
Unique ID field |
|
[tablefield: numeric] |
Unique field on which the calculation of the mean will be made |
Mean coordinates |
|
[vector: punct] Implicit: |
Specify the (point vector) layer for the result. One of:
The file encoding can also be changed here. |
Rezultat
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Mean coordinates |
|
[vector: punct] |
Resulting point(s) layer |
Cod Python
ID Algorithm: nativ:meancoordinates
import processing
processing.run("algorithm_id", {parameter_dictionary})
ID-ul algoritmului se afișează atunci când treceți peste algoritmul din caseta instrumentelor de procesare. Dicționarul parametrilor furnizează valorile și NUMELE parametrilor. Pentru detalii despre rularea algoritmilor de procesare din consola Python, parcurgeți Utilizarea algoritmilor de procesare din consolă.
28.1.19.12. Nearest neighbour analysis
Performs nearest neighbor analysis for a point layer. The output tells you how your data are distributed (clustered, randomly or distributed).
Output is generated as an HTML file with the computed statistical values:
Observed mean distance
Expected mean distance
Nearest neighbour index
Number of points
Z-Score: Comparing the Z-Score with the normal distribution tells you how your data are distributed. A low Z-Score means that the data are unlikely to be the result of a spatially random process, while a high Z-Score means that your data are likely to be a result of a spatially random process.
Default menu:
Vezi și
Parametri
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Strat de intrare |
|
[vector: punct] |
Point vector layer to calculate the statistics on |
Nearest neighbour Opţional |
|
[html] Implicit: |
Specification of the HTML file for the computed statistics. One of:
|
Rezultat
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Nearest neighbour |
|
[html] |
HTML file with the computed statistics |
Observed mean distance |
|
[număr] |
Observed mean distance |
Expected mean distance |
|
[număr] |
Expected mean distance |
Nearest neighbour index |
|
[număr] |
Nearest neighbour index |
Number of points |
|
[număr] |
Number of points |
Z-Score |
|
[număr] |
Z-Score |
Cod Python
ID Algorithm: nativ:nearestneighbouranalysis
import processing
processing.run("algorithm_id", {parameter_dictionary})
ID-ul algoritmului se afișează atunci când treceți peste algoritmul din caseta instrumentelor de procesare. Dicționarul parametrilor furnizează valorile și NUMELE parametrilor. Pentru detalii despre rularea algoritmilor de procesare din consola Python, parcurgeți Utilizarea algoritmilor de procesare din consolă.
28.1.19.13. Overlap analysis
Calculates the area and percentage cover by which features from an input layer are overlapped by features from a selection of overlay layers.
New attributes are added to the output layer reporting the total area of overlap and percentage of the input feature overlapped by each of the selected overlay layers.
Parametri
Parametri de bază
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Strat de intrare |
|
[vector: oricare] |
Stratul de intrare. |
Overlap layers |
|
[vector: oricare] [list] |
The overlay layers. |
Overlap |
|
[la fel ca intrarea] Implicit: |
Specify the output vector layer. One of:
The file encoding can also be changed here. |
Parametri avansați
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Grid size Opţional |
|
[număr] Implicit: Nesetat |
If provided, the input geometries are snapped to a grid of the given size, and the result vertices are computed on that same grid. Requires GEOS 3.9.0 or higher. |
Rezultat
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Overlap |
|
[la fel ca intrarea] |
The output layer with additional fields reporting the overlap (in map units and percentage) of the input feature overlapped by each of the selected layers. |
Cod Python
ID Algorithm: nativ:calculatevectoroverlaps
import processing
processing.run("algorithm_id", {parameter_dictionary})
ID-ul algoritmului se afișează atunci când treceți peste algoritmul din caseta instrumentelor de procesare. Dicționarul parametrilor furnizează valorile și NUMELE parametrilor. Pentru detalii despre rularea algoritmilor de procesare din consola Python, parcurgeți Utilizarea algoritmilor de procesare din consolă.
28.1.19.14. Shortest line between features
Creates a line layer as the shortest line between the source and the destination layer. By default only the first nearest feature of the destination layer is taken into account. The n-nearest neighboring features number can be specified. If a maximum distance is specified, then only features which are closer than this distance will be considered.
The output features will contain all the source layer attributes, all the attributes from the n-nearest feature and the additional field of the distance.
Important
This algorithm uses purely Cartesian calculations for distance, and does not consider geodetic or ellipsoid properties when determining feature proximity. The measurement and output coordinate system is based on the coordinate system of the source layer.
Parametri
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Source layer |
|
[vector: oricare] |
Origin layer for which to search for nearest neighbors |
Destination layer |
|
[vector: oricare] |
Target Layer in which to search for nearest neighbors |
Method |
|
[enumerare] Implicit: 0 |
Shortest distance calculation method Possible values are:
|
Maximum number of neighbors |
|
[număr] Implicit: 1 |
Maximum number of neighbors to look for |
Maximum distance Opţional |
|
[număr] |
Only destination features which are closer than this distance will be considered. |
Shortest lines |
|
[vector: linie] Implicit: |
Specify the output vector layer. One of:
The file encoding can also be changed here. |
Rezultat
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Output layer |
|
[vector: linie] |
Line vector layer joining source features to their nearest neighbor(s) in the destination layer. Contains all attributes for both source and destination features, and the computed distance. |
Cod Python
Algorithm ID: native:shortestline
import processing
processing.run("algorithm_id", {parameter_dictionary})
ID-ul algoritmului se afișează atunci când treceți peste algoritmul din caseta instrumentelor de procesare. Dicționarul parametrilor furnizează valorile și NUMELE parametrilor. Pentru detalii despre rularea algoritmilor de procesare din consola Python, parcurgeți Utilizarea algoritmilor de procesare din consolă.
28.1.19.15. ST-DBSCAN clustering
Clusters point features based on a 2D implementation of spatiotemporal Density-based clustering of applications with noise (ST-DBSCAN) algorithm.
Vezi și
Parametri
Parametri de bază
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Strat de intrare |
|
[vector: punct] |
Layer to analyze |
Date/time field |
|
[tablefield: date] |
Field containing the temporal information |
Minimum cluster size |
|
[număr] Implicit: 5 |
Minimum number of features to generate a cluster |
Maximum distance between clustered points |
|
[număr] Implicit: 1.0 |
Distance beyond which two features can not belong to the same cluster (eps) |
Maximum time duration between clustered points |
|
[număr] Implicit: 0.0 (zile) |
Time duration beyond which two features can not belong to the same cluster (eps2). Available time units are milliseconds, seconds, minutes, hours, days and weeks. |
Clusters |
|
[vector: punct] Implicit: |
Specify the vector layer for the result of the clustering. One of:
The file encoding can also be changed here. |
Parametri avansați
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Treat border points as noise (DBSCAN*) Opţional |
|
[boolean] Implicit: False |
If checked, points on the border of a cluster are themselves treated as unclustered points, and only points in the interior of a cluster are tagged as clustered. |
Cluster field name |
|
[string] Implicit: «CLUSTER_ID» |
Name of the field where the associated cluster number shall be stored |
Cluster size field name |
|
[string] Implicit: «CLUSTER_SIZE» |
Name of the field with the count of features in the same cluster |
Rezultat
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Clusters |
|
[vector: punct] |
Vector layer containing the original features with a field setting the cluster they belong to |
Number of clusters |
|
[număr] |
The number of clusters discovered |
Cod Python
ID Algorithm: nativ:stdbscanclustering
import processing
processing.run("algorithm_id", {parameter_dictionary})
ID-ul algoritmului se afișează atunci când treceți peste algoritmul din caseta instrumentelor de procesare. Dicționarul parametrilor furnizează valorile și NUMELE parametrilor. Pentru detalii despre rularea algoritmilor de procesare din consola Python, parcurgeți Utilizarea algoritmilor de procesare din consolă.
28.1.19.16. Statistics by categories
Calculates statistics of a field depending on a parent class. The parent class is a combination of values from other fields.
Parametri
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Input vector layer |
|
[vector: oricare] |
Input vector layer with unique classes and values |
Field to calculate statistics on (if empty, only count is calculated) Opţional |
|
[tablefield: any] |
If empty only the count will be calculated |
Field(s) with categories |
|
[vector: oricare] [list] |
The fields that (combined) define the categories |
Statistics by category |
|
[tabelă] Implicit: |
Specify the output table for the generated statistics. One of:
The file encoding can also be changed here. |
Rezultat
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Statistics by category |
|
[tabelă] |
Table containing the statistics |
Depending on the type of the field being analyzed, the following statistics are returned for each grouped value:
Statistici |
Șirul |
Numeric |
Data |
---|---|---|---|
Count ( |
|||
Unique values ( |
|||
Empty (null) values ( |
|||
Non-empty values ( |
|||
Minimal value ( |
|||
Maximal value ( |
|||
Range ( |
|||
Sum ( |
|||
Mean value ( |
|||
Median value ( |
|||
Standard Deviation ( |
|||
Coefficient of variation ( |
|||
Minority (rarest occurring value - |
|||
Majority (most frequently occurring value - |
|||
First Quartile ( |
|||
Third Quartile ( |
|||
Inter Quartile Range ( |
|||
Minimum Length ( |
|||
Mean Length ( |
|||
Maximum Length ( |
Cod Python
Algorithm ID: qgis:statisticsbycategories
import processing
processing.run("algorithm_id", {parameter_dictionary})
ID-ul algoritmului se afișează atunci când treceți peste algoritmul din caseta instrumentelor de procesare. Dicționarul parametrilor furnizează valorile și NUMELE parametrilor. Pentru detalii despre rularea algoritmilor de procesare din consola Python, parcurgeți Utilizarea algoritmilor de procesare din consolă.
28.1.19.17. Sum line lengths
Takes a polygon layer and a line layer and measures the total length of lines and the total number of them that cross each polygon.
The resulting layer has the same features as the input polygon layer, but with two additional attributes containing the length and count of the lines across each polygon.
Allows features in-place modification of polygon features
Default menu:
Parametri
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Lines |
|
[vector: linie] |
Input vector line layer |
Poligoane |
|
[vector: poligon] |
Polygon vector layer |
Lines length field name |
|
[string] Implicit: «LENGTH» |
Name of the field for the lines length |
Lines count field name |
|
[string] Implicit: «COUNT» |
Name of the field for the lines count |
Line length |
|
[vector: poligon] Implicit: |
Specify the output polygon layer with generated statistics. One of:
The file encoding can also be changed here. |
Rezultat
Etichetă |
Nume |
Tipul |
Descriere |
---|---|---|---|
Line length |
|
[vector: poligon] |
Polygon output layer with fields of lines length and line count |
Cod Python
ID Algorithm: nativ:sumlinelengths
import processing
processing.run("algorithm_id", {parameter_dictionary})
ID-ul algoritmului se afișează atunci când treceți peste algoritmul din caseta instrumentelor de procesare. Dicționarul parametrilor furnizează valorile și NUMELE parametrilor. Pentru detalii despre rularea algoritmilor de procesare din consola Python, parcurgeți Utilizarea algoritmilor de procesare din consolă.