# 5 Geometric operations

## Prerequisites

• This chapter uses the same packages as Chapter 4 but with the addition of spDataLarge, which was installed in Chapter 2:

## 5.1 Introduction

The previous three chapters have demonstrated how geographic datasets are structured in R (Chapter 2) and how to manipulate them based on their non-geographic attributes (Chapter 3) and spatial properties (Chapter 4). This chapter extends these skills. After reading it — and attempting the exercises at the end — you should understand and have control over the geometry column in sf objects and the geographic location of pixels represented in rasters.

Section 5.2 covers transforming vector geometries with ‘unary’ and ‘binary’ operations. Unary operations work on a single geometry in isolation. This includes simplification (of lines and polygons), the creation of buffers and centroids, and shifting/scaling/rotating single geometries using ‘affine transformations’ (sections 5.2.1 to 5.2.4). Binary transformations modify one geometry based on the shape of another. This includes clipping and geometry unions, covered in sections 5.2.5 and 5.2.6 respectively. Type transformations (from a polygon to a line, for example) are demonstrated in section 5.2.7.

Section 5.3 covers geometric transformations on raster objects. This involves changing the size and number of the underlying pixels, and assigning them new values. It teaches how to change the resolution (also called raster aggregation and disaggregation), the extent and the origin of a raster. These operations are especially useful if one would like to align raster datasets from diverse sources. Aligned raster objects share a one-to-one correspondence between pixels, allowing them to be processed using map algebra operations, described in section 4.3.2.

Section 5.4 connects vector and raster objects. It includes raster cropping and masking based on vector data location, raster values extraction using vector objects, and raster-vector conversions.

## 5.2 Geometric operations on vector data

This section is about operations that in some way change the geometry of vector (sf) objects. It is more advanced than the spatial data operations presented in the previous chapter (in section 4.2) because here we drill down into the geometry: the functions discussed in this section work on objects of class sfc in addition to objects of class sf.

### 5.2.1 Simplification

Simplification is a process for generalization of vector objects (lines and polygons) usually for use in smaller scale maps. Another reason for simplifying objects is to reduce the amount of memory, disk space and network bandwidth they consume: it may be wise to simplify complex geometries before publishing them as interactive maps. The sf package provides st_simplify(), which uses the GEOS implementation of the Douglas-Peucker algorithm to reduce the vertex count. st_simplify() uses the dTolerance to control the level of generalization in map units (see Douglas and Peucker 1973 for details). Figure 5.1 illustrates simplification of a LINESTRING geometry representing the river Seine and tributaries. The simplified geometry was created by the following command:

The resulting seine_simp object is a copy of the original seine but with fewer vertices. This is apparent, with the result being visually simpler (Figure 5.1, right) and consuming less memory than the original object, as verified below:

Simplification is also applicable for polygons. This is illustrated using us_states, representing the contiguous United States. As we showed in section 6, GEOS assumes that the data is in a projected CRS and this could lead to unexpected results when using a geographic CRS. Therefore, the first step is to project the data into some adequate projected CRS, such as US National Atlas Equal Area (epsg = 2163) (on the left in Figure 5.2):

st_simplify() works equally well with projected polygons:

A limitation with st_simplify() is that it simplifies objects on a per-geometry basis. This means the ‘topology’ is lost, resulting in overlapping and ‘holy’ areal units illustrated in Figure 5.2 (middle panel). ms_simplify() from rmapshaper provides an alternative that overcomes this issue. By default it uses the Visvalingam algorithm, which overcomes some limitations of the Douglas-Peucker algorithm (Visvalingam and Whyatt 1993). The following code chunk uses this function to simplify us_states2163. The result has only 1% of the vertices of the input (set using the argument keep) but its number of objects remains intact because we set keep_shapes = TRUE:19

Finally, the visual comparison of the original dataset and the two simplified versions shows differences between the Douglas-Peucker (st_simplify) and Visvalingam (ms_simplify) algorithm outputs (Figure 5.2):

