Progressive Transmission of Vector Curve Data over the Internet

Article Preview

Abstract:

This paper proposes a method for multi-scale representation of curve and elaborates the process of progressive transmission of curve data over the internet based on this method. Firstly, the importance degree of nodes and the information about public constrain points and monotone chains are stored in a monotonous linear BLG tree structure, and then the multi-scale curve is generated in real time based on this structure and the topological relationship is maintained by an optimized monotone chains intersection algorithm. Finally, the method was used in the experiment of progressive transmission of river network over the internet and verified its effectiveness.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2395-2398

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Bertolotto M, Egenhofer MJ, Progressive transmission of vector map data over the world wide web [J]. Geoinformatica. 2001, 5(4): 345-373.

Google Scholar

[2] Bisheng Yang, Ross Purves, Robert Weibel, Efficient Transmission of vector data over the internet [J]. International Journal of Geographical information science. 2007, 21(2): 215-237.

DOI: 10.1080/13658810600894281

Google Scholar

[3] Douglas DH, Peucker TK, 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.

DOI: 10.3138/fm57-6770-u75u-7727

Google Scholar

[4] Visvalingham M, Whyatt D, Line Generalization by repeated elimination of points [J]. The Cartographic Journal. 1993, 30(1): 46-51.

Google Scholar

[5] AI Bo, AI Tinghua, TANG Xinming, Progressive transmission of river network [J]. Geomatics and Information Science of Wuhan University. 2010, 35(1): 51-54.

Google Scholar

[6] AI Tinghua, LI Zhilin, LIU Yaolin, ZHOU Yanni, The changes accumulation model for streaming map data transferring over web [J]. Acta Geodaetica et Cartographica Sinica. 2009, 38(6): 514-526.

Google Scholar

[7] Saalfeld, Alan, Topologically consistent line simplification with the Douglas-Peucker algorithm [J]. Cartography and Geographic Information Science. 1999, 26(1): 7-18.

DOI: 10.1559/152304099782424901

Google Scholar

[8] Padraig Corcoran, Peter Mooney, Adam Winstanley. Planar and Non-planar Topologically Consistent Vector Map Simplification [J]. International Journal of Geographical Information Science, 2011, 25(10): 1659-1680.

DOI: 10.1080/13658816.2010.545062

Google Scholar

[9] Bentley JL, Ottmann TA, Algorithms for reporting and counting geometric intersections [J]. IEEE Transactions on Computers. 1979, 28(9): 643-647.

DOI: 10.1109/tc.1979.1675432

Google Scholar

[10] Park SC, Hayong Shin, Polygonal chain intersection, J. Computers & Graphics. 2002, 26(2): 341-350.

DOI: 10.1016/s0097-8493(02)00060-2

Google Scholar