Automated Cartographic Generalization For Linear Features

Abstract

An automated method is presented for the generalization of linear features that are already in a topologically structured computer-readable form. The method consists of three stages: feature elimination; feature simplification; and interference detection and resolution. The first stage is implemented using English-like rules to specify which map features are to be eliminated at the generalized map scale. The second stage consists of the simplification of linear map features, specifically in the form of polyline simplification and riverbank combination. The third stage deals with interference detection and resolution among linear map features. Due to the width of the symbol representing a feature, interference may occur when a simplified feature is added to the generalized map and it overlaps another feature already on the generalized map. If that occurs, one or both of the interfering features have to be displaced so as to eliminate the interference between them. This displacement may cause other features to be subsequently displaced in a process called feature displacement propagation. The algorithms used to detect feature interference and to perform the subsequent feature displacement propagation are described. A FORTRAN 77 computer program called MAPEX was written to perform automated generalization of linear map features. The intended scale range for MAPEX is 1:24 000 to 1: 250 000. The results of running MAPEX on two topologically structured test data files are given, along with some of the algorithmic details used in the implementation of the program.

Map generalization in the Web age

“…Some individual operators to displace map symbols in order to retain separation distances were described for example by Nickerson (1988) for linear features and by Bundy et al (1995) for area objects. However, as indicated above, displacement operations can be expected to introduce further proximity conflicts and as a result their solution requires more complex procedures such as the optimization methods summarized below.…”

Contextual Building Selection Based on a Genetic Algorithm in Map Generalization

“…This paper uses the buffer-based approach [6,49,50] to detect conflicts (see Figure 16). In this method, a buffer area is constructed for each building with half the minimum distance threshold as the radius.…”

Utilising urban context recognition and machine learning to improve the generalisation of buildings

“…In the heyday of 'expert system' technology in the late 1980s a series of studies was reported using expert rules in map generalisation and related areas (Mackaness et al 1986;Mackaness and Fisher 1987;Nickerson 1988;Doerschler and Freeman 1992;Schylberg 1993). These early activities were followed by a relatively long period of silence, which was due to the scarcity of formalised cartographic knowledge: If no expert rules exist, no expert system can be built.…”