### 5.2.2 Centroids

Centroid operations identify the center of geographic objects. Like statistical measures of central tendency (including mean and median definitions of ‘average’), there are many ways to define the geographic center of an object. All of create single point representations of more complex vector objects.

The most commonly used centroid operation is the geographic centroid. This type of centroid operation (often referred to as ‘the centoid’) represents the centre of mass in a spatial object (think of balancing a plate on your finger). Geographic centroids have many uses, for example to create a simple point representation of complex geometries, or to estimate distances between polygons. They can be calculated with the sf function st_centroid() as demonstrated in the code below, which generates the geographic centroids of regions in New Zealand and tributaries to the River Seine, illustrated with black points in Figure 5.3.

Sometimes the geographic centroid falls outside the boundaries of their parent objects (think of a dohnut). In such cases point on surface operations can be used to guarantee the point will be in the parent object (e.g. for labelling irregular multipolygon objects such as island states), as illustrated by the red points in Figure 5.3. Notice that these red points always lie on their parent objects. They were created with st_point_on_surface() as follows:20

Other types of centroid exist, including the Chebyshev center and the visual center. We will not explore these here but it is possible to calculate them using R, as we’ll see Chapter 10.

### 5.2.3 Buffers

Buffers are polygons representing the area within a given distance of a geometric feature: regardless of whether the input is a point, line or polygon, the output is polygon. Unlike simplification (which is often used for visualization and reducing file size) buffering tends to be used for geographic data analysis. How many points are within a given distance of this line? Which demographic groups are within travel distance of this new shop? These kinds of questions can be answered and visualized by creating buffers around the geographic entities of interest.

Figure 5.4 illustrates buffers of different sizes (5 and 20 km) surrounding the river Seine and tributaries. These buffers were created with commands below, which show that the command st_buffer() requires at least two arguments: an input geometry and a distance, provided in the units of the CRS (in this case meters):

The third and final argument of st_buffer() is nQuadSegs, which means ‘number of segments per quadrant’ and is set by default to 30 (meaning circles created by buffers are composed of $$4 \times 30 = 120$$ lines). This argument rarely needs be set. Unusual cases where it may be useful include when the memory consumed by the output of a buffer operation is a major concern (in which case it should be reduced) or when very high precision is needed (in which case it should be increased).

### 5.2.4 Affine transformations

Affine transformation is any transformation that preserves lines and parallelism. However, angles or length are not necessarily preserved. Affine transformations include, among others, shifting (translation), scaling and rotation. Additionally, it is possible to use any combination of these. Affine transformations are an essential part of geocomputation. For example, shifting is needed for labels placement, scaling is used in non-contiguous area cartograms (see Section 8.6), and many affine transformations are applied when reprojecting or improving the geometry that was created based on a distorted or wrongly projected map. The sf package implements affine transformation for objects of classes sfg and sfc.

Shifting moves every point by the same distance in map units. It could be done by adding a numerical vector to a vector object. For example, the code below shifts all y-coordinates by 100,000 meters to the north but leaves the x-coordinates untouched (left panel on the Fig. 5.5).

Scaling enlarges or shrinks objects by a factor. It can be applied either globally or locally. Global scaling increases or decreases all coordinates values in relation to the origin coordinates, while keeping all geometries topological relations intact. It can by done by subtraction or multiplication of asfg or sfc object.

Local scaling treats geometries independently and requires points around which geometries are going to be scaled, e.g. centroids. In the example below, each geometry is shrunk by a factor of two around the centroids (central panel on the Fig. 5.5). To achieve that, each object is firstly shifted in a way that its center has coordinates of 0, 0 ((nz_sfc - nz_centroid_sfc)). Next, the sizes of the geometries are reduced by half (* 0.5). Finally, each object’s centroid is moved back to the input data coordinates (+ nz_centroid_sfc).

Rotation of two-dimensional coordinates requires a rotation matrix:

$R = \begin{bmatrix} \cos \theta & -\sin \theta \\ \sin \theta & \cos \theta \\ \end{bmatrix}$

