Preserving Coincidence and Incidence Topologies in Saalfeld's Polyline Simplification Algorithm
暂无分享,去创建一个
[1] A. Saalfeld. Topologically Consistent Line Simplification with the Douglas-Peucker Algorithm , 1999 .
[2] Urs Ramer,et al. An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..
[3] Shin-Ting Wu,et al. A non-self-intersection Douglas-Peucker algorithm , 2003, 16th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2003).
[4] Avraham A. Melkman,et al. On-Line Construction of the Convex Hull of a Simple Polyline , 1987, Inf. Process. Lett..
[5] David H. Douglas,et al. ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .
[6] Stefan Schirra,et al. A new approach to subdivision simplification , 1995 .
[7] Waldo R. Tobler. An experiment in the computer generalization of maps. , 1964 .
[8] J. Hershberger,et al. Speeding Up the Douglas-Peucker Line-Simplification Algorithm , 1992 .
[9] George F. Jenks. LINES, COMPUTERS, AND HUMAN FRAILTIES* , 1981 .