analysis¶
The |
|
|
Geometry Checker¶
A feature pool is based on a vector layer and caches features. |
|
This class implements a geometry check. |
|
Base configuration for geometry checks. |
|
This represents an error reported by a geometry check. |
|
Wraps a |
|
A factory for geometry checks. |
|
This class manages all known geometry check factories. |
|
This class implements a resolution for problems detected in geometry checks. |
|
Contains utilities required for geometry checks. |
|
Base class for geometry checks for a single geometry without any context of the layer or other layers in the project. Classic examples are validity checks like self-intersection. |
|
An error from a |
Georeferencing¶
A geometry transformer which uses an underlying Ground Control Points (GCP) based transformation to modify geometries. |
|
Contains properties of a ground control point (GCP). |
|
An interface for Ground Control Points (GCP) based transformations. |
|
Vector layer warper which warps vector layers based on a list of source and destination GCPs. |
|
A task for warping a vector layer in a background thread. |
Interpolation¶
A class that does interpolation to a grid and writes the results to an ascii grid. |
|
Inverse distance weight interpolator. |
|
Interface class for interpolations. |
|
Interpolation data for an individual source vertex. |
|
Interpolation in a triangular irregular network |
Mesh Layers¶
Exporter of contours lines or polygons from a mesh layer. |
|
Class that can be used with |
|
Class that handles mesh creation with Delaunay constrained triangulation |
|
Convenient class that can be used to obtain a datasetgroup on vertices that represents the Z value of the mesh vertices |
Network Access¶
Mathematical graph representation |
|
This class performs graph analysis, e.g. calculates shortest path between two points using different strategies with Dijkstra algorithm |
|
This class used for making the |
|
Determine interface for creating a graph. Contains the settings of the graph. |
|
Determine making the graph. |
|
This class implements a graph edge |
|
This class implements a graph vertex |
|
Strategy for calculating edge cost based on its length. Should be used for finding shortest path between two points. |
|
Strategy for calculating edge cost based on travel time. Should be used for finding fastest path between two points. |
|
|
|
Determine making the graph from vector line layer |
Processing Framework¶
A base class for batch geocoder algorithms, which takes a |
|
Native c++ processing algorithm provider. |
Raster Layers¶
|
|
Calculates aspect values in a window of 3x3 cells based on first order derivatives in x- and y- directions. |
|
Adds the ability to calculate derivatives in x- and y-directions. |
|
Contains utilities for working with EXIF tags in images. |
|
A hillshade filter. |
|
Performs Kernel Density Estimation (“heatmap”) calculations on a vector layer. |
|
Base class for raster analysis methods that work with a 3x3 cell filter and calculate the value of each cell based on the cell value and the eight neighbour cells. |
|
Represents a node in a raster calculator. |
|
Performs raster layer calculations. |
|
Represents an individual raster layer/band number entry within a raster calculation. |
|
Represents a matrix in a raster calculator operation. |
|
Produces colored relief rasters from DEM. |
|
Calculates the ruggedness index based on a 3x3 moving window. |
|
Calculates slope values in a window of 3x3 cells based on first order derivatives in x- and y- directions. |
|
Calculates total curvature as described by Wilson, Gallant (2000): terrain analysis. |
Vector Layers¶
|
|
Makes sure that any two vertices of the vector layer are at least at distance given by the threshold value. |
|
|
|
A class that calculates raster statistics (count, sum, mean) for a polygon or multipolygon layer and appends the results as attributes. |