It rotates points in a counterclockwise direction. The rotation matrix could be implemented in R as:

The rotation function accepts one argument a - a rotation angle in degrees. Rotation could be done around selected points, such as centroids (right panel on the Fig. 5.5). See vignette("sf3") for more examples.

Finally, the newly created geometries can replace the old ones with the st_set_geometry() function:

### 5.2.5 Clipping

Spatial clipping is a form of spatial subsetting that involves changes to the geometry columns of at least some of the affected features.

Clipping can only apply to features more complex than points: lines, polygons and their ‘multi’ equivalents. To illustrate the concept we will start with a simple example: two overlapping circles with a center point one unit away from each other and a radius of one:

Imagine you want to select not one circle or the other, but the space covered by both x and y. This can be done using the function st_intersection(), illustrated using objects named x and y which represent the left and right-hand circles:

The subsequent code chunk demonstrates how this works for all combinations of the ‘Venn’ diagram representing x and y, inspired by Figure 5.1 of the book R for Data Science (Grolemund and Wickham 2016).

To illustrate the relationship between subsetting and clipping spatial data, we will subset points that cover the bounding box of the circles x and y in Figure 5.7. Some points will be inside just one circle, some will be inside both and some will be inside neither. st_sample() is used below to generate a simple random distribution of points within the extent of circles x and y, resulting in output illustrated in Figure 5.8.

The logical operator way would find the points inside both x and y using a spatial predicate such as st_intersects() whereas the intersection method simply finds the points inside the intersecting region created above as x_and_y. As demonstrated below the results are identical, but the method that uses the clipped polygon is more concise:

### 5.2.6 Geometry unions

As we saw in section 3.2.2, spatial aggregation can silently dissolve the geometries of touching polygons in the same group. This is demonstrated in the code chunk below in which 49 us_states are aggregated into 4 regions using base and tidyverse functions (see results in Figure 5.9):

What is going on in terms of the geometries? Behind the scenes, both aggregate() and summarize() combine the geometries and disolve the boundaries between them using st_union(). This is demonstrated in the code chunk below which creates a united western US:

The function can take two geometries and union them, as demonstrated in the code chunk below which creates a united western block incorporating Texas (challenge: reproduce and plot the result):

### 5.2.7 Type transformations

Geometry casting is a powerful operation which enables transformation of the geometry type. It is implemented in the st_cast function from the sf package. Importantly, st_cast behaves differently on single simple feature geometry (sfg) objects, simple feature geometry column (sfc) and simple features objects.

Let’s create a multipoint to illustrate how geometry casting works on simple feature geometry (sfg) objects:

In this case, st_cast can be useful to transform the new object into linestring or polygon (Figure 5.10):

Conversion from mulitpoint to linestring is a common operation that creates a line object from ordered point observations, such as GPS measurements or geotagged media. This allows spatial operations such as the length of the path traveled. Conversion from multipoint or linestring to polygon is often used to calculate an area, for example from the set of GPS measurements taken around a lake or from the corners of a building lot.

The transformation process can be also reversed using st_cast:

For single simple feature geometries (sfg), st_cast also provides geometry casting from non-multi to multi types (e.g. POINT to MULTIPOINT) and from multi types to non-multi types. However, only the first element of the old object would remain in the second group of cases.

Geometry casting of simple features geometry column (sfc) and simple features objects works the same as for single geometries in most of the cases. One important difference is conversion between multi to non-multi types. As a result of this process, multi-objects are split into many non-multi objects.

Table 5.1: Geometry casting on simple features objects. The first column represents input objects (see Section 2.1.5.1). The next columns represent an output geometry type. The value indicates a number of elements in each object, while NA shows that geometry casting is impossible.
POINT MULTIPOINT LINESTRING MULTILINESTRING POLYGON MULTIPOLYGON GEOMETRYCOLLECTION
POINT(1) 1 1 1 NA NA NA NA
MULTIPOINT(1) 4 1 1 1 1 NA NA
LINESTRING(1) 5 1 1 1 1 NA NA
MULTILINESTRING(1) 7 2 2 1 NA NA NA
POLYGON(1) 5 1 1 1 1 1 NA
MULTIPOLYGON(1) 10 1 NA 1 2 1 1
GEOMETRYCOLLECTION(1) 9 1 NA NA NA NA 1

