Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time
暂无分享,去创建一个
[1] Kurt Mehlhorn,et al. Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees , 1986, Inf. Control..
[2] Robert B McMaster,et al. A Statistical Analysis of Mathematical Measures for Linear Simplification , 1986 .
[3] Urs Ramer,et al. An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..
[4] Leonidas J. Guibas,et al. An efficient algorithm for finding the CSG representation of a simple polygon , 1988, Algorithmica.
[5] Leonidas J. Guibas,et al. Compact interval trees: a data structure for convex hulls , 1991, SODA '90.
[6] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[7] Kurt Mehlhorn,et al. Sorting Jordan sequences in linear time , 1985, SCG '85.
[8] John Hershberger,et al. An O(nlogn) implementation of the Douglas-Peucker algorithm for line simplification , 1994, SCG '94.
[9] E. R. White. Assessment of Line-Generalization Algorithms Using Characteristic Points , 1985 .
[10] J. Hershberger,et al. Speeding Up the Douglas-Peucker Line-Simplification Algorithm , 1992 .
[11] Avraham A. Melkman,et al. On-Line Construction of the Convex Hull of a Simple Polyline , 1987, Inf. Process. Lett..
[12] David H. Douglas,et al. ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .
[13] Jan van Leeuwen,et al. Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..