Reactive data structures for geographic information systems
Reactive data structures for geographic information systems
Transmitting Vector Geospatial Data across the Internet
GIScience '02 Proceedings of the Second International Conference on Geographic Information Science
Generalization of land cover maps by mixed integer programming
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Efficient transmission of vector data over the Internet
International Journal of Geographical Information Science
A multi-resolution model of vector map data for rapid transmission over the Internet
Computers & Geosciences
Multi-resolution extension for transmission of geodata in a mobile context
Computers & Geosciences
View- and scale-based progressive transmission of vector data
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part II
Utilizing geometric coherence in the computation of map transformations
Computers & Geosciences
Hi-index | 0.00 |
A promising approach to submit a vector map from a server to a mobile client is to send a coarse representation first, which then is incrementally refined. We consider the problem of defining a sequence of such increments for areas of different land-cover classes in a planar partition. In order to submit well-generalised datasets, we propose a method of two stages: First, we create a generalised representation from a detailed dataset, using an optimisation approach that satisfies certain cartographic constraints. Second, we define a sequence of basic merge and simplification operations that transforms the most detailed dataset gradually into the generalised dataset. The obtained sequence of gradual transformations is stored without geometrical redundancy in a structure that builds up on the previously developed tGAP (topological Generalised Area Partitioning) structure. This structure and the algorithm for intermediate levels of detail (LoD) have been implemented in an object-relational database and tested for land-cover data from the official German topographic dataset ATKIS at scale 1:50000 to the target scale 1:250000. Results of these tests allow us to conclude that the data at lowest LoD and at intermediate LoDs is well generalised. Applying specialised heuristics the applied optimisation method copes with large datasets; the tGAP structure allows users to efficiently query and retrieve a dataset at a specified LoD. Data are sent progressively from the server to the client: First a coarse representation is sent, which is refined until the requested LoD is reached.