We would use a new object, multilinestring_sf, as an example (on the left in Figure 5.11):

You can imagine it as a road or river network. The new object has only one row that defines all the lines. This restricts the number of operations that can be done, for example it prevents adding names to each line segment or calculating lengths of single lines. The st_cast function can be used in this situation, as it separates one mutlilinestring into three linestrings:

The newly created object allows for attributes creation (see more in section 3.2.4) and length measurements:

## 5.3 Geometric operations on raster data

Geometric raster operations include the shift, flipping, mirroring, scaling, rotation or warping of images. These operations are e.g. necessary when geolocating a raster image. In turn, geolocating requires the rectification of the image, which usually includes some manual intervention one or several of the following steps depending on the task at hand (see also Liu and Mason 2009):

• Georeferencing with ground control points.
• Orthorectification also georeferences an image but additionally takes into account local topography.
• Image (co-)registration is the process of aligning one image with another (in terms of CRS, origin and resolution). Registration becomes necessary for images from the same scene but shot from different sensors or from different angles or at different points in time.

R is unsuitable for the first two points since these often require manual intervention which is why they are usually done with the help of a Desktop GIS (see also Chapter 9). On the other hand, aligning several images is possible in R and this section shows among other how to do so. This often includes changing the extent, the resolution and the origin of an image. A matching projection is of course also required but is already covered in section 6.6. In any case, there are other reasons why to perform a geometric operation on a single raster image. For instance, in chapter 13 we define metropolitan areas in Germany as 20 km2 pixels with more than 500,000 inhabitants. The original inhabitant raster, however, has a resolution of 1 km2 which is why we will decrease (aggregate) the resolution by a factor of 20 (see section 13.5). Another reason for aggregating a raster is simply to decrease runtime or save disk space. Of course, this is only possible if the task at hand allows a coarser resolution. Sometimes a coarser resolution is sufficient for the task at hand.

### 5.3.1 Geometric intersections

In section 4.3.1 we have shown how to extract values from a raster overlaid by other spatial objects. To retrieve a spatial output, we can use almost the same subsetting syntax. The only difference is that we have to make clear that we would like to keep the matrix structure by setting the drop-parameter to FALSE. This will return a raster object containing the cells whose midpoints overlap with clip.

For the same operation we can also use the intersect() and crop() command.

### 5.3.2 Extent and origin

When merging or performing map algebra on rasters, their resolution, projection, origin and/or extent has to match. Otherwise, how should we add the values of one raster with a resolution of 0.2 decimal degrees to a second with a resolution of 1 decimal degree? The same problem arises when we would like to merge satellite imagery from different sensors with different projections and resolutions. We can deal with such mismatches by aligning the rasters.

In the simplest case, two images only differ in a mismatch in extent. Following code adds one row and two columns to each side of the raster while setting all new values to an elevation of 1000 meters (5.12).

Performing an algebraic operation on two objects with differing extents in R, the raster package returns the result for the intersection, and says so in a warning.

However, we can also align the extent of two rasters with extend(). Instead of telling the function how many rows or columns should be added (as done before), we allow it to figure it out by using another raster object. Here, we extend the elev object to the extent of elev_2. The newly added rows and column receive the default value of the value parameter, i.e. NA.

The origin is the point closest to (0, 0) if you moved towards it (starting from any given cell corner of the raster) in steps of x and y resolution.

If two rasters have different origins, their cells do not overlap completely which would make map algebra impossible. To change the origin , use origin().21 Looking at figure 5.13 reveals the effect of changing the origin.

Note that changing the resolution frequently (next section) also changes the origin.

