A Robust Strategy for Handling Linear Features in Topologically Consistent Polyline Simplification
暂无分享,去创建一个
[1] M. V. Kreveld,et al. Topologically correct subdivision simplification using the bandwidth criterion , 1998 .
[2] Jean-Claude Müller,et al. Line Generalization Based on Analysis of Shape Characteristics , 1998 .
[3] J. Muller,et al. The Removal of Spatial Conflicts in Line Generalization , 1990 .
[4] Urs Ramer,et al. An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..
[5] J. D. Whyatt,et al. Line generalisation by repeated elimination of points , 1993 .
[6] George F. Jenks. LINES, COMPUTERS, AND HUMAN FRAILTIES* , 1981 .
[7] A. Saalfeld. Topologically Consistent Line Simplification with the Douglas-Peucker Algorithm , 1999 .
[8] William Mackaness,et al. Self Evaluating Generalisation Algorithms to Automatically Derive Multi Scale Boundary Sets , 1998 .
[9] Waldo R. Tobler. An experiment in the computer generalization of maps. , 1964 .
[10] Andrea Mantler Jack Snoeyink. Safe Sets for Line Simpli cation , 2000 .
[11] David H. Douglas,et al. ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .
[12] Christopher B. Jones,et al. Characterisation and generalisation of cartographic lines using Delaunay triangulation , 2002, Int. J. Geogr. Inf. Sci..