Map Generalization as a Graph Drawing Problem

摘要: A map may be regarded as a plane graph drawing; and, with the growth of field computer cartography, is increasingly treated straight-line drawing. Map generalization, process redrawing at smaller scale, can, hence, drawing problem. The initial version map, input to process, along that graph. derived output also combinatorially minor edges and vertices obtained through sequence selection simplification operations. positioning those must placement displacement Considerable research development has already been undertaken in areas feature simplification. Some generally adequate heuristic solutions problems are use today for many types maps. For other maps, such topographic these insufficient because they do not simultaneously address more difficult features.