### 5.3.3 Aggregation and disaggregation

Raster datasets can also differ with regard to their resolution. To match resolutions, one can either decrease (aggregate()) or increase (disaggregate()) the resolution of one raster.22 As an example, we here change the spatial resolution of dem (found in the RQGIS package) by a factor of 5 (Fig. 5.14). Additionally, the output cell value should correspond to the mean of the input cells (note that one could use other functions as well, such as median(), sum() etc.):

By contrast, thedisaggregate() function increases the resolution. However, we have to specify a method how to fill the new cells. The disaggregate() function provides two methods. The first (nearest neighbor, method = "") simply gives all output cells the value of the nearest input cell, and hence duplicates values which leads to a blocky output image.

The bilinear method, in turn, is an interpolation technique that uses the four nearest pixel centers of the input image (salmon colored points in Fig. 5.15) to compute an average weighted by distance (arrows in Fig. 5.15 as the value of the output cell - square in the upper left corner in Fig. 5.15).

Comparing the values of dem and dem_disagg tells us that they are not identical (you can also use compareRaster() or all.equal()). However, this was hardly to be expected, since disaggregating is a simple interpolation technique. It is important to keep in mind that disaggregating results in a finer resolution, the corresponding values, however, are only as accurate as their lower resolution source.

The process of computing values for new pixel locations is also called resampling. In fact, the raster package provides a resample() function. It lets you align several raster properties in one go, namely origin, extent and resolution. By default, it uses the bilinear-interpolation.

Finally, in order to align many (possibly hundreds or thousands of) images stored on disk, you could use the gdalUtils::align_rasters() function. However, you may also use raster with very large datasets. This is because raster:

1. Lets you work with raster datasets that are too large to fit into the main memory (RAM) by only processing chunks of it.
2. Tries to facilitate parallel processing. For more information see the help pages of beginCluster() and clusteR(). Additionally, check out the Multi-core functions section in vignette("functions", package = "raster").

## 5.4 Raster-vector interactions

This section focuses on interactions between raster and vector geographic data models, introduced in Chapter 2. It includes four main techniques: raster cropping and masking using vector objects (section 5.4.1); extracting raster values using different types of vector data (section 5.4.2); and raster-vector conversion (sections 5.4.3 and 5.4.4). The above concepts are demonstrated using data used in previous chapters to understand their potential real-world applications.

### 5.4.1 Raster cropping

Many geographic data projects involve integrating data from many different sources, such as remote sensing images (rasters) and administrative boundaries (vectors). Often the extent of input raster datasets is larger than the area of interest. In this case raster cropping and masking are useful for unifying the spatial extent of input data. Both operations reduce object memory use and associated computational resources for subsequent analysis steps, and may be a necessary preprocessing step before creating attractive maps involving raster data.

We will use two objects to illustrate raster cropping:

• A raster object srtm representing elevation (meters above sea level) in Southwestern Utah.
• A vector (sf) object zion representing Zion National Park.

Both target and cropping objects must have the same projection. The following code chunk therefore not only loads the datasets, from the spDataLarge package installed in Chapter 2. It also reprojects zion (see section 6 for more on reprojection):

We will use crop() from the raster package to crop the srtm raster. crop() reduces the rectangular extent of the object passed to its first argument based on the extent of the object passed to its second argument, as demonstrated in the command below (which generates Figure 5.16:B — note the smaller extent of the raster background):

Related to crop() is the raster function mask(), which sets values outside of the bounds a the object passed to its second argument to NA. The following command therefore masks every cell outside of the the Zion National Park boundaries (Figure 5.16:C):

Changing the settings of mask() yields in different results. Setting maskvalue = 0, for example, would set all pixels outside the national park to 0. Setting inverse = TRUE would mask everything inside the bounds of the park (see ?mask for details) (Figure 5.16:D).

### 5.4.2 Raster extraction

