A virtual globe-based vector data model: quaternary quadrangle vector tile model

Zhou, Mengyun; Jin, Chen; Gong, Jianya

doi:10.1080/17538947.2015.1016558

Cited by 24 publications

(11 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, a rapid method for reconstructing geometry data based on TVDM is required. Zhou et al [41] proposed a method that uses an index table to store the link relationships between discrete global grids, and it can rapidly find geometric fragments and accurately obtain the vertex series from several grids. With the same fundamental purpose, the tile-based reconstruction of geometry data can adopt this modified method as a reference.…”

Section: Tile-based Parallel Methods For Visualizationmentioning

confidence: 99%

A parallel method for accelerating visualization and interactivity for vector tiles

et al. 2019

PLoS ONE

View full text Add to dashboard Cite

Vector tile technology is developing rapidly and has received increasing attention in recent years. Compared to the raster tile, the vector tile has shown incomparable advantages, such as flexible map styles, suitability for high-resolution screens and ease of interaction. Recent studies on vector tiles have mostly focused on improving the efficiency on the server side and have overlooked the efficiency on the client side, which affects user experience. Parallel computing provides solutions to this issue. Parallel visualization of vector tiles is a typical example of embarrassing parallelism; thus, estimating the computing times of each tile accurately and decomposing the workload into multiple computing units evenly are key to the parallel visualization of vector tiles. This article adopts mainstream parallel computing and proposes an efficient tile-based parallel method for accelerating geographical feature visualization by building computational weight functions (CWFs) of geographical feature visualizations. The computing time of each vector tile is estimated by the CWF, and an effective workload decomposition strategy is proposed such that the efficiency of vector tile visualization is improved on the client side. Furthermore, a tile-based reconstruction scheme for geographical features is also proposed. Experiments show that the R-squared value of the estimated computing times of vector tiles is 0.914 and that the computational efficiency of the parallel visualization of vector tiles with the proposed workload decomposition strategy is 18.6% higher than that of common parallel visualization. Finally, users can obtain the entire set of features effectively and accurately based on the proposed reconstruction scheme.

show abstract

Section: Tile-based Parallel Methods For Visualizationmentioning

confidence: 99%

A parallel method for accelerating visualization and interactivity for vector tiles

et al. 2019

PLoS ONE

View full text Add to dashboard Cite

show abstract

“…Vector data maps are emerging as mobile users demand more interactive and informative mapping services. Vector data can present and distinguish features correctly in different colors at all resolutions [10]. Web Map Tile Service (WMTS) [11] can be used to solve the problems of the uneven distribution and the long transmission delay of vector data, which is also the map service standard for Web Map Service (WMS) [12] and pyramid technology.…”

Section: Vector Mapmentioning

confidence: 99%

GeohashTile: Vector Geographic Data Display Method Based on Geohash

Zhou

Xiang

et al. 2020

IJGI

View full text Add to dashboard Cite

In the development of geographic information-based applications for mobile devices, achieving better access speed and visual effects is the main research aim. In this paper, we propose a new geographic data display method based on Geohash, namely GeohashTile, to improve the performance of traditional geographic data display methods in data indexing, data compression, and the projection of different granularities. First, we use the Geohash encoding system to represent coordinates, as well as to partition and index large-scale geographic data. The data compression and tile encoding is accomplished by Geohash. Second, to realize a direct conversion between Geohash and screen-pixel coordinates, we adopt the relative position projection method. Finally, we improve the calculation and rendering efficiency by using the intermediate result caching method. To evaluate the GeohashTile method, we have implemented the client and the server of the GeohashTile system, which is also evaluated in a real-world environment. The results show that Geohash encoding can accurately represent latitude and longitude coordinates in vector maps, while the GeohashTile framework has obvious advantages when requesting data volume and average load time compared to the state-of-the-art GeoTile system.

show abstract

“…To speed up the visualization of large‐scale vector data with elevation information in a virtual globe, Zhou, Chen, and Gong () propose a vector tile model based on a DGGS. This vector tile model is used to render vectors (lines, points, and polygons) by draping the original 2D vector data onto the terrain surface.…”

Section: Topographically Preserved Road‐network Tile Modelmentioning

confidence: 99%

A topographically preserved road‐network tile model and optimal routing method for virtual globes

Dong

Jin

Liu

2019

Transactions in GIS

Self Cite

View full text Add to dashboard Cite

Virtual globes enable the combination of heterogeneous datasets for optimal routing analyses in transportation, environmental ecology, and construction engineering. In this study, considering the advantages of the hierarchical tiling structure and topography of virtual globes, we propose a tile‐based optimal routing method for large‐scale road networks in a virtual globe. This method designs a topographically preserved road‐network tile model by partitioning roads into tiles and constructs the road‐network pyramid from the bottom to the top. During construction, a TileArc is calculated and flagged as the shortest path in a tile. Based on the built road‐network pyramid carrying hierarchical TileArcs, a multi‐level and flexible shortest path query can be executed efficiently. The proposed method is implemented with large road networks with different road grades in a virtual globe. Experimental results verify its validity, efficiency, and exactness. Moreover, the length of the shortest path with surface distance is approximately 1.3 times longer than that with Euclidean distance.

show abstract

A virtual globe-based vector data model: quaternary quadrangle vector tile model

Cited by 24 publications

References 19 publications

A parallel method for accelerating visualization and interactivity for vector tiles

A parallel method for accelerating visualization and interactivity for vector tiles

GeohashTile: Vector Geographic Data Display Method Based on Geohash

A topographically preserved road‐network tile model and optimal routing method for virtual globes

Contact Info

Product

Resources

About