A Fast Algorithm for Constructing Multi-resolution Representations of Linear Features to Support the Progressive Transmission of Vector Map Data

This paper presents a fast algorithm designed to generate multi-resolution representations of linear features based on bit interleaving and map tries. The proposed algorithm constructs a hierarchical subdivision of vertices of linear features in order to support the progressive transmission of vector map data over the Internet. Its time complexity is O(n), where n is the number of input vertices of the linear features. The performance of this algorithm is compared quantitatively and qualitatively with both the Ramer-Douglas-Peucker algorithm and the simple and fast n-th point algorithm.