【摘要】 文章在介绍矢量图形压缩的意义后,分别介绍了矢量图形压缩的分治算法和线性算法,并对这两个算法进行了分析和比较。在选取适当的控制数据压缩的阈值后,分治算法和线性算法的压缩效果接近,但线性算法所需存储空间比分治算法的少,而且线性算法的时间复杂度从分治算法的O(nlogn)降低到O(n)。更多还原

【Abstract】 After introducing the purpose of vector graph compact,a Divide-and-Conquer algorithm and a linear algorithm for vector graph compact are described in this paper.Comparison and analysis are also discussed,revealing that the linear algorithm has approximate same effectiveness as the Divide-and-Conquer algorithm but the linear algorithm has the time complexity of O(n) whereas the Divide-and-Conquer algorithm has the time complexity of O(nlogn).Moreover,the linear algorithm needs less memory than the Divide-and-Conquer algorithm.更多还原