An Efficient Method for Parallel Visualization of Vector Maps Under the Network Environment

In order to solve the efficiency problem in vector map visualization with the traditional vector map visualization model，and to improve the capability of parallel processing for vector maps，a new approach for parallel visualization of vector maps is proposed，based on vector data spatial distribution information. This research focuses on the principles related to the collection，retrieval and analysis of vector data spatial distribution information. A workflow for decomposition and parallel processing are elaborated in this paper. Eventually，when all of the computing resources in a server cluster are sufficiently utilized，the parallel visualization of vector data can be realized. Simulation results demonstrate that the new approach proposed in this paper can improve the capability of a map server cluster，to meet the needs of massive concurrent users.