An integrated technique for automated generalization of contour maps

This paper describes an integrated technique for the generalization of contour maps. The technique consists of an objective line generalization algorithm (Li-Openshaw algorithm) and an algorithm for the derivation of a new contour from two original neighbouring contours. The algorithms are implemented in such a way that they guarantee (a) no self-intersection within a line and no cross-intersection between lines; (b) very smooth resultant contours; and (c) very coherent relationship between resultant contour lines, with shape very faithful to the original contours (at a larger scale). These conclusions have been supported by experimental tests. One of such tests are carried out through comparing the generalized results with the original contour lines and the other is through a comparison with a popular algorithm.