Progressive transmission of vector data based on changes accumulation model

被引:15
作者
Ai, TH [1 ]
Li, ZL [1 ]
Liu, YL [1 ]
机构
[1] Wuhan Univ, Sch Resource & Environm Sci, Wuhan 430072, Peoples R China
来源
DEVELOPMENTS IN SPATIAL DATA HANDLING | 2005年
关键词
progressive transmission; map generalization; polygon decomposition; convex hull; web GIS; changes accumulation model;
D O I
10.1007/3-540-26772-7_7
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The progressive transmission of map data over World Wide Web provides the users with a self-adaptive strategy to access remote data. It not only speeds up the web transfer but also offers an efficient navigation guide in information acquisition. The key technology in this transmission is the efficient multiple representation of spatial data and pre-organization on server site. This paper alms at offering a new model for the multiple representations of vector data, called changes accumulation model, which considers the spatial representation from one scale to another as an accumulation of the set of changes. The difference between two consecutive representations is recorded in a linear order and through gradually addition or subtraction of "change patches" the progressive transmission is realized. As an example, the progressive transmission of area features based on this model is investigated in the project. The model is built upon the hierarchical decomposition of polygon into series of convex hulls or bounding rectangles and the progressive transmission is accomplished through component of the decomposed elements.
引用
收藏
页码:85 / 96
页数:12
相关论文
共 15 条
[1]  
Ai TH, 2002, ADVANCES IN SPATIAL DATA HANDLING, P501
[2]  
Ballard D, 1981, COMMUNICATION ASS CO, V14, P310
[3]   Progressive transmission of vector map data over the World Wide Web [J].
Bertolotto, M ;
Egenhofer, MJ .
GEOINFORMATICA, 2001, 5 (04) :345-373
[4]  
BERTOLOTTO M, 1999, P 7 ACM S ADV GEOGR, P152
[5]  
Buttenfield B. P., 2002, Geographic Information Science. Second International Conference, GIScience 2002. Proceedings (Lecture Notes in Computer Science Vol.2478), P51
[6]  
BUTTENFIELD BP, 1999, P 18 INT CART ASS AU, P35
[7]   COVERING POLYGONS IS HARD [J].
CULBERSON, JC ;
RECKHOW, RA .
JOURNAL OF ALGORITHMS, 1994, 17 (01) :2-44
[8]  
HAN H, 2003, P 6 AGILE LYON FRANC
[9]  
Jiang B, 1997, CARTOGR J, V34, P111
[10]   ALGORITHMS FOR AUTOMATED LINE GENERALIZATION BASED ON A NATURAL PRINCIPLE OF OBJECTIVE GENERALIZATION [J].
LI, ZL ;
OPENSHAW, S .
INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SYSTEMS, 1992, 6 (05) :373-389