Raster extraction is the process of identifying and returning the values associated with a ‘target’ raster at specific locations, based on a (typically vector) geographic ‘selector’ object. The results depend on the type of selector used (points, lines or polygons) and arguments passed to the raster::extract() function, which we use to demonstrate raster extraction. The reverse of raster extraction — assigning raster cell values based on vector objects — is rasterization, described in section 5.4.3.

The simplest example is extracting the value of a raster cell at specific points. For this purpose we will use zion_points, which contain a sample of 30 locations within the Zion National Park (Figure 5.17). The following command extracts elevation values from srtm and assigns the resulting vector to a new column (elevation) in the zion_points dataset:

The buffer argument can be used to specify a buffer radius (in meters) around each point. The result of raster::extract(srtm, zion_points, buffer = 1000), for example, is a list of vectors, each of which representing the values of cells inside the buffer associated with each point. In practice this example is a special case of extraction with a polygon selector, described below.

Raster extraction also works with line selectors. To demonstrate this, the code below creates zion_transect, a straight line going from northwest to southeast of the Zion National Park, illustrated in Figure 5.18:A (see section 2.1 for a recap on the vector data model):

The utility of extracting heights from a linear selector is illustrated by imagining that you are planning a hike. The method demonstrated below provides an ‘elevation profile’ of the route (the line does not need to be straight), useful for estimating how long it will take due to long climbs:

Note the use of along = TRUE and cellnumbers = TRUE arguments to return cell IDs along the path. The result is a list containing a matrix of cell IDs in the first column and elevation values in the second. The number of list elements is equal to the number of lines or polygons from which we are extracting values. The subsequent code chunk first converts this tricky matrix-in-a-list object into a simple data frame, returns the coordinates associated with each extracted cell and finds the associated distances along the transect (see ?geosphere::distm() for details):

The resulting transect_df can be used to create elevation profiles, as illustrated in Figure 5.18:B.

The final type of geographic vector object for raster extraction is polygons. Like lines and buffers, polygons tend to return many raster values per polygon. This is demonstrated in the command below, which results in a data frame with column names ID (the row number of the polygon) and srtm (associated elevation values):

Such results can be used to generate summary statistics for raster values per polygon, for example to to characterize a single region or to compare many regions. The generation of summary statistics is demonstrated the code below, which creates the object zion_srtm_df containing summary statistics for elevation values in Zion National Park (see 5.19:A):

The preceding code chunk used the tidyverse to provide summary statistics for cell values per polygon ID, as described in Chapter 3. The results provide useful summaries, for example that the maximum height in the park is around 2,661 meters (other summary statistics such as standard deviation can also be calculated in this way). Because there is only one polygon in the example a data frame with a single row is returned, but the method works when multiple selector polygons are used.

The same approach works for counting occurrences of categorical raster values within polygons. This is illustrated with a land cover dataset (nlcd) from the spDataLarge package in 5.19:B and demonstrated in the code below:

So far we have seen how raster::extract() is a flexible way of extracting raster cell values from a range of input geographic objects. An issue with the function, however, is that it is slow. If this is a problem it is useful to know about alternatives and work-arounds, three of which are presented below.

• Parallelization: this approach works when using many geographic vector selector objects by splitting them into groups and extracting cell values independently for each group (see ?raster::clusterR() for details of this approach).
• Use the velox package (Hunziker 2017), which provides a fast method for extracting raster data that fits in memory (see the packages extract vignette for details).
• Using R-GIS bridges (see Chapter 9): efficient calculation of raster statistics from polygons can be found in the SAGA function saga:gridstatisticsforpolygons, for example, which can be accessed via RQGIS.

### 5.4.3 Rasterization

Rasterization is the conversion of vector objects into their representation in raster objects. Usually, the output raster is used for quantitative analysis (e.g. analysis of terrain) or modeling. As we saw in Chapter 2 the raster data model has some characteristics that make it conducive to certain methods. Furthermore, the process of rasterization can help simplify datasets because the resulting values all have the same spatial resolution: rasterization can be seen as a special type of geographic data aggregation.

