Search Page

Showing 1 - 10 of 12
AM-06 - Grid Operations and Map Algebra

Grid operations are manipulation and analytical computations performed on raster data. Map Algebra is a language for organizing and implementing grid operations in Geographic Information Systems (GIS) software, and is typically categorized into Local, Focal, and Zonal functions, where each function typically ingests one or more grids and outputs a new grid. The value of a specific grid cell in the output grid for Local functions is determined from the value(s) of the analogous cell position(s) in the input grid(s), for Focal functions from the grid cell values drawn from a neighborhood around the specific output grid cell, and for Zonal functions from a set of grid cells specified in a separate zone grid. Individual functions within a category vary by applying a different arithmetic, statistical, or other type of operator to the function. Map Algebra also includes Global and Block function categories. Grid operations can be categorized as data manipulation procedures or within domain-specific applications, such as terrain analysis or image processing. Grid operations are employed in a variety of GIS-based analyses, but are particularly widely used for suitability modeling and environmental analyses.

AM-40 - Areal Interpolation

Areal interpolation is the process of transforming spatial data from source zones with known values or attributes to target zones with unknown attributes. It generates estimates of source zone attributes over target zone areas. It aligns areal spatial data attributes over a single spatial framework (target zones) to overcome differences in areal reporting units due to historical boundary changes of reporting areas, integrating data from domains with different reporting conventions or in situations when spatially detailed information is not available. Fundamentally, it requires assumptions about how the target zone attribute relates to the source zones. Areal interpolation approaches can be grouped into two broad categories: methods that link target and source zones by their spatial properties (area to point, pycnophylactic and areal weighed interpolation) and methods that use ancillary or auxiliary information to control, inform, guide, and constrain the interpolation process (dasymetric, statistical, streetweighted and point-based interpolation). Additionally, there are new opportunities to use novel data sources to inform areal interpolation arising from the many new forms of spatial data supported by ubiquitous web- and GPS-enabled technologies including social media, PoI check-ins, spatial data portals (e.g for crime, house sales, microblogging sites) and collaborative mapping activities (e.g. OpenStreetMap).

AM-04 - Overlay

Overlay operation is a critical and powerful tool in GIS that superimposes spatial and attribute information from various thematic map layers to produce new information. Overlay operations facilitate spatial analysis and modeling processes when being used with other spatial operations (e.g. buffer, dissolve, merge) to solve real-world problems. For both vector and raster data models, the input layers need to be spatially aligned precisely with each other to ensure a correct overlay operation. In general, vector overlay is geometrically and computationally complex. Some most used vector overlay operations include intersection, union, erase, and clip. Raster overlay combines multiple raster layers cell by cell through Boolean, arithmetic, or comparison operators. This article provides an overview of the fundamentals of overlay operations, how they are implemented in vector and raster data, and how suitability analysis is conducted.

AM-46 - Location-allocation modeling

Location-allocation models involve two principal elements: 1) multiple facility location; and 2) the allocation of the services or products provided by those facilities to places of demand. Such models are used in the design of logistic systems like supply chains, especially warehouse and factory location, as well as in the location of public services. Public service location models involve objectives that often maximize access and levels of service, while private sector applications usually attempt to minimize cost. Such models are often hard to solve and involve the use of integer-linear programming software or sophisticated heuristics. Some models can be solved with functionality provided in GIS packages and other models are applied, loosely coupled, with GIS. We provide a short description of formulating two different models as well as discuss how they are solved.

FC-04 - Perception and Cognitive Processing of Geographic Phenomena: a Choropleth Map Case Study

The near ubiquity of maps has created a population the is well adept at reading and understanding maps.  But, while maps are familiar, understanding how the human brain processes that information is less known.  Discussing the processing of geographic phenomena could take different avenues: specific geospatial thinking skills, general perception and cognition processes, or even different parts of the human brain that are invoked when thinking geographically.  This entry focuses on tracing the processing of geographic phenomena using a choropleth map case study, beginning from perception — the moment the phenomena enter the human brain via our senses, to cognition — how meaning and understanding are generated. 

