Effective dynamic algorithms for massive mark point aggregation display

In the GIS applications, massive mark point display has become a very important problem. Especially for the application in vehicle networking, high-load vehicle position moving increases the difficulty of the display problem. Many existing efforts have been taken on proposing aggregation algorithms for map mark points. However, all these works suffer from efficiency and scalability problems when we employ them to the application in the vehicle networking. In order to solve the problem of high efficiency map display of high load vehicle location data, this paper proposes the dynamic aggregation algorithm based on the administrative unit and the dynamic aggregation algorithm for K-means service mark point based on the administrative unit. Experimental results show that these two algorithms can make the location data of the vehicle highly efficient display on the map, and can achieve smooth interaction and friendly user experience.