Douglas D H, Peueker T K. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature [J] . The Canadian Cartographer, 1973, 10 ( 2 ) : 112-122.
[2]
Zhan H S,Li G X. Progressive transmission of vector map data based on polygonal chain simplification [J]. Lecture Notes in Computer Science, 2006, 4282:908-917.
[3]
Estkowsk R, Mitchell J S B. Simplifying a polygonal subdivision while keeping it simple [ A]. In: Proceedings of the 17th ACM Symposium on Computational Geometry[C], Boston, Massachusetts, USA, 2001:40-49.
[4]
Mustafa N, Krishnan N S G, Varadhan S. Dynamic simplification and visualization of large maps [J]. International Journal of Geographical Information Science, 2006, 20 ( 3 ):273- 320.
[5]
Mantler A, Snoeyink J. Safe sets for line simplification [ R J. In: Abstracts of the 10th Annual Fall Workshop on Computational Geometry[C],Stony Brook, New York, USA,2000.
[6]
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.
[7]
Bertolotto M, Egenhofer M J. Progressive transmission of vector map data over the World Wide Web [J]. Geolnformatica, 2001, 5 (4) : 345 -373.
