FC-10 - GIS Data Properties
Data properties are characteristics of GIS attribute systems and values whose design and format impacts analytical and computational processing. Geospatial data are expressed at conceptual, logical, and physical levels of database abstraction intended to represent geographical information. The appropriate design of attribute systems and selection of properties should be logically consistent and support appropriate scales of measurement for representation and analysis. Geospatial concepts such as object-field views and dimensional space for relating objects and qualities form data models based on a geographic matrix and feature geometry. Three GIS approaches and their attribute system design are described: tessellations, vectors, and graphs.
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.