Vector overlay explained

Vector overlay is an operation (or class of operations) in a geographic information system (GIS) for integrating two or more vector spatial data sets. Terms such as polygon overlay, map overlay, and topological overlay are often used synonymously, although they are not identical in the range of operations they include. Overlay has been one of the core elements of spatial analysis in GIS since its early development. Some overlay operations, especially Intersect and Union, are implemented in all GIS software and are used in a wide variety of analytical applications, while others are less common.

Overlay is based on the fundamental principle of geography known as areal integration, in which different topics (say, climate, topography, and agriculture) can be directly compared based on a common location. It is also based on the mathematics of set theory and point-set topology.

The basic approach of a vector overlay operation is to take in two or more layers composed of vector shapes, and output a layer consisting of new shapes created from the topological relationships discovered between the input shapes. A range of specific operators allows for different types of input, and different choices in what to include in the output.

History

Prior to the advent of GIS, the overlay principle had developed as a method of literally superimposing different thematic maps (typically an isarithmic map or a chorochromatic map) drawn on transparent film (e.g., cellulose acetate) to see the interactions and find locations with specific combinations of characteristics.^[1] The technique was largely developed by landscape architects. Warren Manning appears to have used this approach to compare aspects of Billerica, Massachusetts, although his published accounts only reproduce the maps without explaining the technique.^[2] Jacqueline Tyrwhitt published instructions for the technique in an English textbook in 1950, including:^[3]

Ian McHarg was perhaps most responsible for widely publicizing this approach to planning in Design with Nature (1969), in which he gave several examples of projects on which he had consulted, such as transportation planning and land conservation.^[4]

The first true GIS, the Canada Geographic Information System (CGIS), developed during the 1960s and completed in 1971, was based on a rudimentary vector data model, and one of the earliest functions was polygon overlay.^[5] Another early vector GIS, the Polygon Information Overlay System (PIOS), developed by ESRI for San Diego County, California in 1971, also supported polygon overlay.^[6] It used the Point in polygon algorithm to find intersections quickly. Unfortunately, the results of overlay in these early systems was often prone to error.^[7]

Carl Steinitz, a landscape architect, helped found the Harvard Laboratory for Computer Graphics and Spatial Analysis, in part to develop GIS as a digital tool to implement McHarg's methods. In 1975, Thomas Peucker and Nicholas Chrisman of the Harvard Lab introduced the POLYVRT data model, one of the first to explicitly represent topological relationships and attributes in vector data.^[8] They envisioned a system that could handle multiple "polygon networks" (layers) that overlapped by computing Least Common Geographic Units (LCGU), the area where a pair of polygons overlapped, with attributes inherited from the original polygons. Chrisman and James Dougenik implemented this strategy in the WHIRLPOOL program, released in 1979 as part of the Odyssey project to develop a general-purpose GIS.^[9] This system implemented several improvements over the earlier approaches in CGIS and PIOS, and its algorithm became part of the core of GIS software for decades to come.

Algorithm

The goal of all overlay operations is to take in vector layers, and create a layer that integrates both the geometry and the attributes of the inputs.^[10] Usually, both inputs are polygon layers, but lines and points are allowed in many operations, with simpler processing.

Since the original implementation, the basic strategy of the polygon overlay algorithm has remained the same, although the vector data structures that are used have evolved.^[11]

1. Given the two input polygon layers, extract the boundary lines.
2. Cracking part A: In each layer, identify edges shared between polygons. Break each line at the junction of shared edges and remove duplicates to create a set of topologically planar connected lines. In early topological data structures such as POLYVRT and the ARC/INFO coverage, the data was natively stored this way, so this step was unnecessary.
3. Cracking part B: Find any intersections between lines from the two inputs. At each intersection, split both lines. Then merge the two line layers into a single set of topologically planar connected lines.
4. Assembling part A: Find each minimal closed ring of lines, and use it to create a polygon. Each of these will be a least common geographic unit (LCGU), with at most one "parent" polygon from each of the two inputs.
5. Assembling part B: Create an attribute table that includes the columns from both inputs. For each LCGU, determine its parent polygon from each input layer, and copy its attributes into the LCGU's row the new table; if was not in any of the polygons for one of the input layers, leave the values as null.

Parameters are usually available to allow the user to calibrate the algorithm for a particular situation. One of the earliest was the snapping or fuzzy tolerance, a threshold distance. Any pair of lines that stay within this distance of each other are collapsed into a single line, avoiding unwanted narrow sliver polygons that can occur when lines that should be coincident (for example, a river and a boundary that should follow it de jure) are digitized separately with slightly different vertices.^[12]

Operators