AM-17 - Intervisibility, Line-of-Sight, and Viewsheds

The visibility of a place refers to whether it can be seen by observers from one or multiple other locations. Modeling the visibility of points has various applications in GIS, such as placement of observation points, military observation, line-of-sight communication, optimal path route planning, and urban design. This chapter provides a brief introduction to visibility analysis, including an overview of basic conceptions in visibility analysis, the methods for computing intervisibility using discrete and continuous approaches based on DEM and TINs, the process of intervisibility analysis, viewshed and reverse viewshed analysis. Several practical applications involving visibility analysis are illustrated for geographical problem-solving. Finally, existing software and toolboxes for visibility analysis are introduced.

FC-17 - Proximity and Distance Decay

Distance decay is an essential concept in geography. At its core, distance decay describes how the relationship between two entities generally gets weaker as the separation between them increases. Inspired by long-standing ideas in physics, the concept of distance decay is used by geographers to analyze two kinds of relationships. First, the term expresses how measured interactions (such as trade volume or migration flow) generally decrease as the separation between entities increases, as is analyzed by spatial interaction models. Second, the term is used to describe how the implicit similarity between observations changes with separation, as measured by variograms. For either type of relationship, we discuss how "separation" must be clearly articulated according to the mechanism of the relationship under study. In doing this, we suggest that separation need not refer to positions in space or time, but can involve social or behavioral perceptions of separation, too. To close, we present how the "death of distance" is transforming distance decay in uneven ways.

FC-22 - Geometric Primitives and Algorithms

Geometric primitives are the representations used and computations performed in a GIS that concern the spatial aspects of the data, data objects described by coordinates. In vector geometry, we distinguish in zero-, one-, two-, and three-dimensional objects, better known as points, linear features, areal or planar features, and volumetric features. A GIS stores and performs computations on all of these. Often, planar features form a collective known as a (spatial) subdivision. Computations on geometric objects show up in data simplification, neighborhood analysis, spatial clustering, spatial interpolation, automated text placement, segmentation of trajectories, map matching, and many other tasks. They should be contrasted with computations on attributes or networks.

There are various kinds of vector data models for subdivisions. The classical ones are known as spaghetti and pizza models, but nowadays it is recognized that topological data models are the representation of choice. We overview these models briefly.

Computations range from simple to highly complex: deciding whether a point lies in a rectangle needs four comparisons, whereas performing map overlay on two subdivisions requires advanced knowledge of algorithm design. We introduce map overlay, Voronoi diagrams, and Delaunay triangulations and mention algorithmic approaches to compute them.

AM-07 - Point Pattern Analysis

Point pattern analysis (PPA) focuses on the analysis, modeling, visualization, and interpretation of point data. With the increasing availability of big geo-data, such as mobile phone records and social media check-ins, more and more individual-level point data are generated daily. PPA provides an effective approach to analyzing the distribution of such data. This entry provides an overview of commonly used methods in PPA, as well as demonstrates the utility of these methods for scientific investigation based on a classic case study: the 1854 cholera outbreaks in London.

AM-38 - Pattern Recognition and Matching

People recognize and characterize patterns to understand the world. Spatial data exhibit distinctive characteristics that render most aspatial recognition and matching methods unsuitable or inefficient. In past decades, a plethora of methods have been developed for spatial pattern recognition and matching to account for these spatial characteristics. This entry first focuses on the methods of spatial pattern recognition, including an overview of the basic concepts and common  types. Methods for spatial pattern matching are then introduced. An example scenario of the distribution of tree species in the Arbuckle Mountains of south-central Oklahoma illustrates covered concepts. The entry concludes with brief remarks on continuing challenges and future directions in spatial pattern recognition and matching in the Big Data and artificial intelligence era.