DC-30 - Georeferencing and Georectification
Georeferencing is the recording of the absolute location of a data point or data points. Georectification refers to the removal of geometric distortions between sets of data points, most often the removal of terrain, platform, and sensor induced distortions from remote sensing imagery. Georeferencing is a requisite task for all spatial data, as spatial data cannot be positioned in space or evaluated with respect to other data that are without being assigned a spatial coordinate within a defined coordinate system. Many data are implicitly georeferenced (i.e., are labeled with spatial reference information), such as points collected from a global navigation satellite system (GNSS). Data that are not labeled with spatial reference information can be georeferenced using a number of approaches, the most commonly applied of which are described in this article. The majority of approaches employ known reference locations (i.e., Ground Control Points) drawn from a reliable source (e.g., GNSS, orthophotography) to calibrate georeferencing models. Regardless of georeferencing approach, positional error is present. The accuracy of georeferencing (i.e., amount of positional error) should be quantified, typically by the root mean squared error between ground control points from a reference source and the georeferenced data product.
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.