The raster package contains the function rasterize() for doing this work. Its first two arguments are x, vector object to be rasterized and y, a ‘template raster’ object defining the extent, resolution and CRS of the output. The geographic resolution of the input raster has a major impact on the results: if it is too low (cell size is too large) the result may miss the full geographic variability of the vector data; if it is too high computational times may be excessive. There are no simple rules to follow when deciding an appropriate geographic resolution, which is heavily dependent on the intended use of the results. Often the target resolution is imposed on the user, for example when the output of rasterization needs to be aligned to the existing raster.

To demonstrate rasterization in action, we will use a template raster that has the same extent and CRS as the input vector data cycle_hire_osm_projected (a dataset on cycle hire points in London illustrated in Figure 5.20:A) and spatial resolution of 1000 meters:

Rasterization is a very flexible operation: the results depend not only on the nature of the template raster, but also on the type of input vector (e.g. points, polygons) and a variety arguments taken by the rasterize() function.

To illustrate this flexibility we will try three different approaches rasterization. First we create a raster representing the presence or absence of cycle hire points (known as presence/absence rasters). In this case rasterize() requires only one argument in addition to x and y (the aformentioned vector and raster objects): a value to be transferred to all non-empty cells specified by field (results illustrated Figure 5.20:B).

The fun argument specifies summary statistics used to covert multiple observations in close proximity into associate cells in the raster object. By default fun = "last" is used but other options such as fun = "count" can be used, in this case to count the number of cycle hire points in each grid cell (the results of this operation are illustrated in Figure 5.20:C).

The new output, ch_raster2, shows the number of cycle hire points in each grid cell. The cycle hire locations have different numbers of bicycles described by the capacity variable, raising the question, what’s the capacity in each grid cell? To calculate that we must sum the field ("capacity"), resulting in output illustrated in Figure 5.20:D, calculated with the following command (other summary functions such as mean could be used):

Another dataset based on California’s polygons and borders (created below) illustrates raterization of lines. After casting the polygon objects into a multilinestring, a template raster is created, with a resolution of a 0.5 degree:

Line rasterization is demonstrated in the code below. In the resulting raster, all cells that are touched by a line get a value, as illustrated in Figure 5.21:A.

Polygon rasterization, by contrast, selects only cells whose centroids are inside the selector polygon, as illustrated in Figure 5.21:B.

As with raster::extract(), raster::rasterize() works well for most cases but is not performance optimized. Fortunately, there are several alternatives, including the fasterize::fasterize() and gdalUtils::gdal_rasterize(). The former is much (100 times+) faster than rasterize() but is currently limited to polygon rasterization. The latter is part of GDAL and therefore requires a vector file (instead of an sf object) and rasterization parameters (instead of a Raster* template object) as inputs.23

### 5.4.4 Spatial vectorization

Spatial vectorization is the counterpart of rasterization 5.4.3, but in the opposite direction. It involves converting spatially continuous raster data into spatially discrete vector data such as points, lines or polygons.

Be careful with the wording! In R vectorization refers to the possibility of replacing for-loops and alike by doing things like 1:10 / 2 (see also Wickham (2014)).

The simplest form of vectorization is to convert the centroids of raster cells into points. rasterToPoints() does exactly this for all non-NA raster grid cells (Figure 5.22). Setting the spatial parameter to TRUE ensures the output is a spatial object, not a matrix.

Another common type of spatial vectorization is the creation of contour lines representing lines of continuous height or temperatures (isotherms) for example. We will use a real-world digital elevation model (DEM) because the artificial raster elev produces parallel lines (task: verify this and explain why this happens). Contour lines can be created with the raster function rasterToContour(), which is itself a wrapper around contourLines(), as demonstrated below:

Contours can also be added to existing plots with functions such as contour(), rasterVis::contourplot() or tmap::tm_iso(). As illustrated in Figure 5.23, isolines can be labelled.