The basic algorithm can be modified in a number of ways to return different forms of integration between the two input layers. These different overlay operators are used to answer a variety of questions, although some are far more commonly implemented and used than others. The most common are closely analogous to operators in set theory and boolean logic, and have adopted their terms. As in these algebraic systems, the overlay operators may be commutative (giving the same result regardless of order) and/or associative (more than two inputs giving the same result regardless of the order in which they are paired).

• Intersect (ArcGIS, QGIS, Manifold, TNTmips; AND in GRASS): The result includes only the LCGUs where the two input layers intersect (overlap); that is, those with both "parents." This is identical to the set theoretic intersection of the input layers. Intersect is probably the most commonly used operator in this list. Commutative, associative
• Union (ArcGIS, QGIS, Manifold, TNTmips; or in GRASS): The result includes all of the LCGUs, both those where the inputs intersect and where they do not. This is identical to the set theoretic union of the input layers. Commutative, associative
• Subtract (TNTmips; Erase in ArcGIS; Difference in QGIS; not in GRASS; missing from Manifold): The result includes only the portions of polygons in one layer that do not overlap with the other layer; that is, the LCGUs that have no parent from the other layer. Non-commutative, non-associative
• Exclusive or (Symmetrical Difference in ArcGIS, QGIS; Exclusive Union in TNTmips; XOR in GRASS; missing from Manifold): The result includes the portions of polygons in both layers that do not overlap; that is, all LCGUs that have one parent. This could also be achieved by computing the intersection and the union, then subtracting the intersection from the union, or by subtracting each layer from the other, then computing the union of the two subtractions. Commutative, associative
• Clip (ArcGIS, QGIS, GRASS, Manifold; Extract Inside in TNTmips): The result includes the portions of polygons of one layer where they intersect the other layer. The outline is the same as the intersection, but the interior only includes the polygons of one layer rather than computing the LCGUs. Non-commutative, non-associative
• Cover (Update in ArcGIS and Manifold; Replace in TNTmips; not in QGIS or GRASS): The result includes one layer intact, with the portions of the polygons of the other layer only where the two layers do not intersect. It is called "cover" because the result looks like one layer is covering the other; it is called "update" in ArcGIS because the most common use is when the two layers represent the same theme, but one represents recent changes (e.g., new parcels) that need to replace the older ones in the same location. It can be replicated by subtracting one layer from the other, then computing the union of that result with the original first layer. Non-commutative, non-associative
• Divide (Identity in ArcGIS and Manifold; not in QGIS, TNTmips, or GRASS): The result includes all of the LCGUs that cover one of the input layers, excluding those that are only in the other layer. It is called "divide" because it has the appearance of one layer being used to divide the polygons of the other layer. It can be replicated by computing the intersection, then subtracting one layer from the other, then computing the union of these two results. Non-commutative, non-associative

Boolean overlay algebra

One of the most common uses of polygon overlay is to perform a suitability analysis, also known as a suitability model or multi-criteria evaluation. The task is to find the region that meets a set of criteria, each of which can be represented by a region. For example, the habitat of a species of wildlife might need to be A) within certain vegetation cover types, B) within a threshold distance of a water source (computed using a buffer), and C) not within a threshold distance of significant roads. Each of the criteria can be considered boolean in the sense of Boolean logic, because for any point in space, each criterion is either present or not present, and the point is either in the final habitat area or it is not (acknowledging that the criteria may be vague, but this requires more complex fuzzy suitability analysis methods). That is, which vegetation polygon the point is in is not important, only whether it is suitable or not suitable. This means that the criteria can be expressed as a Boolean logic expression, in this case, H = A and B and not C.

In a task such as this, the overlay procedure can be simplified because the individual polygons within each layer are not important, and can be dissolved into a single boolean region (consisting of one or more disjoint polygons but no adjacent polygons) representing the region that meets the criterion. With these inputs, each of the operators of Boolean logic corresponds exactly to one of the polygon overlay operators: intersect = AND, union = OR, subtract = AND NOT, exclusive or = XOR. Thus, the above habitat region would be generated by computing the intersection of A and B, and subtracting C from the result.

Thus, this particular use of polygon overlay can be treated as an algebra that is homomorphic to Boolean logic. This enables the use of GIS to solve many spatial tasks that can be reduced to simple logic.

Lines and points

Vector overlay is most commonly performed using two polygon layers as input and creating a third polygon layer. However, it is possible to perform the same algorithm (parts of it at least) on points and lines.^[13] The following operations are typically supported in GIS software:

