[1]BERTOLOTTO M, EGENHOFER M J. Progressive transmission of vector map data over the World Wide Web [J]. Geoinformatica, 2001,5(4):345-373.[2]YANG B S, PURVES R, WEIBEL R. Efficient transmission of vector data over the Internet [J]. International Journal of Geographical Information Science, 2007,21(2):215-237.[3]杨必胜, 李清泉. World Wide Web(WWW)上矢量地图数据的多分辨率传输算法[J]. 测绘学报, 2005, 34(4):355-360.[4]艾廷华,李志林,刘耀林,等. 面向流媒体传输的空间数据变化累积模型[J]. 测绘学报, 2009, 38(6):514-526.[5]艾波,艾廷华,唐新明.矢量河网数据的渐进式传输[J].武汉大学学报:信息科学版,2010,35(1): 51-54.[6]杨必胜,李必军.空间数据网络渐进传输的概念、关键技术与研究进展[J].中国图象图形学报,2009, 14(6):1018-1023.[7]DOUGLAS D H, PEUCKER T K. Algorithms for the reduction of the number of points required to represent a digitized line or its character [J]. The Canadian Cartgrapher, 1973,10(2):112-123.[8]VISVALINGHAM M, WHYATT D. Line generalization by repeated elimination of points [J]. The Cartographic Journal, 1993, 30(1):46-51.[9]ALAN S. Topologically consistent line simplification with the Douglas-Peucker algorithm [J]. Cartography and Geographic Information Science, 1999,26(1):7-18.[10]da SILVA A C G, WU S T. A robust strategy for handling linear features in topologically consistent polyline simplification [EB/OL]. [2010-10-10].http://www.geoinfo.info/geoinfo2006/papers/p69.pdf.[11]CORCORAN P, MOONEY P, BERTOLOTTO M. Line simplification in the presence of non-planar topological relationships [C]// Lecture Notes in Geoinformation and Cartography: Bridging the Geographic Information Sciences. Berlin: Springer,2012:25-42.[12]BENTLEY J L,OTTMANN T A. Algorithms for reporting and counting geometric intersections [J]. IEEE Transactions on Computers,1979, 28(9):643-647.[13]PARK S C, SHIN H. Polygonal chain intersection [J]. Computers & Graphics, 2002, 26(2):341-350. |