The final type of vectorisation involves conversion of rasters to polygons. This can be done with raster::rasterToPolygons(), wich converts each raster cell into a polygon consisting of five coordinates, all of which are stored in memory (explaining why rasters are often fast compared with vectors!).

This is illustrated below by converting the grain object into polygons and subsequently dissolving borders between polygons with the same attribute values (also see the dissolve argument in rasterToPolygons()). Attributes in this case are stored in a collumn called layer (see section 5.2.6 and Figure 5.24). (Note: a convenient alternative for converting rasters into polygons is spex::polygonize() which by default returns an sf object.)

## 5.5 Exercises

Some of the exercises will use a vector (random_points) and raster dataset (ndvi) from the RQGIS package. It also uses a polygonal ‘convex hull’ derived from the vector dataset (ch) to represent the area of interest:

1. Generate and plot simplified versions of the nz dataset. Experiment with different values of keep (ranging from 0.5 to 0.00005) for ms_simplify() and dTolerance (from 100 to 100,000) st_simplify() .
• At what value does the form of the result start to break-down for each method, making New Zealand unrecognizable?
• Advanced: What is different about the geometry type of the results from st_simplify() compared with the geometry type of ms_simplify()? What problems does this create and how can this be resolved?
2. In the first exercise in Chapter 4 it was established that Canterbury region had 61 of the 101 highest points in New Zealand. Using st_buffer(), how many points in nz_height are within 100 km of Canturbury?

3. Find the geographic centroid of New Zealand. How far is it from the geographic centroid of Canterbury?

4. Most world maps have a north-up orientation. A world map with a south-up orientation could be created by a reflection (one of the affine transformations not mentioned in 5.2.4) of the world object’s geometry. Write code to do so. Hint: you need to use a two-element vector for this transformation.
• Bonus: create a upside down map of your country.
5. Subset the point in p that is contained within x and y (see section 5.2.5 and Figure 5.7).
• Using base subsetting operators.
• Using an intermediary object created with st_intersection().
6. Calculate the length of the boundary lines of US states in meters. Which state has the longest border and which has the shortest? Hint: The st_length function computes the length of a LINESTRING or MULTILINESTRING geometry.

7. Aggregate the raster counting high points in New Zealand (created in the previous exercise), reduce its geographic resolution by half (so cells are 6 by 6 km) and plot the result.
• Resample the lower resolution raster back to a resolution of 3 km. How have the results changed?
8. Crop the ndvi raster using (1) the random_points dataset and (2) the ch dataset. Are there any difference in the output maps? Next, mask ndvi using these two datasets. Can you see any difference now? How can you explain that?

9. Firstly, extract values from ndvi at the points represented in random_points. Next, extract average values of ndvi using a 90 buffer around each point from random_points and compare these two sets of values. When would extracting values by buffers be more suitable than by points alone?

10. Subset points higher than 3100 meters in New Zealand (the nz_height object) and create a template raster with a resolution of 3km. Using these objects:
• Count numbers of the highest points in each grid cell.
• Find the maximum elevation in each grid cell.
11. Polygonize the grain dataset and filter all squares representing clay.
• Name two advantages and disadvantages of vector data over raster data.
• At which points would it be useful to convert rasters to vectors in your work?

### References

Douglas, David H, and Thomas K Peucker. 1973. “Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or Its Caricature.” Cartographica: The International Journal for Geographic Information and Geovisualization 10 (2): 112–22.

Visvalingam, M., and J. D. Whyatt. 1993. “Line Generalisation by Repeated Elimination of Points.” The Cartographic Journal 30 (1): 46–51. https://doi.org/10.1179/000870493786962263.

Grolemund, Garrett, and Hadley Wickham. 2016. R for Data Science. 1 edition. O’Reilly Media.

Liu, Jian-Guo, and Philippa J. Mason. 2009. Essential Image Processing and GIS for Remote Sensing. Chichester, West Sussex, UK ; Hoboken, NJ: Wiley-Blackwell.

Hunziker, Philipp. 2017. Velox: Fast Raster Manipulation and Extraction.