• Intersect: The output will be of the same dimension as the lower of the inputs: Points * = Points, Lines * = Lines. This is often used as a form of spatial join, as it merges the attribute tables of the two layers analogous to a table join. An example of this would be allocating students to school districts. Because it is rare for a point to exactly fall on a line or another point, the fuzzy tolerance is often used here. QGIS has separate operations for computing a line intersection as lines (to find coincident lines) and as points.^[14]
• Subtract: The output will be of the same dimension as the primary input, with the subtraction layer being of the same or lesser dimension: Points - = Points, Lines - = Lines
• Clip: While the primary input can be points or lines, the clipping layer is usually required to be polygons, producing the same geometry as the primary input, but only including those features (or parts of lines) that are within the clipping polygons. This operation might also be considered a form of spatial query, as it retains the features of one layer based on its topological relationship to another.
• Union: Normally, both input layers are expected to be of the same dimensionality, producing an output layer including both sets of features. ArcGIS and GRASS do not allow this option with points or lines.

Implementations

Vector Overlay is included in some form in virtually every GIS software package that supports vector analysis, although the interface and underlying algorithms vary significantly.

• Esri GIS software has included polygon overlay since the first release of ARC/INFO in 1982.^[15] Each generation of Esri software (ARC/INFO, ArcGIS, ArcGIS Pro) has included a set of separate tools for each of the overlay operators (Intersect, Union, Clip, etc.). The current implementation in ArcGIS Pro recently added an alternative set of "Pairwise Overlay" tools (as of v2.7) that uses parallel processing to more efficiently process very large datasets.
• GRASS GIS (open source), although it was originally raster-based, has included overlay as part of its vector system since GRASS 3.0 (1988).^[16] Most of the polygon overlay operators are collected into a single v.overlay command, with v.clip as a separate command.
• QGIS (open source) originally incorporated GRASS as its analytical engine, but has gradually developed its own processing framework, including vector overlay.
• Manifold System implements overlay in its transformation system.
• The Turf Javascript API includes the most common overlay methods, although these operate on individual input polygon objects, not on entire layers.
• TNTmips includes several tools for overlay among its vector analysis process.

External links

• The Overlay toolset documentation in Esri ArcGIS
• v.overlay command documentation in GRASS GIS
• Vector Overlay documentation in QGIS
• Topology Overlays documentation in Manifold

Notes and References

1. Steinitz . Carl . Parker . Paul . Jordan . Lawrie . Hand-Drawn Overlays: Their History and Prospective Uses . Landcape Architecture . 1976 . 66 . 5 (September) . 444-455.
2. Manning . Warren . The Billerica Town Plan . Landscape Architecture . 1913 . 3 . 108-118.
3. Book: Tyrwhitt . Jacqueline . APRR . Town and Country Planning Textbook . 1950 . Architectural Press . Surveys for Planning.
4. Book: McHarg . Ian . Design with Nature . 1969 . 0-471-11460-X. 34.
5. Book: Tomlinson . Roger . Stewart . G.A. . Land Evaluation: Papers of a CSIRO Symposium . 1968 . Macmillan of Australia . 200-210 . A Geographic Information System for Regional Planning.
6. Book: Tomlinson . Roger F. . Calkins . Hugh W. . Marble . Duane F. . Computer handling of geographical data . 1976 . UNESCO Press.
7. Goodchild . Michael F. . Statistical aspects of the polygon overlay problem . Harvard papers on geographic information systems . 1978 . 6.
8. Peucker . Thomas K. . Chrisman . Nicholas . Cartographic Data Structures . The American Cartographer . 1975 . 2 . 1 . 55-69 . 10.1559/152304075784447289.
9. Dougenik . James . WHIRLPOOL: A geometric processor for polygon coverage data . Proceedings of the International Symposium on Cartography and Computing (Auto-Carto IV) . 1979 . 2 . 304-311 .
10. Book: Bolstad . Paul . GIS Fundamentals: A First Text on Geographic Information Systems . 2008 . Eider Press . 352 . 3rd.
11. Book: Chrisman . Nicholas R. . Exploring Geographic Information Systems . 2002 . Wiley . 125-137 . 2nd.
12. Book: Lo . C.P. . Yeung . Albert K.W. . Concepts and Techniques of Geographic Information Systems . 2002 . Prentice Hall . 0-13-080427-4 . 211.
13. Web site: Esri . Intersect (Analysis) . ArcGIS Pro Documentation . 29 October 2021.
14. Web site: QGIS . Line intersections . QGIS 3.16 documentation.
15. Morehouse . Scott . ARC/INFO: A geo-relational model for spatial information . Proceedings of the International Symposium on Cartography and Computing (Auto-Carto VII) . 1985 . 388 .
16. Westervelt . James . GRASS Roots . Proceedings of the FOSS/GRASS Users Conference . 2004 . 26 October 2021.