Progressive simplicial complexes
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Comparing subsets from digital spatial archives: point set similarity
Comparing subsets from digital spatial archives: point set similarity
Simplifying a polygonal subdivision while keeping it simple
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Towards a Formal Model for Multi-Resolution Spatial Maps
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
| Hi-index | 0.00 |
In distributed Geographic Information Systems (GIS) and Web-GIS, remote access to geospatial database is recognized as a time-consuming task. Progressive transmission, a technology dealing with massive amounts of data and slow communication links, can be used to solve this kind of problem because it allows users to start work with a partially delivered dataset. In this paper, we particularly discussed this problem and propose a method, by which we can progressively transmit the sequence of levels of detail of map representation while preserving topological consistency between different levels. We employ the algorithm of minimum number of safe sets to simplify the polyline. In addition, we propose a structure based on Simplicial Multi-Complex and Reactive-tree to avoid data redundancy as well as reduce the space complexity of geospatial database. We show that the volume of coarsest level data can generally be reduced to one tenth of that of the finest level.