Abstract
This paper proposes a new method for the compression of vector data map. Three key steps are encompassed in the proposed method, namely, the simplification of vector data map via the elimination of vertices, the compression of removed vertices based on a clustering model, and the decoding of the compressed vector data map. The proposed compression method was implemented and applied to compress vector data map to investigate its performance in terms of the compression ratio and distortions of geometric shapes. The results show that the proposed method provides a feasible and efficient solution for the compression of vector data map and is able to achieve a promising ratio of compression and maintain the main shape characteristics of the spatial objects within the compressed vector data map.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
