Abstract: The vector tile is small in size and highly compressible, which is less constrained by the network bandwidth overhead and storage space. Compared with the desktop point annotation processing, Vector tiles not only faced the problems that the important annotations are overlaped by the minor annotations， the same level annotations are overlaped mutally annotations and elements are overlaped each other, but the problem that the annotation is cutting by the edge of the tile is not fully displayed. These problems have seriously affected the readability of the map and the function of information transmission. Aiming at the above problems, this paper summarizes the principles of vector tile point annotation processing, designs the organization structure of vector tiles, determines the JSON organization form of annotation collocation table, clears the drawing process of vector tile point annotation, uses quadtree coding to target filtering according to the characteristics of vector tiles, and uses R-tree as an efficient spatial index, and uses note-based priority obstacle avoidance technology to solve the above-mentioned problems caused by processing points.

Key words: vector tiles, annotation processing, overlap, priority, R-tree