The concept of the algorithm, the importance of algorithms in solving spatial tasks, requirements on the algorithm notations, creating algorithms, flow chart.
Vector data - the intersection of the lines, point in the polygon, polygon intersection with the line, polygon overlay operations, distance of a point from the line/polygon, Thiessen polygons.
Generalization lines. Graphs - Representation of graphs, depth-first search, breadth-first search.
Dijkstra's algorithm - finding the shortest path in a graph. Interpolation method.
Raster data - work with georeferenced raster image.
Reclassification of raster image, overlay operations, map algebra, filtering.
Histogram of raster image - calculation of basic statistical characteristics.
Vector data - the intersection of the lines, point in the polygon, polygon intersection with the line, polygon overlay operations, distance of a point from the line/polygon, Thiessen polygons.
Generalization lines. Graphs - Representation of graphs, depth-first search, breadth-first search.
Dijkstra's algorithm - finding the shortest path in a graph. Interpolation method.
Raster data - work with georeferenced raster image.
Reclassification of raster image, overlay operations, map algebra, filtering.
Histogram of raster image - calculation of basic statistical characteristics.